- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| c13 |      | Damian T. Dziwis, Felix Hofschulte, Michael Kutz, Martin Kutz: iIgMV - interactive Interface for generative Music and Visualizations. Mensch & Computer Workshopband 2012: 293-298 |
| 2011 | ||
| j8 | | Martin Kutz, Gerth Stølting Brodal, Kanela Kaligosi, Irit Katriel: Faster algorithms for computing longest common increasing subsequences. J. Discrete Algorithms 9(4): 314-325 (2011) |
| 2010 | ||
| j7 | | Panos Giannopoulos, Rolf Klein, Christian Knauer, Martin Kutz, Dániel Marx: Computing Geometric Minimum-Dilation Graphs is NP-Hard. Int. J. Comput. Geometry Appl. 20(2): 147-173 (2010) |
| 2009 | ||
| j6 | | Daniel Dumitriu, Stefan Funke, Martin Kutz, Nikola Milosavljevic: How much geometry it takes to reconstruct a 2-manifold in R3. ACM Journal of Experimental Algorithmics 14 (2009) |
| 2008 | ||
| j5 | | Martin Kutz, Khaled M. Elbassioni, Irit Katriel, Meena Mahajan: Simultaneous matchings: Hardness and approximation. J. Comput. Syst. Sci. 74(5): 884-897 (2008) |
| c12 | | Daniel Dumitriu, Stefan Funke, Martin Kutz, Nikola Milosavljevic: How much Geometry it takes to Reconstruct a 2-Manifold in R3. ALENEX 2008: 65-74 |
| c11 | | Daniel Dumitriu, Stefan Funke, Martin Kutz, Nikola Milosavljevic: On the Locality of Extracting a 2-Manifold in . SWAT 2008: 270-281 |
| 2007 | ||
| j4 | | Manuel Bodirsky, Martin Kutz: Determining the consistency of partial tree descriptions. Artif. Intell. 171(2-3): 185-196 (2007) |
| c10 | | Martin Kutz, Pascal Schweitzer: ScrewBox: a Randomized Certifying Graph-Non-Isomorphism Algorithm. ALENEX 2007 |
| 2006 | ||
| c9 | | Rolf Klein, Martin Kutz: The density of iterated crossing points and a gap result for triangulations of finite point sets. Symposium on Computational Geometry 2006: 264-272 |
| c8 | | Martin Kutz: Computing shortest non-trivial cycles on orientable surfaces of bounded genus in almost linear time. Symposium on Computational Geometry 2006: 430-438 |
| c7 | | Gerth Stølting Brodal, Kanela Kaligosi, Irit Katriel, Martin Kutz: Faster Algorithms for Computing Longest Common Increasing Subsequences. CPM 2006: 330-341 |
| c6 | | Rolf Klein, Martin Kutz: Computing Geometric Minimum-Dilation Graphs Is NP-Hard. Graph Drawing 2006: 196-207 |
| i3 | | Rolf Klein, Martin Kutz: The density of iterated crossing points and a gap result for triangulations of finite point sets. CoRR abs/cs/0601033 (2006) |
| 2005 | ||
| j3 | | |
| c5 | | |
| c4 | | Khaled M. Elbassioni, Irit Katriel, Martin Kutz, Meena Mahajan: Simultaneous Matchings. ISAAC 2005: 106-115 |
| i2 | | Martin Kutz: A pair of trees without a simultaneous geometric embedding in the plane. CoRR abs/cs/0510053 (2005) |
| i1 | | Martin Kutz: Computing shortest non-trivial cycles on orientable surfaces of bounded genus in almost linear time. CoRR abs/cs/0512064 (2005) |
| 2004 | ||
| j2 | | Martin Kutz: The complexity of Boolean matrix root computation. Theor. Comput. Sci. 325(3): 373-390 (2004) |
| 2003 | ||
| c3 | | |
| c2 | | Kaspar Fischer, Bernd Gärtner, Martin Kutz: Fast Smallest-Enclosing-Ball Computation in High Dimensions. ESA 2003: 630-641 |
| 2002 | ||
| j1 | | |
| c1 | | |
Colors in the list of coauthors
Last update Sun May 26 02:07:14 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page