Your search returned the following 16 documents:

16. Computing geometric minimum-dilation graphs is NP-hard
    Panos Giannopoulos, Rolf Klein, Martin Kutz, and Daniel Marx
    International Journal of Computational Geometry & Applications 20 (2): 147-173, 2010
    
15. How Much Geometry It Takes to Reconstruct a 2-Manifold in R 3
    Daniel Dumitriu, Stefan Funke, Martin Kutz, and Nikola Milosavljevic
    ACM Journal of Experimental Algorithms 14: 2.2:1-2.2:17, 2009
    
14. How much Geometry it takes to Reconstruct a 2-Manifold in $R^3$
    Daniel Dumitriu, Stefan Funke, Martin Kutz, and Nikola Milosavljevic
    In: 10th Workshop on Algorithm Engineering and Experiments (ALENEX-2008), San Francisco, USA, 2008, 65-74
    
13. On the Locality of Extracting a 2-Manifold in $R^3$
    Daniel Dumitriu, Stefan Funke, Martin Kutz, and Nikola Milosavljevic
    In: 11th Scandinavian Workshop on Algorithm Theory (SWAT-2008), Göteborg, Sweden, 2008, 270-281
    
12. On the Locality of Extracting a 2-Manifold in $R^3$
    Daniel Dumitriu, Stefan Funke, Martin Kutz, and Nikola Milosavljevic
    In: Collection of abstracts of the 24th European Workshop on Computational Geometry, Nancy, France, 2008, 205-208
    
11. Simultaneous matchings: Hardness and approximation
    Martin Kutz, Khaled Elbassioni, Irit Katriel, and Meena Mahajan
    J. Comput. Syst. Sci. 74 (5): 884-897, 2008
    
10. Computing Geometric Minimum-Dilation Graphs Is NP-Hard
    Rolf Klein and Martin Kutz
    In: Graph Drawing : 14th International Symposium, GD 2006, Karlsruhe, Germany, 2007, 196-207
    
    
9. Determining the consistency of partial tree descriptions
   Manuel Bodirsky and Martin Kutz
   Artificial Intelligence 171 (2/3): 185-196, 2007
   
8. ScrewBox: a Randomized Certifying Graph Non-Isomorphism Algorithm
   Martin Kutz and Pascal Schweitzer
   In: 9th Workshop on Algorithm Engineering and Experiments (ALENEX'07), New Orleans, USA, 2007, 150-157
   
7. Computing Shortest Non-Trivial Cycles on Orientable Surfaces of Bounded Genus in Almost Linear Time.
   Martin Kutz
   In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, Sedona, Arizona, USA, 2006, 430-437
   
6. Faster Algorithms for Computing Longest Common Increasing Subsequences
   Gerth Stølting Brodal, Kanela Kaligosi, Irit Katriel, and Martin Kutz
   In: Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006, Barcelona, Spain, 2006, 330-341
   
5. The Density of Iterated Crossing Points and a Gap Result for Triangulations of Finite Point Sets
   Rolf Klein and Martin Kutz
   In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, Sedona, Arizona, USA, 2006, 264-272
   
   
4. Angel, Devil, and King
   Martin Kutz and Attila Pór
   In: Computing and Combinatorics : 11th Annual International Conference, COCOON 2005, Kunming, China, 2005, 925-934
   [PS: Download: AG1_001.ps]
   
3. Conway's Angel in three dimensions
   Martin Kutz
   Theoretical Computer Science 349 (3): 443-451, 2005
   
2. Simultaneous Matchings
   Khaled M. Elbassioni, Irit Katriel, Martin Kutz, and Meena Mahajan
   In: Algorithms and computation : 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, 2005, 106-115
   
1. Weak Positional Games on Hypergraphs of Rank Three
   Martin Kutz
   In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), Berlin, Germany, 2005, 31-36. Note: to appear