Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Kutz, Martin"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the locality of extracting a 2-manifold in
\mathbb{R}^3
Daniel Dumitriu
,
Stefan Funke
,
Martin Kutz
,
Nikola Milosavljević
Lecture Notes in Computer Science
5124
, 2008, pp. 270-281
Simultaneous matchings: Hardness and approximation
Martin Kutz
,
Khaled Elbassioni
,
Irit Katriel
,
Meena Mahajan
Journal of Computer and System Sciences
74
(5), 2008, pp. 884-897
Computing geometric minimum-dilation graphs is
NP
-hard
Rolf Klein
,
Martin Kutz
Lecture Notes in Computer Science
4372
, 2007, pp. 196-207
Faster algorithms for computing longest common increasing subsequences
Gerth Stlting Brodal
,
Kanela Kaligosi
,
Irit Katriel
,
Martin Kutz
Lecture Notes in Computer Science
4009
, 2006, pp. 330-341
Simultaneous matchings
Khaled Elbassioni
,
Irit Katriel
,
Martin Kutz
,
Meena Mahajan
Lecture Notes in Computer Science
3827
, 2005, pp. 106-115
Angel, devil, and king
Martin Kutz
,
Attila Pór
Lecture Notes in Computer Science
3595
, 2005, pp. 925-934
Conway's angel in three dimensions
Martin Kutz
Theoretical Computer Science
349
(3), 2005, pp. 443-451
The complexity of Boolean matrix root computation
Martin Kutz
Theoretical Computer Science
325
(3), 2004, pp. 373-390
Fast smallest-enclosing-ball computation in high dimensions
Kaspar Fischer
,
Bernd Gärtner
,
Martin Kutz
Lecture Notes in Computer Science
2832
, 2003, pp. 630-641
The complexity of Boolean matrix root computation
Martin Kutz
Lecture Notes in Computer Science
2697
, 2003, pp. 212-221
Pure dominance constraints
Manuel Bodirsky
,
Martin Kutz
Lecture Notes in Computer Science
2285
, 2002, pp. 287-298
Lower bounds for Lucas chains
Martin Kutz
SIAM Journal on Computing
31
(6), 2002, pp. 1896-1908