Martin Kutz

Publication Activity (10 Years)

Years Active: 2002-2015
Publications (10 Years): 0

Top Topics

Rigid Registration

Music Recommendation

Iterative Closest Point Algorithm

Top Venues

Biomed. Signal Process. Control.

Discret. Comput. Geom.

Mensch & Computer Workshopband

Publications

Rolf Klein, Martin Kutz, Rainer Penninger
Most Finite Point Sets in the Plane have Dilation > 1. Discret. Comput. Geom. 53 (1) (2015)
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 (2015)
Damian T. Dziwis, Felix Hofschulte, Michael Kutz, Martin Kutz
iIgMV - interactive Interface for generative Music and Visualizations. Mensch & Computer Workshopband (2012)
Martin Kutz, Gerth Stølting Brodal, Kanela Kaligosi, Irit Katriel
Faster algorithms for computing longest common increasing subsequences. J. Discrete Algorithms 9 (4) (2011)
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) (2010)
Daniel Dumitriu, Stefan Funke, Martin Kutz, Nikola Milosavljevic
. ACM J. Exp. Algorithmics 14 (2009)
Daniel Dumitriu, Stefan Funke, Martin Kutz, Nikola Milosavljevic
On the Locality of Extracting a 2-Manifold in . SWAT (2008)
Martin Kutz, Khaled M. Elbassioni, Irit Katriel, Meena Mahajan
Simultaneous matchings: Hardness and approximation. J. Comput. Syst. Sci. 74 (5) (2008)
Daniel Dumitriu, Stefan Funke, Martin Kutz, Nikola Milosavljevic
How much Geometry it takes to Reconstruct a 2-Manifold in R3. ALENEX (2008)
Manuel Bodirsky, Martin Kutz
Determining the consistency of partial tree descriptions. Artif. Intell. 171 (2-3) (2007)
Martin Kutz, Pascal Schweitzer
ScrewBox: a Randomized Certifying Graph-Non-Isomorphism Algorithm. ALENEX (2007)
Martin Kutz
Computing shortest non-trivial cycles on orientable surfaces of bounded genus in almost linear time. SCG (2006)
Rolf Klein, Martin Kutz
Computing Geometric Minimum-Dilation Graphs Is NP-Hard. Graph Drawing (2006)
Gerth Stølting Brodal, Kanela Kaligosi, Irit Katriel, Martin Kutz
Faster Algorithms for Computing Longest Common Increasing Subsequences. CPM (2006)
Rolf Klein, Martin Kutz
The density of iterated crossing points and a gap result for triangulations of finite point sets CoRR (2006)
Rolf Klein, Martin Kutz
The density of iterated crossing points and a gap result for triangulations of finite point sets. SCG (2006)
Martin Kutz
Computing shortest non-trivial cycles on orientable surfaces of bounded genus in almost linear time CoRR (2005)
Martin Kutz
Conway's Angel in three dimensions. Theor. Comput. Sci. 349 (3) (2005)
Khaled M. Elbassioni, Irit Katriel, Martin Kutz, Meena Mahajan
Simultaneous Matchings. ISAAC (2005)
Martin Kutz, Attila Pór
Angel, Devil, and King. COCOON (2005)
Martin Kutz
The complexity of Boolean matrix root computation. Theor. Comput. Sci. 325 (3) (2004)
Kaspar Fischer, Bernd Gärtner, Martin Kutz
Fast Smallest-Enclosing-Ball Computation in High Dimensions. ESA (2003)
Martin Kutz
The Complexity of Boolean Matrix Root Computation. COCOON (2003)
Martin Kutz
Lower Bounds for Lucas Chains. SIAM J. Comput. 31 (6) (2002)
Manuel Bodirsky, Martin Kutz
Pure Dominance Constraints. STACS (2002)