Martin Kutz

According to our database, Martin Kutz authored at least 21 papers between 2002 and 2015.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2015

Most Finite Point Sets in the Plane have Dilation > 1.

Rolf Klein, Martin Kutz, Rainer Penninger

Discret. Comput. Geom., 2015

Recurrence quantification analysis across sleep stages.

Jerome Rolink, Martin Kutz, Pedro Fonseca, Xi Long, Berno J. E. Misgeld, Steffen Leonhardt

Biomed. Signal Process. Control., 2015

2012

iIgMV - interactive Interface for generative Music and Visualizations.

Damian T. Dziwis, Felix Hofschulte, Michael Kutz, Martin Kutz

Proceedings of the Mensch & Computer 2012 - Workshopband: interaktiv informiert, 2012

2011

Faster algorithms for computing longest common increasing subsequences.

Martin Kutz, Gerth Stølting Brodal, Kanela Kaligosi, Irit Katriel

J. Discrete Algorithms, 2011

2010

Computing Geometric Minimum-Dilation Graphs is NP-Hard.

Panos Giannopoulos, Rolf Klein, Christian Knauer, Martin Kutz, Dániel Marx

Int. J. Comput. Geom. Appl., 2010

2009

How much geometry it takes to reconstruct a 2-manifold in R³.

Daniel Dumitriu, Stefan Funke, Martin Kutz, Nikola Milosavljevic

ACM J. Exp. Algorithmics, 2009

2008

Simultaneous matchings: Hardness and approximation.

Martin Kutz, Khaled M. Elbassioni, Irit Katriel, Meena Mahajan

J. Comput. Syst. Sci., 2008

On the Locality of Extracting a 2-Manifold in .

Daniel Dumitriu, Stefan Funke, Martin Kutz, Nikola Milosavljevic

Proceedings of the Algorithm Theory, 2008

How much Geometry it takes to Reconstruct a 2-Manifold in R3.

Daniel Dumitriu, Stefan Funke, Martin Kutz, Nikola Milosavljevic

Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments, 2008

2007

Determining the consistency of partial tree descriptions.

Manuel Bodirsky, Martin Kutz

Artif. Intell., 2007

ScrewBox: a Randomized Certifying Graph-Non-Isomorphism Algorithm.

Martin Kutz, Pascal Schweitzer

Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, 2007

2006

Computing Geometric Minimum-Dilation Graphs Is NP-Hard.

Rolf Klein, Martin Kutz

Proceedings of the Graph Drawing, 14th International Symposium, 2006

Computing shortest non-trivial cycles on orientable surfaces of bounded genus in almost linear time.

Martin Kutz

Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

The density of iterated crossing points and a gap result for triangulations of finite point sets.

Rolf Klein, Martin Kutz

Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

2005

Conway's Angel in three dimensions.

Martin Kutz

Theor. Comput. Sci., 2005

Simultaneous Matchings.

Khaled M. Elbassioni, Irit Katriel, Martin Kutz, Meena Mahajan

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Angel, Devil, and King.

Martin Kutz, Attila Pór

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

The complexity of Boolean matrix root computation.

Martin Kutz

Theor. Comput. Sci., 2004

2003

Fast Smallest-Enclosing-Ball Computation in High Dimensions.

Kaspar Fischer, Bernd Gärtner, Martin Kutz

Proceedings of the Algorithms, 2003

2002

Lower Bounds for Lucas Chains.

Martin Kutz

SIAM J. Comput., 2002

Pure Dominance Constraints.

Manuel Bodirsky, Martin Kutz

Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002