Matching Polygonal Curves with Respect to the Fréchet Distance. - Helmut Alt; Christian Knauer; Carola Wenk (STACS, 2001)

Covering shapes by ellipses. - Alon Efrat; Frank Hoffmann 002; Christian Knauer; Klaus Kriegel; Günter Rote; Carola Wenk (SODA, 2002)

Testing the Congruence of d-Dimensional Point Sets. - Peter Braß; Christian Knauer (Int. J. Comput. Geom. Appl., 2002)

The complexity of (un)folding. - Helmut Alt; Christian Knauer; Günter Rote; Sue Whitesides (SCG, 2003)

On counting point-hyperplane incidences. - Peter Braß; Christian Knauer (Comput. Geom., 2003)

Ein neues algorithmisches Verfahren zur Fluoroskopie-basierten Neuronavigation. - Sven Schönherr; Robert Günzler; Frank Hoffmann 002; Christian Knauer; Klaus Kriegel; Udo Warschewske (Bildverarbeitung für die Medizin, 2004)

Comparison of Distance Measures for Planar Curves. - Helmut Alt; Christian Knauer; Carola Wenk (Algorithmica, 2004)

Covering with Ellipses. - Alon Efrat; Frank Hoffmann 002; Christian Knauer; Klaus Kriegel; Günter Rote; Carola Wenk (Algorithmica, 2004)

Testing congruence and symmetry for general 3-dimensional objects. - Peter Braß; Christian Knauer (Comput. Geom., 2004)

Matching surfaces with characteristic points. - Darko Dimitrov; Christian Knauer; Klaus Kriegel (EuroCG, 2005)

An exclusion region for minimum dilation triangulations. - Christian Knauer; Wolfgang Mulzer (EuroCG, 2005)

Spanning trees with few crossings in geometric and topological graphs. - Christian Knauer; Étienne Schramm; Andreas Spillner 001; Alexander Wolff 001 (EuroCG, 2005)

Exact and Approximation Algorithms for Computing the Dilation Spectrum of Paths, Trees, and Cycles. - Rolf Klein; Christian Knauer; Giri Narasimhan; Michiel H. M. Smid (ISAAC, 2005)

A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem. - Marc Benkert; Joachim Gudmundsson; Christian Knauer; Esther Moet; René van Oostrum; Alexander Wolff 001 (COCOON, 2006)

Minimum-cost coverage of point sets by disks. - Helmut Alt; Esther M. Arkin; Hervé Brönnimann; Jeff Erickson 001; Sándor P. Fekete; Christian Knauer; Jonathan Lenchner; Joseph S. B. Mitchell; Kim Whittlesey (SCG, 2006)

Fréchet Distance for Curves, Revisited. - Boris Aronov; Sariel Har-Peled; Christian Knauer; Yusu Wang 001; Carola Wenk (ESA, 2006)

On the Parameterized Complexity of d-Dimensional Point Set Pattern Matching. - Sergio Cabello; Panos Giannopoulos; Christian Knauer (IWPEC, 2006)

Approximation Algorithms for the Minimum Convex Partition Problem. - Christian Knauer; Andreas Spillner 001 (SWAT, 2006)

Registration of 3D - patterns and shapes with characteristic points. - Darko Dimitrov; Christian Knauer; Klaus Kriegel (VISAPP (1), 2006)

A Fixed-Parameter Algorithm for the Minimum Weight Triangulation Problem Based on Small Graph Separators. - Christian Knauer; Andreas Spillner 001 (WG, 2006)

Minimum-Cost Coverage of Point Sets by Disks - Esther M. Arkin; Hervé Brönnimann; Jeff Erickson 001; Sándor P. Fekete; Christian Knauer; Jonathan Lenchner; Joseph S. B. Mitchell; Kim Whittlesey (CoRR, 2006)

Guarding Art Galleries by Guarding Witnesses. - Kyung-Yong Chwa; Byung-Cheol Jo; Christian Knauer; Esther Moet; René van Oostrum; Chan-Su Shin (Int. J. Comput. Geom. Appl., 2006)

