Martin Kutz - RankMe

25 papers A 5B 2Misc 2Journal 12Unranked 4

Year	Rank	Type	Title / Venue / Authors
2015	J	`jnl`	Most Finite Point Sets in the Plane have Dilation > 1. Discret. Comput. Geom. Rolf Klein, Martin Kutz, Rainer Penninger
2015	J	`jnl`	Recurrence quantification analysis across sleep stages. Biomed. Signal Process. Control. Jerome Rolink, Martin Kutz, Pedro Fonseca, Xi Long, Berno J. E. Misgeld, Steffen Leonhardt
2012	—	`conf`	iIgMV - interactive Interface for generative Music and Visualizations. MuC (Workshopband) Damian T. Dziwis, Felix Hofschulte, Michael Kutz, Martin Kutz
2011	J	`jnl`	Faster algorithms for computing longest common increasing subsequences. J. Discrete Algorithms Martin Kutz, Gerth Stølting Brodal, Kanela Kaligosi, Irit Katriel
2010	J	`jnl`	Computing Geometric Minimum-Dilation Graphs is NP-Hard. Int. J. Comput. Geom. Appl. Panos Giannopoulos, Rolf Klein, Christian Knauer, Martin Kutz, Dániel Marx
2009	J	`jnl`	How much geometry it takes to reconstruct a 2-manifold in R ACM J. Exp. Algorithmics Daniel Dumitriu, Stefan Funke, Martin Kutz, Nikola Milosavljevic
2008	A	`conf`	How much Geometry it takes to Reconstruct a 2-Manifold in R3. ALENEX Daniel Dumitriu, Stefan Funke, Martin Kutz, Nikola Milosavljevic
2008	—	`conf`	On the Locality of Extracting a 2-Manifold in . SWAT Daniel Dumitriu, Stefan Funke, Martin Kutz, Nikola Milosavljevic
2008	J	`jnl`	Simultaneous matchings: Hardness and approximation. J. Comput. Syst. Sci. Martin Kutz, Khaled M. Elbassioni, Irit Katriel, Meena Mahajan
2007	J	`jnl`	Determining the consistency of partial tree descriptions. Artif. Intell. Manuel Bodirsky, Martin Kutz
2007	A	`conf`	ScrewBox: a Randomized Certifying Graph-Non-Isomorphism Algorithm. ALENEX Martin Kutz, Pascal Schweitzer
2006	A	`conf`	Computing Geometric Minimum-Dilation Graphs Is NP-Hard. GD Rolf Klein, Martin Kutz
2006	—	`conf`	Computing shortest non-trivial cycles on orientable surfaces of bounded genus in almost linear time. SCG Martin Kutz
2006	B	`conf`	Faster Algorithms for Computing Longest Common Increasing Subsequences. CPM Gerth Stølting Brodal, Kanela Kaligosi, Irit Katriel, Martin Kutz
2006	J	`jnl`	The density of iterated crossing points and a gap result for triangulations of finite point sets CoRR Rolf Klein, Martin Kutz
2006	—	`conf`	The density of iterated crossing points and a gap result for triangulations of finite point sets. SCG Rolf Klein, Martin Kutz
2005	Misc	`conf`	Angel, Devil, and King. COCOON Martin Kutz, Attila Pór
2005	J	`jnl`	Computing shortest non-trivial cycles on orientable surfaces of bounded genus in almost linear time CoRR Martin Kutz
2005	J	`jnl`	Conway's Angel in three dimensions. Theor. Comput. Sci. Martin Kutz
2005	B	`conf`	Simultaneous Matchings. ISAAC Khaled M. Elbassioni, Irit Katriel, Martin Kutz, Meena Mahajan
2004	J	`jnl`	The complexity of Boolean matrix root computation. Theor. Comput. Sci. Martin Kutz
2003	A	`conf`	Fast Smallest-Enclosing-Ball Computation in High Dimensions. ESA Kaspar Fischer, Bernd Gärtner, Martin Kutz
2003	Misc	`conf`	The Complexity of Boolean Matrix Root Computation. COCOON Martin Kutz
2002	J	`jnl`	Lower Bounds for Lucas Chains. SIAM J. Comput. Martin Kutz
2002	A	`conf`	Pure Dominance Constraints. STACS Manuel Bodirsky, Martin Kutz