Search the dblp DataBase

Publications of Author

1. Martin Kutz
   The Complexity of Boolean Matrix Root Computation. [Citation Graph (0, 0)][DBLP]
   COCOON, 2003, pp:212-221 [Conf]
   
2. Martin Kutz, Attila Pór
   Angel, Devil, and King. [Citation Graph (0, 0)][DBLP]
   COCOON, 2005, pp:925-934 [Conf]
   
3. Rolf Klein, Martin Kutz
   The density of iterated crossing points and a gap result for triangulations of finite point sets. [Citation Graph (0, 0)][DBLP]
   Symposium on Computational Geometry, 2006, pp:264-272 [Conf]
   
4. Martin Kutz
   Computing shortest non-trivial cycles on orientable surfaces of bounded genus in almost linear time. [Citation Graph (0, 0)][DBLP]
   Symposium on Computational Geometry, 2006, pp:430-438 [Conf]
   
5. Gerth Stølting Brodal, Kanela Kaligosi, Irit Katriel, Martin Kutz
   Faster Algorithms for Computing Longest Common Increasing Subsequences. [Citation Graph (0, 0)][DBLP]
   CPM, 2006, pp:330-341 [Conf]
   
6. Kaspar Fischer, Bernd Gärtner, Martin Kutz
   Fast Smallest-Enclosing-Ball Computation in High Dimensions. [Citation Graph (0, 0)][DBLP]
   ESA, 2003, pp:630-641 [Conf]
   
7. Rolf Klein, Martin Kutz
   Computing Geometric Minimum-Dilation Graphs Is NP-Hard. [Citation Graph (0, 0)][DBLP]
   Graph Drawing, 2006, pp:196-207 [Conf]
   
8. Khaled M. Elbassioni, Irit Katriel, Martin Kutz, Meena Mahajan
   Simultaneous Matchings. [Citation Graph (0, 0)][DBLP]
   ISAAC, 2005, pp:106-115 [Conf]
   
9. Manuel Bodirsky, Martin Kutz
   Pure Dominance Constraints. [Citation Graph (0, 0)][DBLP]
   STACS, 2002, pp:287-298 [Conf]
   
10. Manuel Bodirsky, Martin Kutz
    Determining the consistency of partial tree descriptions. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2007, v:171, n:2-3, pp:185-196 [Journal]
    
11. Martin Kutz
    Lower Bounds for Lucas Chains. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:6, pp:1896-1908 [Journal]
    
12. Martin Kutz
    The complexity of Boolean matrix root computation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:325, n:3, pp:373-390 [Journal]
    
13. Martin Kutz
    Conway's Angel in three dimensions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:349, n:3, pp:443-451 [Journal]
    
14. Martin Kutz, Pascal Schweitzer
    ScrewBox: a Randomized Certifying Graph-Non-Isomorphism Algorithm. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2007, pp:- [Conf]
    
15. Rolf Klein, Martin Kutz
    The density of iterated crossing points and a gap result for triangulations of finite point sets [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
    
16. 
    How much Geometry it takes to Reconstruct a 2-Manifold in R3. [Citation Graph (, )][DBLP]
    
    
17. 
    On the Locality of Extracting a 2-Manifold in . [Citation Graph (, )][DBLP]
    
    
18. 
    A pair of trees without a simultaneous geometric embedding in the plane [Citation Graph (, )][DBLP]
    
    
19. 
    Computing shortest non-trivial cycles on orientable surfaces of bounded genus in almost linear time [Citation Graph (, )][DBLP]