On Rolling Cube Puzzles. - Kevin Buchin; Maike Buchin; Erik D. Demaine; Martin L. Demaine; Dania El-Khechen; Sándor P. Fekete; Christian Knauer; André Schulz 001; Perouz Taslakian (CCCG, 2007)

A Disk-Covering Problem with Application in Optical Interferometry. - Trung Nguyen; Jean-Daniel Boissonnat; Frédéric Falzon; Christian Knauer (CCCG, 2007)

On the Number of Cycles in Planar Graphs. - Kevin Buchin; Christian Knauer; Klaus Kriegel; André Schulz 001; Raimund Seidel (COCOON, 2007)

New upper bounds on the quality of the PCA bounding boxes in r2 and r3. - Darko Dimitrov; Christian Knauer; Klaus Kriegel; Günter Rote (SCG, 2007)

Approximation Algorithms for a Point-to-Surface Registration Problem in Medical Navigation. - Darko Dimitrov; Christian Knauer; Klaus Kriegel; Fabian Stehn (FAW, 2007)

Fixed-Parameter Tractability for Non-Crossing Spanning Trees. - Magnús M. Halldórsson; Christian Knauer; Andreas Spillner 001; Takeshi Tokuyama (WADS, 2007)

Configurations with few crossings in topological graphs. - Christian Knauer; Étienne Schramm; Andreas Spillner 001; Alexander Wolff 001 (Comput. Geom., 2007)

Embedding Point Sets into Plane Graphs of Small Dilation. - Annette Ebbers-Baumann; Ansgar Grüne; Rolf Klein; Marek Karpinski; Christian Knauer; Andrzej Lingas (Int. J. Comput. Geom. Appl., 2007)

Dilation and Detours in Geometric Networks. - Joachim Gudmundsson; Christian Knauer (Handbook of Approximation Algorithms and Metaheuristics, 2007)

Experimental Study of Bounding Box Algorithms. - Darko Dimitrov; Mathias Holst; Christian Knauer; Klaus Kriegel (GRAPP, 2008)

Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension. - Sergio Cabello; Panos Giannopoulos; Christian Knauer; Günter Rote (SODA, 2008)

Closed-Form Solutions for Continuous PCA and Bounding Box Algorithms. - Darko Dimitrov; Mathias Holst; Christian Knauer; Klaus Kriegel (VISIGRAPP (Selected Papers), 2008)

Approximate Point-to-Surface Registration with a Single Characteristic Point. - Darko Dimitrov; Christian Knauer; Klaus Kriegel; Fabian Stehn (VISAPP (1), 2008)

Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. - Michael R. Fellows; Christian Knauer; Naomi Nishimura; Prabhakar Ragde; Frances A. Rosamond; Ulrike Stege; Dimitrios M. Thilikos; Sue Whitesides (Algorithmica, 2008)

Parameterized Complexity of Geometric Problems. - Panos Giannopoulos; Christian Knauer; Sue Whitesides (Comput. J., 2008)

Matching point sets with respect to the Earth Mover's Distance. - Sergio Cabello; Panos Giannopoulos; Christian Knauer; Günter Rote (Comput. Geom., 2008)

Visibility maps of segments and triangles in 3D. - Esther Moet; Christian Knauer; Marc J. van Kreveld (Comput. Geom., 2008)

There Are Not Too Many Magic Configurations. - Eyal Ackerman; Kevin Buchin; Christian Knauer; Rom Pinchasi; Günter Rote (Discret. Comput. Geom., 2008)

Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D. - Pankaj K. Agarwal; Rolf Klein; Christian Knauer; Stefan Langerman; Pat Morin; Micha Sharir; Michael A. Soss (Discret. Comput. Geom., 2008)

On the parameterized complexity of d-dimensional point set pattern matching. - Sergio Cabello; Panos Giannopoulos; Christian Knauer (Inf. Process. Lett., 2008)

09451 Abstracts Collection - Geometric Networks, Metric Space Embeddings and Spatial Data Mining. - Gautam Das 001; Joachim Gudmundsson; Rolf Klein; Christian Knauer; Michiel H. M. Smid (Geometric Networks, Metric Space Embeddings and Spatial Data Mining, 2009)

The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension. - Panos Giannopoulos; Christian Knauer; Günter Rote (IWPEC, 2009)

