Martin Kutz

2008
20	EE	Daniel Dumitriu, Stefan Funke, Martin Kutz, Nikola Milosavljevic: How much Geometry it takes to Reconstruct a 2-Manifold in R3. ALENEX 2008: 65-74
19	EE	Daniel Dumitriu, Stefan Funke, Martin Kutz, Nikola Milosavljevic: On the Locality of Extracting a 2-Manifold in . SWAT 2008: 270-281
18	EE	Martin Kutz, Khaled M. Elbassioni, Irit Katriel, Meena Mahajan: Simultaneous matchings: Hardness and approximation. J. Comput. Syst. Sci. 74(5): 884-897 (2008)
2007
17	EE	Martin Kutz, Pascal Schweitzer: ScrewBox: a Randomized Certifying Graph-Non-Isomorphism Algorithm. ALENEX 2007
16	EE	Manuel Bodirsky, Martin Kutz: Determining the consistency of partial tree descriptions. Artif. Intell. 171(2-3): 185-196 (2007)
2006
15	EE	Gerth Stølting Brodal, Kanela Kaligosi, Irit Katriel, Martin Kutz: Faster Algorithms for Computing Longest Common Increasing Subsequences. CPM 2006: 330-341
14	EE	Rolf Klein, Martin Kutz: Computing Geometric Minimum-Dilation Graphs Is NP-Hard. Graph Drawing 2006: 196-207
13	EE	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
12	EE	Martin Kutz: Computing shortest non-trivial cycles on orientable surfaces of bounded genus in almost linear time. Symposium on Computational Geometry 2006: 430-438
11	EE	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
10	EE	Martin Kutz, Attila Pór: Angel, Devil, and King. COCOON 2005: 925-934
9	EE	Khaled M. Elbassioni, Irit Katriel, Martin Kutz, Meena Mahajan: Simultaneous Matchings. ISAAC 2005: 106-115
8	EE	Martin Kutz: A pair of trees without a simultaneous geometric embedding in the plane CoRR abs/cs/0510053: (2005)
7	EE	Martin Kutz: Computing shortest non-trivial cycles on orientable surfaces of bounded genus in almost linear time CoRR abs/cs/0512064: (2005)
6	EE	Martin Kutz: Conway's Angel in three dimensions. Theor. Comput. Sci. 349(3): 443-451 (2005)
2004
5	EE	Martin Kutz: The complexity of Boolean matrix root computation. Theor. Comput. Sci. 325(3): 373-390 (2004)
2003
4	EE	Martin Kutz: The Complexity of Boolean Matrix Root Computation. COCOON 2003: 212-221
3	EE	Kaspar Fischer, Bernd Gärtner, Martin Kutz: Fast Smallest-Enclosing-Ball Computation in High Dimensions. ESA 2003: 630-641
2002
2	EE	Manuel Bodirsky, Martin Kutz: Pure Dominance Constraints. STACS 2002: 287-298
1	EE	Martin Kutz: Lower Bounds for Lucas Chains. SIAM J. Comput. 31(6): 1896-1908 (2002)

Coauthor Index

1	Manuel Bodirsky	[2] [16]
2	Gerth Stølting Brodal	[15]
3	Daniel Dumitriu	[19] [20]
4	Khaled M. Elbassioni	[9] [18]
5	Kaspar Fischer	[3]
6	Stefan Funke	[19] [20]
7	Bernd Gärtner	[3]
8	Kanela Kaligosi	[15]
9	Irit Katriel	[9] [15] [18]
10	Rolf Klein	[11] [13] [14]
11	Meena Mahajan	[9] [18]
12	Nikola Milosavljevic	[19] [20]
13	Attila Pór	[10]
14	Pascal Schweitzer	[17]

Colors in the list of coauthors