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
[1]
Hilfe
Suche: Author="Knauer, Christian"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the computational complexity of Erdŏs-Szekeres and related problems in
\mathbb R^3
Panos Giannopoulos
,
Christian Knauer
,
Daniel Werner
Lecture Notes in Computer Science
8125
, 2013, pp. 541-552
Hardness of discrepancy computation and
\epsilon
-net verification in high dimension
Panos Giannopoulos
,
Christian Knauer
,
Magnus Wahlström
,
Daniel Werner
Journal of Complexity
28
(2), 2012, pp. 162-176
Generating realistic roofs over a rectilinear polygon
Hee-Kap Ahn
,
Sang Won Bae
,
Christian Knauer
,
Mira Lee
,
Chan-Su Shin
,
Antoine Vigneron
Lecture Notes in Computer Science
7074
, 2011, pp. 60-69
Covering and piercing disks with two centers
Hee-Kap Ahn
,
Sang-Sub Kim
,
Christian Knauer
,
Lena Schlipf
,
Chan-Su Shin
,
Antoine Vigneron
Lecture Notes in Computer Science
7074
, 2011, pp. 50-59
On graphs and algebraic graphs that do not contain cycles of length 4
Noga Alon
,
H. Tracy Hall
,
Christian Knauer
,
Rom Pinchasi
,
Raphael Yuster
Journal of Graph Theory
68
(2), 2011, pp. 91-102
Convex transversals
Esther M. Arkin
,
Claudia Dieckmann
,
Christian Knauer
,
Joseph S.B. Mitchell
,
Valentin Polishchuk
,
Schlipf
,
Lena
,
Shang Yang
Lecture Notes in Computer Science
6844
, 2011, pp. 49-60
The directed Hausdorff distance between imprecise point sets
Christian Knauer
,
Maarten Löffler
,
Marc Scherfenberg
,
Thomas Wolle
Theoretical Computer Science
412
(32), 2011, pp. 4173-4186
On the computational complexity of ham-sandwich cuts, Helly sets, and related problems
Christian Knauer
,
Hans Raj Tiwary
,
Daniel Werner
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 649-660
Computing the discrete Fréchet distance with imprecise input
Hee-Kap Ahn
,
Christian Knauer
,
Marc Scherfenberg
,
Lena Schlipf
,
Antoine Vigneron
Lecture Notes in Computer Science
6507
, 2010, pp. 422-433
Approximating the average stretch factor of geometric graphs
Siu-Wing Cheng
,
Christian Knauer
,
Stefan Langerman
,
Michiel Smid
Lecture Notes in Computer Science
6506
, 2010, pp. 37-48
Milling a graph with turn costs: A parameterized complexity perspective
Mike Fellows
,
Panos Giannopoulos
,
Christian Knauer
,
Christophe Paul
,
Frances Rosamond
,
et al.
Lecture Notes in Computer Science
6410
, 2010, pp. 123-134
Constructing optimal highways
Hee-Kap Ahn
,
Helmut Alt
,
Tetsuo Asano
,
Sang Won Bae
,
Peter Brass
,
Otfried Cheong
,
Christian Knauer
,
Hyeon-Suk Na
,
Chan-Su Shin
,
Alexander Wolff
International Journal of Foundations of Computer Science
20
(1), 2009, pp. 3-23
The directed Hausdorff distance between imprecise point sets
Christian Knauer
,
Maarten Löffler
,
Marc Scherfenberg
,
Thomas Wolle
Lecture Notes in Computer Science
5878
, 2009, pp. 720-729
Covering a simple polygon by monotone directions
Hee-Kap Ahn
,
Peter Brass
,
Christian Knauer
,
Hyeon-Suk Na
,
Chan-Su Shin
Lecture Notes in Computer Science
5369
, 2008, pp. 668-679
Approximate nearest neighbor search under translation invariant Hausdorff distance
Christian Knauer
,
Marc Scherfenberg
Lecture Notes in Computer Science
5369
, 2008, pp. 532-543
Dilation-optimal edge deletion in polygonal cycles
Hee-Kap Ahn
,
Mohammad Farshi
,
Christian Knauer
,
Michiel Smid
,
Yajun Wang
Lecture Notes in Computer Science
4835
, 2007, pp. 88-99
On the number of cycles in planar graphs
Kevin Buchin
,
Christian Knauer
,
Klaus Kriegel
,
André Schulz
,
Raimund Seidel
Lecture Notes in Computer Science
4598
, 2007, pp. 97-107
On the parameterized complexity of
d
-dimensional point set pattern matching
Sergio Cabello
,
Panos Giannopoulos
,
Christian Knauer
Information Processing Letters
105
(2), 2007, pp. 73-77
Fixed-parameter tractability for non-crossing spanning trees
Magnús M. Halldórsson
,
Christian Knauer
,
Andreas Spillner
,
Takeshi Tokuyama
Lecture Notes in Computer Science
4619
, 2007, pp. 410-421
Acyclic orientation of drawings
Eyal Ackerman
,
Kevin Buchin
,
Christian Knauer
,
Günter Rote
Lecture Notes in Computer Science
4059
, 2006, pp. 268-279
Fréchet distance for curves, revisited
Boris Aronov
,
Sariel Har-Peled
,
Christian Knauer
,
Yusu Wang
,
Carola Wenk
Lecture Notes in Computer Science
4168
, 2006, pp. 52-63
A polynomial-time approximation algorithm for a geometric dispersion problem
Marc Benkert
,
Joachim Gudmundsson
,
Christian Knauer
,
Esther Moet
,
René van Oostrum
,
Alexander Wolff
Lecture Notes in Computer Science
4112
, 2006, pp. 166-175
Approximation algorithms for the minimum convex partition problem
Christian Knauer
,
Andreas Spillner
Lecture Notes in Computer Science
4059
, 2006, pp. 232-241
A fixed-parameter algorithm for the minimum weight triangulation problem based on small graph separators
Christian Knauer
,
Andreas Spillner
Lecture Notes in Computer Science
4271
, 2006, pp. 49-57
Matching point sets with respect to the Earth Mover's Distance
Sergio Cabello
,
Panos Giannopoulos
,
Christian Knauer
,
Günter Rote
Lecture Notes in Computer Science
3669
, 2005, pp. 520-531
Seiten 1
2
>