Algorithms for graphs of bounded treewidth via orthogonal range searching. - Sergio Cabello; Christian Knauer (Comput. Geom., 2009)

Bounds on the quality of the PCA bounding boxes. - Darko Dimitrov; Christian Knauer; Klaus Kriegel; Günter Rote (Comput. Geom., 2009)

On the dilation spectrum of paths, cycles, and trees. - Rolf Klein; Christian Knauer; Giri Narasimhan; Michiel H. M. Smid (Comput. Geom., 2009)

Computing k-Centers On a Line - Peter Brass; Christian Knauer; Hyeon-Suk Na; Chan-Su Shin; Antoine Vigneron (CoRR, 2009)

The parameterized complexity of some geometric problems in unbounded dimension - Panos Giannopoulos; Christian Knauer; Günter Rote; Daniel Werner (CoRR, 2009)

Abstract Milling with Turn Costs - Michael R. Fellows; Panos Giannopoulos; Christian Knauer; Christophe Paul; Frances A. Rosamond; Sue Whitesides; Nathan Yu (CoRR, 2009)

Computing Principal Components Dynamically - Darko Dimitrov; Mathias Holst; Christian Knauer; Klaus Kriegel (CoRR, 2009)

A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem. - Marc Benkert; Joachim Gudmundsson; Christian Knauer; René van Oostrum; Alexander Wolff 001 (Int. J. Comput. Geom. Appl., 2009)

Maximizing the Area of Overlap of Two Unions of Disks under Rigid Motion. - Sergio Cabello; Mark de Berg; Panos Giannopoulos; Christian Knauer; René van Oostrum; Remco C. Veltkamp (Int. J. Comput. Geom. Appl., 2009)

Constructing Optimal Highways. - Hee-Kap Ahn; Helmut Alt; Tetsuo Asano; Sang Won Bae 001; Peter Brass; Otfried Cheong; Christian Knauer; Hyeon-Suk Na; Chan-Su Shin; Alexander Wolff 001 (Int. J. Found. Comput. Sci., 2009)

The Complexity of Geometric Problems in High Dimension. - Christian Knauer (TAMC, 2010)

Milling a Graph with Turn Costs: A Parameterized Complexity Perspective. - Mike Fellows; Panos Giannopoulos; Christian Knauer; Christophe Paul; Frances A. Rosamond; Sue Whitesides; Nathan Yu (WG, 2010)

Covering a simple polygon by monotone directions. - Hee-Kap Ahn; Peter Brass; Christian Knauer; Hyeon-Suk Na; Chan-Su Shin (Comput. Geom., 2010)

Dilation-Optimal Edge Deletion in Polygonal Cycles. - Hee-Kap Ahn; Mohammad Farshi; Christian Knauer; Michiel H. M. Smid; Yajun Wang (Int. J. Comput. Geom. Appl., 2010)

Computing Geometric Minimum-Dilation Graphs is NP-Hard. - Panos Giannopoulos; Rolf Klein; Christian Knauer; Martin Kutz; Dániel Marx (Int. J. Comput. Geom. Appl., 2010)

Acyclic Orientation of Drawings. - Eyal Ackerman; Kevin Buchin; Christian Knauer; Günter Rote (J. Graph Algorithms Appl., 2010)

Efficient Dynamical Computation of Principal Components. - Darko Dimitrov; Mathias Holst; Christian Knauer; Klaus Kriegel (GRAPP, 2011)

Non-uniform Geometric Matchings. - Christian Knauer; Klaus Kriegel; Fabian Stehn (ICCSA (3), 2011)

Generating Realistic Roofs over a Rectilinear Polygon. - Hee-Kap Ahn; Sang Won Bae 001; Christian Knauer; Mira Lee; Chan-Su Shin; Antoine Vigneron (ISAAC, 2011)

On the computational complexity of Ham-Sandwich cuts, Helly sets, and related problems. - Christian Knauer; Hans Raj Tiwary; Daniel Werner (STACS, 2011)

Hardness of discrepancy computation and epsilon-net verification in high dimension - Panos Giannopoulos; Christian Knauer; Magnus Wahlström; Daniel Werner (CoRR, 2011)

