default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Kutz
Person information
- affiliation: Max Planck Institute for Informatics, Saarbrücken, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j10]Jerome Rolink, Martin Kutz, Pedro Fonseca
, Xi Long, Berno J. E. Misgeld, Steffen Leonhardt:
Recurrence quantification analysis across sleep stages. Biomed. Signal Process. Control. 20: 107-116 (2015)- [j9]Rolf Klein, Martin Kutz, Rainer Penninger:
Most Finite Point Sets in the Plane have Dilation > 1. Discret. Comput. Geom. 53(1): 80-106 (2015) - 2012
- [c13]Damian T. Dziwis, Felix Hofschulte, Michael Kutz, Martin Kutz:
iIgMV - interactive Interface for generative Music and Visualizations. MuC (Workshopband) 2012: 293-298 - 2011
- [j8]Martin Kutz, Gerth Stølting Brodal, Kanela Kaligosi, Irit Katriel:
Faster algorithms for computing longest common increasing subsequences. J. Discrete Algorithms 9(4): 314-325 (2011) - 2010
- [j7]Panos Giannopoulos, Rolf Klein, Christian Knauer, Martin Kutz, Dániel Marx:
Computing Geometric Minimum-Dilation Graphs is NP-Hard. Int. J. Comput. Geom. Appl. 20(2): 147-173 (2010)
2000 – 2009
- 2009
- [j6]Daniel Dumitriu, Stefan Funke, Martin Kutz, Nikola Milosavljevic:
How much geometry it takes to reconstruct a 2-manifold in R3. ACM J. Exp. Algorithmics 14 (2009) - 2008
- [j5]Martin Kutz, Khaled M. Elbassioni, Irit Katriel, Meena Mahajan:
Simultaneous matchings: Hardness and approximation. J. Comput. Syst. Sci. 74(5): 884-897 (2008) - [c12]Daniel Dumitriu, Stefan Funke, Martin Kutz, Nikola Milosavljevic:
How much Geometry it takes to Reconstruct a 2-Manifold in R3. ALENEX 2008: 65-74 - [c11]Daniel Dumitriu, Stefan Funke, Martin Kutz, Nikola Milosavljevic:
On the Locality of Extracting a 2-Manifold in . SWAT 2008: 270-281 - 2007
- [j4]Manuel Bodirsky, Martin Kutz:
Determining the consistency of partial tree descriptions. Artif. Intell. 171(2-3): 185-196 (2007) - [c10]Martin Kutz, Pascal Schweitzer:
ScrewBox: a Randomized Certifying Graph-Non-Isomorphism Algorithm. ALENEX 2007 - 2006
- [c9]Rolf Klein, Martin Kutz:
The density of iterated crossing points and a gap result for triangulations of finite point sets. SCG 2006: 264-272 - [c8]Martin Kutz:
Computing shortest non-trivial cycles on orientable surfaces of bounded genus in almost linear time. SCG 2006: 430-438 - [c7]Gerth Stølting Brodal, Kanela Kaligosi, Irit Katriel, Martin Kutz:
Faster Algorithms for Computing Longest Common Increasing Subsequences. CPM 2006: 330-341 - [c6]Rolf Klein, Martin Kutz:
Computing Geometric Minimum-Dilation Graphs Is NP-Hard. GD 2006: 196-207 - [i2]Rolf Klein, Martin Kutz:
The density of iterated crossing points and a gap result for triangulations of finite point sets. CoRR abs/cs/0601033 (2006) - 2005
- [j3]Martin Kutz:
Conway's Angel in three dimensions. Theor. Comput. Sci. 349(3): 443-451 (2005) - [c5]Martin Kutz, Attila Pór:
Angel, Devil, and King. COCOON 2005: 925-934 - [c4]Khaled M. Elbassioni, Irit Katriel, Martin Kutz, Meena Mahajan:
Simultaneous Matchings. ISAAC 2005: 106-115 - [i1]Martin Kutz:
Computing shortest non-trivial cycles on orientable surfaces of bounded genus in almost linear time. CoRR abs/cs/0512064 (2005) - 2004
- [j2]Martin Kutz:
The complexity of Boolean matrix root computation. Theor. Comput. Sci. 325(3): 373-390 (2004) - 2003
- [c3]Martin Kutz:
The Complexity of Boolean Matrix Root Computation. COCOON 2003: 212-221 - [c2]Kaspar Fischer, Bernd Gärtner, Martin Kutz:
Fast Smallest-Enclosing-Ball Computation in High Dimensions. ESA 2003: 630-641 - 2002
- [j1]Martin Kutz:
Lower Bounds for Lucas Chains. SIAM J. Comput. 31(6): 1896-1908 (2002) - [c1]Manuel Bodirsky, Martin Kutz:
Pure Dominance Constraints. STACS 2002: 287-298
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
