 | 2012 |
|---|
| 100 |       | Hee-Kap Ahn,
Sang-Sub Kim,
Christian Knauer,
Lena Schlipf,
Chan-Su Shin,
Antoine Vigneron:
Covering and Piercing Disks with Two Centers
CoRR abs/1201.1198: (2012) |
| 99 | | Panos Giannopoulos,
Christian Knauer,
Magnus Wahlström,
Daniel Werner:
Hardness of discrepancy computation and ε-net verification in high dimension.
J. Complexity 28(2): 162-176 (2012) |
| 98 | | Christian Knauer,
Lena Schlipf,
Jens M. Schmidt,
Hans Raj Tiwary:
Largest inscribed rectangles in convex polygons.
J. Discrete Algorithms 13: 78-85 (2012) |
| 2011 |
|---|
| 97 |  | Darko Dimitrov,
Mathias Holst,
Christian Knauer,
Klaus Kriegel:
Efficient Dynamical Computation of Principal Components.
GRAPP 2011: 85-93 |
| 96 | | Christian Knauer,
Klaus Kriegel,
Fabian Stehn:
Non-uniform Geometric Matchings.
ICCSA (3) 2011: 44-57 |
| 95 | | Hee-Kap Ahn,
Sang-Sub Kim,
Christian Knauer,
Lena Schlipf,
Chan-Su Shin,
Antoine Vigneron:
Covering and Piercing Disks with Two Centers.
ISAAC 2011: 50-59 |
| 94 | | Hee-Kap Ahn,
Sang Won Bae,
Christian Knauer,
Mira Lee,
Chan-Su Shin,
Antoine Vigneron:
Generating Realistic Roofs over a Rectilinear Polygon.
ISAAC 2011: 60-69 |
| 93 | | Christian Knauer,
Hans Raj Tiwary,
Daniel Werner:
On the computational complexity of Ham-Sandwich cuts, Helly sets, and related problems.
STACS 2011: 649-660 |
| 92 | | Esther M. Arkin,
Claudia Dieckmann,
Christian Knauer,
Joseph S. B. Mitchell,
Valentin Polishchuk,
Lena Schlipf,
Shang Yang:
Convex Transversals.
WADS 2011: 49-60 |
| 91 | | Sergio Cabello,
Panos Giannopoulos,
Christian Knauer,
Dániel Marx,
Günter Rote:
Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension.
ACM Transactions on Algorithms 7(4): 43 (2011) |
| 90 | | Panos Giannopoulos,
Christian Knauer,
Magnus Wahlström,
Daniel Werner:
Hardness of discrepancy computation and epsilon-net verification in high dimension
CoRR abs/1103.4503: (2011) |
| 89 | | Helmut Alt,
Sergio Cabello,
Panos Giannopoulos,
Christian Knauer:
Minimum cell connection and separation in line segment arrangements
CoRR abs/1104.4618: (2011) |
| 88 | | Christian Knauer,
Daniel Werner:
Erdős-Szekeres and Testing Weak epsilon-Nets are NP-hard in 3 dimensions - and what now?
CoRR abs/1111.5979: (2011) |
| 87 | | Peter Brass,
Christian Knauer,
Hyeon-Suk Na,
Chan-Su Shin,
Antoine Vigneron:
The Aligned k-Center Problem.
Int. J. Comput. Geometry Appl. 21(2): 157-178 (2011) |
| 86 | | Christian Knauer,
Marc Scherfenberg:
Approximate Nearest Neighbor Search under Translation Invariant Hausdorff Distance.
Int. J. Comput. Geometry Appl. 21(3): 369-381 (2011) |
| 85 | | Christian Knauer,
Andreas Spillner:
A fixed-parameter algorithm for the minimum Manhattan network problem.
JoCG 2(1): 189-204 (2011) |
| 84 | | Noga Alon,
H. Tracy Hall,
Christian Knauer,
Rom Pinchasi,
Raphael Yuster:
On graphs and algebraic graphs that do not contain cycles of length 4.
Journal of Graph Theory 68(2): 91-102 (2011) |
| 83 | | Christian Knauer,
Maarten Löffler,
Marc Scherfenberg,
Thomas Wolle:
The directed Hausdorff distance between imprecise point sets.
Theor. Comput. Sci. 412(32): 4173-4186 (2011) |
| 82 | | Christian Knauer,
Klaus Kriegel,
Fabian Stehn:
Minimizing the weighted directed Hausdorff distance between colored point sets under translations and rigid motions.
Theor. Comput. Sci. 412(4-5): 375-382 (2011) |
| 2010 |
|---|
| 81 | | Siu-Wing Cheng,
Christian Knauer,
Stefan Langerman,
Michiel H. M. Smid:
Approximating the Average Stretch Factor of Geometric Graphs.
ISAAC (1) 2010: 37-48 |
| 80 | | Hee-Kap Ahn,
Christian Knauer,
Marc Scherfenberg,
Lena Schlipf,
Antoine Vigneron:
Computing the Discrete Fréchet Distance with Imprecise Input.
ISAAC (2) 2010: 422-433 |
| 79 | | Christian Knauer:
The Complexity of Geometric Problems in High Dimension.
TAMC 2010: 40-49 |
| 78 | | Mike Fellows,
Panos Giannopoulos,
Christian Knauer,
Christophe Paul,
Frances A. Rosamond,
Sue Whitesides,
Nathan Yu:
Milling a Graph with Turn Costs: A Parameterized Complexity Perspective.
WG 2010: 123-134 |
| 77 | | Hee-Kap Ahn,
Peter Brass,
Christian Knauer,
Hyeon-Suk Na,
Chan-Su Shin:
Covering a simple polygon by monotone directions.
Comput. Geom. 43(5): 514-523 (2010) |
| 76 | | Hee-Kap Ahn,
Mohammad Farshi,
Christian Knauer,
Michiel H. M. Smid,
Yajun Wang:
Dilation-Optimal Edge Deletion in Polygonal Cycles.
Int. J. Comput. Geometry Appl. 20(1): 69-87 (2010) |
| 75 | | 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) |
| 74 | | Eyal Ackerman,
Kevin Buchin,
Christian Knauer,
Günter Rote:
Acyclic Orientation of Drawings.
J. Graph Algorithms Appl. 14(2): 367-384 (2010) |
| 2009 |
|---|
| 73 | | Christian Knauer,
Klaus Kriegel,
Fabian Stehn:
Minimizing the Weighted Directed Hausdorff Distance between Colored Point Sets under Translations and Rigid Motions.
FAW 2009: 108-119 |
| 72 | | Christian Knauer,
Maarten Löffler,
Marc Scherfenberg,
Thomas Wolle:
The Directed Hausdorff Distance between Imprecise Point Sets.
ISAAC 2009: 720-729 |
| 71 | | Panos Giannopoulos,
Christian Knauer,
Günter Rote:
The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension.
IWPEC 2009: 198-209 |
| 70 | | Peter Brass,
Christian Knauer,
Hyeon-Suk Na,
Chan-Su Shin,
Antoine Vigneron:
Computing k-Centers On a Line
CoRR abs/0902.3282: (2009) |
| 69 | | Panos Giannopoulos,
Christian Knauer,
Günter Rote,
Daniel Werner:
The parameterized complexity of some geometric problems in unbounded dimension
CoRR abs/0906.3469: (2009) |
| 68 | | Panos Giannopoulos,
Christian Knauer,
Günter Rote,
Daniel Werner:
Fixed-parameter tractability and lower bounds for stabbing problems
CoRR abs/0906.3896: (2009) |
| 67 | | Christian Knauer,
Maarten Löffler,
Marc Scherfenberg,
Thomas Wolle:
The directed Hausdorff distance between imprecise point sets
CoRR abs/0909.4642: (2009) |
| 66 | | Michael R. Fellows,
Panos Giannopoulos,
Christian Knauer,
Christophe Paul,
Frances A. Rosamond,
Sue Whitesides,
Nathan Yu:
Abstract Milling with Turn Costs
CoRR abs/0912.1050: (2009) |
| 65 | | Darko Dimitrov,
Mathias Holst,
Christian Knauer,
Klaus Kriegel:
Computing Principal Components Dynamically
CoRR abs/0912.5380: (2009) |
| 64 | | Darko Dimitrov,
Christian Knauer,
Klaus Kriegel,
Günter Rote:
Bounds on the quality of the PCA bounding boxes.
Comput. Geom. 42(8): 772-789 (2009) |
| 63 | | Sergio Cabello,
Christian Knauer:
Algorithms for graphs of bounded treewidth via orthogonal range searching.
Comput. Geom. 42(9): 815-824 (2009) |
| 62 | | Rolf Klein,
Christian Knauer,
Giri Narasimhan,
Michiel H. M. Smid:
On the dilation spectrum of paths, cycles, and trees.
Comput. Geom. 42(9): 923-933 (2009) |
| 61 | | Marc Benkert,
Joachim Gudmundsson,
Christian Knauer,
René van Oostrum,
Alexander Wolff:
A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem.
Int. J. Comput. Geometry Appl. 19(3): 267-288 (2009) |
| 60 | | Sergio Cabello,
Mark de Berg,
Panos Giannopoulos,
Christian Knauer,
René van Oostrum,
Remco C. Veltkamp:
Maximizing the Area of Overlap of Two Unions of Disks under Rigid Motion.
Int. J. Comput. Geometry Appl. 19(6): 533-556 (2009) |
| 59 | | Hee-Kap Ahn,
Helmut Alt,
Tetsuo Asano,
Sang Won Bae,
Peter Brass,
Otfried Cheong,
Christian Knauer,
Hyeon-Suk Na,
Chan-Su Shin,
Alexander Wolff:
Constructing Optimal Highways.
Int. J. Found. Comput. Sci. 20(1): 3-23 (2009) |
| 2008 |
|---|
| 58 | | Darko Dimitrov,
Mathias Holst,
Christian Knauer,
Klaus Kriegel:
Experimental Study of Bounding Box Algorithms.
GRAPP 2008: 15-22 |
| 57 | | Christian Knauer,
Marc Scherfenberg:
Approximate Nearest Neighbor Search under Translation Invariant Hausdorff Distance.
ISAAC 2008: 532-543 |
| 56 | | Hee-Kap Ahn,
Peter Brass,
Christian Knauer,
Hyeon-Suk Na,
Chan-Su Shin:
Covering a Simple Polygon by Monotone Directions.
ISAAC 2008: 668-679 |
| 55 | | Sergio Cabello,
Panos Giannopoulos,
Christian Knauer,
Günter Rote:
Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension.
SODA 2008: 836-843 |
| 54 | | Darko Dimitrov,
Christian Knauer,
Klaus Kriegel,
Fabian Stehn:
Approximate Point-to-Surface Registration with a Single Characteristic Point.
VISAPP (1) 2008: 188-195 |
| 53 | | Michael R. Fellows,
Christian Knauer,
Naomi Nishimura,
Prabhakar Ragde,
Frances A. Rosamond,
Ulrike Stege,
Dimitrios M. Thilikos,
Sue Whitesides:
Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems.
Algorithmica 52(2): 167-176 (2008) |
| 52 | | Sergio Cabello,
Panos Giannopoulos,
Christian Knauer,
Günter Rote:
Matching point sets with respect to the Earth Mover's Distance.
Comput. Geom. 39(2): 118-133 (2008) |
| 51 | | Esther Moet,
Christian Knauer,
Marc J. van Kreveld:
Visibility maps of segments and triangles in 3D.
Comput. Geom. 39(3): 163-177 (2008) |
| 50 | | Panos Giannopoulos,
Christian Knauer,
Sue Whitesides:
Parameterized Complexity of Geometric Problems.
Comput. J. 51(3): 372-384 (2008) |
| 49 | | Pankaj K. Agarwal,
Rolf Klein,
Christian Knauer,
Stefan Langerman,
Pat Morin,
Micha Sharir,
Michael A. Soss:
Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D.
Discrete & Computational Geometry 39(1-3): 17-37 (2008) |
| 48 | | Eyal Ackerman,
Kevin Buchin,
Christian Knauer,
Rom Pinchasi,
Günter Rote:
There Are Not Too Many Magic Configurations.
Discrete & Computational Geometry 39(1-3): 3-16 (2008) |
| 47 | | Sergio Cabello,
Panos Giannopoulos,
Christian Knauer:
On the parameterized complexity of d-dimensional point set pattern matching.
Inf. Process. Lett. 105(2): 73-77 (2008) |
| 2007 |
|---|
| 46 | | Hee-Kap Ahn,
Helmut Alt,
Tetsuo Asano,
Sang Won Bae,
Peter Brass,
Otfried Cheong,
Christian Knauer,
Hyeon-Suk Na,
Chan-Su Shin,
Alexander Wolff:
Constructing Optimal Highways.
CATS 2007: 7-14 |
| 45 | | Kevin Buchin,
Maike Buchin,
Erik D. Demaine,
Martin L. Demaine,
Dania El-Khechen,
Sándor P. Fekete,
Christian Knauer,
André Schulz,
Perouz Taslakian:
On Rolling Cube Puzzles.
CCCG 2007: 141-144 |
| 44 | | Trung Nguyen,
Jean-Daniel Boissonnat,
Frédéric Falzon,
Christian Knauer:
A Disk-Covering Problem with Application in Optical Interferometry.
CCCG 2007: 173-176 |
| 43 | | Kevin Buchin,
Christian Knauer,
Klaus Kriegel,
André Schulz,
Raimund Seidel:
On the Number of Cycles in Planar Graphs.
COCOON 2007: 97-107 |
| 42 | | Darko Dimitrov,
Christian Knauer,
Klaus Kriegel,
Fabian Stehn:
Approximation Algorithms for a Point-to-Surface Registration Problem in Medical Navigation.
FAW 2007: 26-37 |
| 41 | | Hee-Kap Ahn,
Mohammad Farshi,
Christian Knauer,
Michiel H. M. Smid,
Yajun Wang:
Dilation-Optimal Edge Deletion in Polygonal Cycles.
ISAAC 2007: 88-99 |
| 40 | | Eyal Ackerman,
Kevin Buchin,
Christian Knauer,
Rom Pinchasi,
Günter Rote:
There are not too many magic configurations.
Symposium on Computational Geometry 2007: 142-149 |
| 39 | | Darko Dimitrov,
Christian Knauer,
Klaus Kriegel,
Günter Rote:
New upper bounds on the quality of the PCA bounding boxes in r2 and r3.
Symposium on Computational Geometry 2007: 275-283 |
| 38 | | Magnús M. Halldórsson,
Christian Knauer,
Andreas Spillner,
Takeshi Tokuyama:
Fixed-Parameter Tractability for Non-Crossing Spanning Trees.
WADS 2007: 410-421 |
| 37 | | Hee-Kap Ahn,
Helmut Alt,
Tetsuo Asano,
Sang Won Bae,
Peter Brass,
Otfried Cheong,
Christian Knauer,
Hyeon-Suk Na,
Chan-Su Shin,
Alexander Wolff:
Constructing Optimal Highways
CoRR abs/cs/0703037: (2007) |
| 36 | | Christian Knauer,
Étienne Schramm,
Andreas Spillner,
Alexander Wolff:
Configurations with few crossings in topological graphs.
Comput. Geom. 37(2): 104-114 (2007) |
| 35 | | Annette Ebbers-Baumann,
Ansgar Grüne,
Rolf Klein,
Marek Karpinski,
Christian Knauer,
Andrzej Lingas:
Embedding Point Sets into Plane Graphs of Small Dilation.
Int. J. Comput. Geometry Appl. 17(3): 201-230 (2007) |
| 2006 |
|---|
| 34 | | Marc Benkert,
Joachim Gudmundsson,
Christian Knauer,
Esther Moet,
René van Oostrum,
Alexander Wolff:
A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem.
COCOON 2006: 166-175 |
| 33 | | Boris Aronov,
Sariel Har-Peled,
Christian Knauer,
Yusu Wang,
Carola Wenk:
Fréchet Distance for Curves, Revisited.
ESA 2006: 52-63 |
| 32 | | Esther Moet,
Christian Knauer,
Marc J. van Kreveld:
Visibility Maps of Segments and Triangles in 3D.
ICCSA (1) 2006: 20-29 |
| 31 | | Sergio Cabello,
Panos Giannopoulos,
Christian Knauer:
On the Parameterized Complexity of d-Dimensional Point Set Pattern Matching.
IWPEC 2006: 175-183 |
| 30 | | Christian Knauer,
Andreas Spillner:
Approximation Algorithms for the Minimum Convex Partition Problem.
SWAT 2006: 232-241 |
| 29 | | Eyal Ackerman,
Kevin Buchin,
Christian Knauer,
Günter Rote:
Acyclic Orientation of Drawings.
SWAT 2006: 268-279 |
| 28 | | Helmut Alt,
Esther M. Arkin,
Hervé Brönnimann,
Jeff Erickson,
Sándor P. Fekete,
Christian Knauer,
Jonathan Lenchner,
Joseph S. B. Mitchell,
Kim Whittlesey:
Minimum-cost coverage of point sets by disks.
Symposium on Computational Geometry 2006: 449-458 |
| 27 | | Darko Dimitrov,
Christian Knauer,
Klaus Kriegel:
Registration of 3D - patterns and shapes with characteristic points.
VISAPP (1) 2006: 393-400 |
| 26 | | Christian Knauer,
Andreas Spillner:
A Fixed-Parameter Algorithm for the Minimum Weight Triangulation Problem Based on Small Graph Separators.
WG 2006: 49-57 |
| 25 | | Esther M. Arkin,
Hervé Brönnimann,
Jeff Erickson,
Sándor P. Fekete,
Christian Knauer,
Jonathan Lenchner,
Joseph S. B. Mitchell,
Kim Whittlesey:
Minimum-Cost Coverage of Point Sets by Disks
CoRR abs/cs/0604008: (2006) |
| 24 | | Trung Nguyen,
Jean-Daniel Boissonnat,
Frédéric Falzon,
Christian Knauer:
A disk-covering problem with application in optical interferometry
CoRR abs/cs/0612026: (2006) |
| 23 | | Kyung-Yong Chwa,
Byung-Cheol Jo,
Christian Knauer,
Esther Moet,
René van Oostrum,
Chan-Su Shin:
Guarding Art Galleries by Guarding Witnesses.
Int. J. Comput. Geometry Appl. 16(2-3): 205-226 (2006) |
| 2005 |
|---|
| 22 | | Sergio Cabello,
Panos Giannopoulos,
Christian Knauer,
Günter Rote:
Matching Point Sets with Respect to the Earth Mover's Distance.
ESA 2005: 520-531 |
| 21 | | Christian Knauer,
Étienne Schramm,
Andreas Spillner,
Alexander Wolff:
Spanning trees with few crossings in geometric and topological graphs.
EuroCG 2005: 195-198 |
| 20 | | Christian Knauer,
Wolfgang Mulzer:
An exclusion region for minimum dilation triangulations.
EuroCG 2005: 33-36 |
| 19 | | Darko Dimitrov,
Christian Knauer,
Klaus Kriegel:
Matching surfaces with characteristic points.
EuroCG 2005: 49-51 |
| 18 | | Sergio Cabello,
Panos Giannopoulos,
Christian Knauer,
Günter Rote:
Matching point sets with respect to the Earth mover's distance.
EuroCG 2005: 57-60 |
| 17 | | Annette Ebbers-Baumann,
Ansgar Grüne,
Marek Karpinski,
Rolf Klein,
Christian Knauer,
Andrzej Lingas:
Embedding Point Sets into Plane Graphs of Small Dilation.
ISAAC 2005: 5-16 |
| 16 | | Christian Knauer,
Étienne Schramm,
Andreas Spillner,
Alexander Wolff:
Configurations with Few Crossings in Topological Graphs.
ISAAC 2005: 604-613 |
| 15 | | Rolf Klein,
Christian Knauer,
Giri Narasimhan,
Michiel H. M. Smid:
Exact and Approximation Algorithms for Computing the Dilation Spectrum of Paths, Trees, and Cycles.
ISAAC 2005: 849-858 |
| 2004 |
|---|
| 14 | | Sven Schönherr,
Robert Günzler,
Frank Hoffmann,
Christian Knauer,
Klaus Kriegel,
Udo Warschewske:
Ein neues algorithmisches Verfahren zur Fluoroskopie-basierten Neuronavigation.
Bildverarbeitung für die Medizin 2004: 229-233 |
| 13 | | Michael R. Fellows,
Christian Knauer,
Naomi Nishimura,
Prabhakar Ragde,
Frances A. Rosamond,
Ulrike Stege,
Dimitrios M. Thilikos,
Sue Whitesides:
Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems.
ESA 2004: 311-322 |
| 12 | | Kyung-Yong Chwa,
Byung-Cheol Jo,
Christian Knauer,
Esther Moet,
René van Oostrum,
Chan-Su Shin:
Guarding Art Galleries by Guarding Witnesses.
ISAAC 2004: 352-363 |
| 11 | | Mark de Berg,
Sergio Cabello,
Panos Giannopoulos,
Christian Knauer,
René van Oostrum,
Remco C. Veltkamp:
Maximizing the Area of Overlap of Two Unions of Disks Under Rigid Motion.
SWAT 2004: 138-149 |
| 10 | | Peter Braß,
Christian Knauer:
Testing congruence and symmetry for general 3-dimensional objects.
Comput. Geom. 27(1): 3-11 (2004) |
| 2003 |
|---|
| 9 | | Helmut Alt,
Christian Knauer,
Günter Rote,
Sue Whitesides:
The complexity of (un)folding.
Symposium on Computational Geometry 2003: 164-170 |
| 8 | | Alon Efrat,
Frank Hoffmann,
Christian Knauer,
Klaus Kriegel,
Günter Rote,
Carola Wenk:
Covering with Ellipses.
Algorithmica 38(1): 145-160 (2003) |
| 7 | | Helmut Alt,
Christian Knauer,
Carola Wenk:
Comparison of Distance Measures for Planar Curves.
Algorithmica 38(1): 45-58 (2003) |
| 6 | | Peter Braß,
Christian Knauer:
On counting point-hyperplane incidences.
Comput. Geom. 25(1-2): 13-20 (2003) |
| 2002 |
|---|
| 5 | | Alon Efrat,
Frank Hoffmann,
Christian Knauer,
Klaus Kriegel,
Günter Rote,
Carola Wenk:
Covering shapes by ellipses.
SODA 2002: 453-454 |
| 4 | | Peter Braß,
Christian Knauer:
Testing the Congruence of d-Dimensional Point Sets.
Int. J. Comput. Geometry Appl. 12(1-2): 115-124 (2002) |
| 2001 |
|---|
| 3 | | Helmut Alt,
Christian Knauer,
Carola Wenk:
Matching Polygonal Curves with Respect to the Fréchet Distance.
STACS 2001: 63-74 |
| 2000 |
|---|
| 2 | | Peter Braß,
Christian Knauer:
Testing the Congruence of d-Dimensional Point Sets.
EuroCG 2000: 104-107 |
| 1 | | Peter Braß,
Christian Knauer:
Testing the congruence of d-dimensional point sets.
Symposium on Computational Geometry 2000: 310-314 |
Data released under the ODC-BY 1.0 license — See also our legal information page