Minimum cell connection and separation in line segment arrangements - Helmut Alt; Sergio Cabello; Panos Giannopoulos; Christian Knauer (CoRR, 2011)

Erdős-Szekeres and Testing Weak epsilon-Nets are NP-hard in 3 dimensions - and what now? - Christian Knauer; Daniel Werner (CoRR, 2011)

The Aligned k-Center Problem. - Peter Brass; Christian Knauer; Hyeon-Suk Na; Chan-Su Shin; Antoine Vigneron (Int. J. Comput. Geom. Appl., 2011)

Approximate Nearest Neighbor Search under Translation Invariant Hausdorff Distance. - Christian Knauer; Marc Scherfenberg (Int. J. Comput. Geom. Appl., 2011)

On graphs and algebraic graphs that do not contain cycles of length 4. - Noga Alon; H. Tracy Hall; Christian Knauer; Rom Pinchasi; Raphael Yuster (J. Graph Theory, 2011)

A fixed-parameter algorithm for the minimum Manhattan network problem. - Christian Knauer; Andreas Spillner 001 (J. Comput. Geom., 2011)

Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension. - Sergio Cabello; Panos Giannopoulos; Christian Knauer; Dániel Marx; Günter Rote (ACM Trans. Algorithms, 2011)

Minimizing the weighted directed Hausdorff distance between colored point sets under translations and rigid motions. - Christian Knauer; Klaus Kriegel; Fabian Stehn (Theor. Comput. Sci., 2011)

The directed Hausdorff distance between imprecise point sets. - Christian Knauer; Maarten Löffler; Marc Scherfenberg; Thomas Wolle (Theor. Comput. Sci., 2011)

Computing the Discrete FRéChet Distance with Imprecise Input. - Hee-Kap Ahn; Christian Knauer; Marc Scherfenberg; Lena Schlipf; Antoine Vigneron (Int. J. Comput. Geom. Appl., 2012)

Hardness of discrepancy computation and ε-net verification in high dimension. - Panos Giannopoulos; Christian Knauer; Magnus Wahlström; Daniel Werner (J. Complex., 2012)

Largest inscribed rectangles in convex polygons. - Christian Knauer; Lena Schlipf; Jens M. Schmidt; Hans Raj Tiwary (J. Discrete Algorithms, 2012)

Approximating the average stretch factor of geometric graphs. - Siu-Wing Cheng; Christian Knauer; Stefan Langerman; Michiel H. M. Smid (J. Comput. Geom., 2012)

Range-Aggregate Queries for Geometric Extent Problems. - Peter Brass; Christian Knauer; Chan-Su Shin; Michiel H. M. Smid; Ivo Vigan (CATS, 2013)

On the Computational Complexity of Erdős-Szekeres and Related Problems in ℝ3. - Panos Giannopoulos; Christian Knauer; Daniel Werner (ESA, 2013)

Realistic roofs over a rectilinear polygon. - Hee-Kap Ahn; Sang Won Bae 001; Christian Knauer; Mira Lee; Chan-Su Shin; Antoine Vigneron (Comput. Geom., 2013)

Covering and piercing disks with two centers. - Hee-Kap Ahn; Sang-Sub Kim 001; Christian Knauer; Lena Schlipf; Chan-Su Shin; Antoine Vigneron (Comput. Geom., 2013)

Fixed-parameter tractability and lower bounds for stabbing problems. - Panos Giannopoulos; Christian Knauer; Günter Rote; Daniel Werner (Comput. Geom., 2013)

Finding a largest empty convex subset in space is W[1]-hard - Panos Giannopoulos; Christian Knauer (CoRR, 2013)

Convex transversals. - Esther M. Arkin; Claudia Dieckmann; Christian Knauer; Joseph S. B. Mitchell; Valentin Polishchuk; Lena Schlipf; Shang Yang (Comput. Geom., 2014)

Fast Algorithms for Diameter-Optimally Augmenting Paths. - Ulrike Große; Joachim Gudmundsson; Christian Knauer; Michiel H. M. Smid; Fabian Stehn (ICALP (1), 2015)

Elastic Geometric Shape Matching for Point Sets under Translations. - Christian Knauer; Fabian Stehn (WADS, 2015)

