# Martin Kutz

According to our database

Collaborative distances:

^{1}, Martin Kutz authored at least 22 papers between 2002 and 2015.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepage:

#### On csauthors.net:

## Bibliography

2015

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

Discrete & Computational Geometry, 2015

Recurrence quantification analysis across sleep stages.

Biomed. Signal Proc. and Control, 2015

2012

iIgMV - interactive Interface for generative Music and Visualizations.

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

2011

Faster algorithms for computing longest common increasing subsequences.

J. Discrete Algorithms, 2011

2010

Computing Geometric Minimum-Dilation Graphs is NP-Hard.

Int. J. Comput. Geometry Appl., 2010

2009

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

^{3}.
ACM Journal of Experimental Algorithmics, 2009

2008

Simultaneous matchings: Hardness and approximation.

J. Comput. Syst. Sci., 2008

On the Locality of Extracting a 2-Manifold in .

Proceedings of the Algorithm Theory, 2008

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

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

2007

Determining the consistency of partial tree descriptions.

Artif. Intell., 2007

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

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

2006

Computing Geometric Minimum-Dilation Graphs Is NP-Hard.

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

Faster Algorithms for Computing Longest Common Increasing Subsequences.

Proceedings of the Combinatorial Pattern Matching, 17th Annual Symposium, 2006

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

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.

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

2005

Conway's Angel in three dimensions.

Theor. Comput. Sci., 2005

Simultaneous Matchings.

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

Angel, Devil, and King.

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

2003

Fast Smallest-Enclosing-Ball Computation in High Dimensions.

Proceedings of the Algorithms, 2003

The Complexity of Boolean Matrix Root Computation.

Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

2002

Lower Bounds for Lucas Chains.

SIAM J. Comput., 2002

Pure Dominance Constraints.

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