Fixed-Parameter Complexity and Approximability of Norm Maximization. - Christian Knauer; Stefan König 003; Daniel Werner (Discret. Comput. Geom., 2015)

Finding largest rectangles in convex polygons. - Sergio Cabello; Otfried Cheong; Christian Knauer; Lena Schlipf (Comput. Geom., 2016)

Guest Editors' Foreword. - Christian Knauer; Michiel H. M. Smid (Int. J. Comput. Geom. Appl., 2016)

Shortest path to a segment and quickest visibility queries. - Valentin Polishchuk; Esther M. Arkin; Alon Efrat; Christian Knauer; Joseph S. B. Mitchell; Günter Rote; Lena Schlipf; Topi Talvitie (J. Comput. Geom., 2016)

Minimum Cell Connection in Line Segment Arrangements. - Helmut Alt; Sergio Cabello; Panos Giannopoulos; Christian Knauer (Int. J. Comput. Geom. Appl., 2017)

Top-k Manhattan spatial skyline queries. - Wanbin Son; Fabian Stehn; Christian Knauer; Hee-Kap Ahn (Inf. Process. Lett., 2017)

Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons. - Helmut Alt; Mark de Berg; Christian Knauer (J. Comput. Geom., 2017)

Dilation and Detours in Geometric Networks. - Joachim Gudmundsson; Christian Knauer (Handbook of Approximation Algorithms and Metaheuristics (2), 2018)

An FPTAS for an Elastic Shape Matching Problem with Cyclic Neighborhoods. - Christian Knauer; Luise Sommer; Fabian Stehn (ICCSA (2), 2018)

Elastic geometric shape matching for translations under the Manhattan norm. - Christian Knauer; Luise Sommer; Fabian Stehn (Comput. Geom., 2018)

Placing your coins on a shelf. - Helmut Alt; Kevin Buchin; Steven Chaplick; Otfried Cheong; Philipp Kindermann; Christian Knauer; Fabian Stehn (J. Comput. Geom., 2018)

Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees. - Ulrike Große; Christian Knauer; Fabian Stehn; Joachim Gudmundsson; Michiel H. M. Smid (Int. J. Found. Comput. Sci., 2019)

Covering many points with a small-area box. - Mark de Berg; Sergio Cabello; Otfried Cheong; David Eppstein; Christian Knauer (J. Comput. Geom., 2019)

The geometric dilation of three points. - Annette Ebbers-Baumann; Rolf Klein; Christian Knauer; Günter Rote (J. Comput. Geom., 2019)

Modellbasierte Methode zur Ableitung nicht-funktionaler Anforderungen im Kontext der Softwaremodernisierung. - Lukas Strey; Christian Hein; Tom Ritter; Christian Knauer; Angelika Ganz (Modellierung, 2020)

Using Landmarks for Near-Optimal Pathfinding on the CPU and GPU. - Maximilian Reischl; Christian Knauer; Michael Guthe (PG (Short Papers, Posters, and Work-in-Progress Papers), 2020)

Corrigendum to: Approximating minimum-area rectangular and convex containers for packing convex polygons. - Mark de Berg; Christian Knauer (J. Comput. Geom., 2020)

Parallel near-optimal pathfinding based on landmarks. - Maximilian Reischl; Christian Knauer; Michael Guthe (Comput. Graph., 2022)

Geometric Assignment and Geometric Bottleneck. - Sergio Cabello; Siu-Wing Cheng; Otfried Cheong; Christian Knauer (CoRR, 2023)

Geometric Matching and Bottleneck Problems. - Sergio Cabello; Siu-Wing Cheng; Otfried Cheong; Christian Knauer (SoCG, 2024)

A Subquadratic Algorithm for Computing the L₁-Distance Between Two Terrains. - Pankaj K. Agarwal; Boris Aronov; Olivier Devillers; Christian Knauer; Guillaume Moroz (SoCG, 2025)

Better Late than Never: the Complexity of Arrangements of Polyhedra. - Boris Aronov; Sang Won Bae 001; Sergio Cabello; Otfried Cheong; David Eppstein; Christian Knauer; Raimund Seidel (CoRR, 2025)