Christian Knauer

According to our database1, Christian Knauer authored at least 103 papers between 2001 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Using Landmarks for Near-Optimal Pathfinding on the CPU and GPU.
Proceedings of the 28th Pacific Conference on Computer Graphics and Applications, 2020

Modellbasierte Methode zur Ableitung nicht-funktionaler Anforderungen im Kontext der Softwaremodernisierung.
Proceedings of the Modellierung 2020, 19.-21. Februar 2020, Wien, Österreich., 2020

2019
The geometric dilation of three points.
J. Comput. Geom., 2019

Covering many points with a small-area box.
J. Comput. Geom., 2019

Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees.
Int. J. Found. Comput. Sci., 2019

2018
Placing your coins on a shelf.
J. Comput. Geom., 2018

Elastic geometric shape matching for translations under the Manhattan norm.
Comput. Geom., 2018

An FPTAS for an Elastic Shape Matching Problem with Cyclic Neighborhoods.
Proceedings of the Computational Science and Its Applications - ICCSA 2018, 2018

Dilation and Detours in Geometric Networks.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017
Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons.
J. Comput. Geom., 2017

Top-k Manhattan spatial skyline queries.
Inf. Process. Lett., 2017

Minimum Cell Connection in Line Segment Arrangements.
Int. J. Comput. Geom. Appl., 2017

2016
Shortest path to a segment and quickest visibility queries.
J. Comput. Geom., 2016

Guest Editors' Foreword.
Int. J. Comput. Geom. Appl., 2016

Finding largest rectangles in convex polygons.
Comput. Geom., 2016

2015
Fixed-Parameter Complexity and Approximability of Norm Maximization.
Discret. Comput. Geom., 2015

Elastic Geometric Shape Matching for Point Sets under Translations.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Fast Algorithms for Diameter-Optimally Augmenting Paths.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014
Convex transversals.
Comput. Geom., 2014

2013
Finding a largest empty convex subset in space is W[1]-hard
CoRR, 2013

Fixed-parameter tractability and lower bounds for stabbing problems.
Comput. Geom., 2013

Covering and piercing disks with two centers.
Comput. Geom., 2013

Realistic roofs over a rectilinear polygon.
Comput. Geom., 2013

On the Computational Complexity of Erdős-Szekeres and Related Problems in ℝ3.
Proceedings of the Algorithms - ESA 2013, 2013

Range-Aggregate Queries for Geometric Extent Problems.
Proceedings of the Nineteenth Computing: The Australasian Theory Symposium, 2013

2012
Approximating the average stretch factor of geometric graphs.
J. Comput. Geom., 2012

Largest inscribed rectangles in convex polygons.
J. Discrete Algorithms, 2012

Hardness of discrepancy computation and ε-net verification in high dimension.
J. Complex., 2012

Computing the Discrete FRéChet Distance with Imprecise Input.
Int. J. Comput. Geom. Appl., 2012

2011
The directed Hausdorff distance between imprecise point sets.
Theor. Comput. Sci., 2011

Minimizing the weighted directed Hausdorff distance between colored point sets under translations and rigid motions.
Theor. Comput. Sci., 2011

Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension.
ACM Trans. Algorithms, 2011

A fixed-parameter algorithm for the minimum Manhattan network problem.
J. Comput. Geom., 2011

On graphs and algebraic graphs that do not contain cycles of length 4.
J. Graph Theory, 2011

Approximate Nearest Neighbor Search under Translation Invariant Hausdorff Distance.
Int. J. Comput. Geom. Appl., 2011

The Aligned k-Center Problem.
Int. J. Comput. Geom. Appl., 2011

Erdős-Szekeres and Testing Weak epsilon-Nets are NP-hard in 3 dimensions - and what now?
CoRR, 2011

Minimum cell connection and separation in line segment arrangements
CoRR, 2011

Hardness of discrepancy computation and epsilon-net verification in high dimension
CoRR, 2011

On the computational complexity of Ham-Sandwich cuts, Helly sets, and related problems.
Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

Generating Realistic Roofs over a Rectilinear Polygon.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Non-uniform Geometric Matchings.
Proceedings of the Computational Science and Its Applications - ICCSA 2011, 2011

Efficient Dynamical Computation of Principal Components.
Proceedings of the GRAPP 2011, 2011

2010
Acyclic Orientation of Drawings.
J. Graph Algorithms Appl., 2010

Computing Geometric Minimum-Dilation Graphs is NP-Hard.
Int. J. Comput. Geom. Appl., 2010

Dilation-Optimal Edge Deletion in Polygonal Cycles.
Int. J. Comput. Geom. Appl., 2010

Covering a simple polygon by monotone directions.
Comput. Geom., 2010

Milling a Graph with Turn Costs: A Parameterized Complexity Perspective.
Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

The Complexity of Geometric Problems in High Dimension.
Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

2009
Constructing Optimal Highways.
Int. J. Found. Comput. Sci., 2009

Maximizing the Area of Overlap of Two Unions of Disks under Rigid Motion.
Int. J. Comput. Geom. Appl., 2009

A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem.
Int. J. Comput. Geom. Appl., 2009

Computing Principal Components Dynamically
CoRR, 2009

Abstract Milling with Turn Costs
CoRR, 2009

The parameterized complexity of some geometric problems in unbounded dimension
CoRR, 2009

Computing k-Centers On a Line
CoRR, 2009

On the dilation spectrum of paths, cycles, and trees.
Comput. Geom., 2009

Bounds on the quality of the PCA bounding boxes.
Comput. Geom., 2009

Algorithms for graphs of bounded treewidth via orthogonal range searching.
Comput. Geom., 2009

The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension.
Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

09451 Abstracts Collection - Geometric Networks, Metric Space Embeddings and Spatial Data Mining.
Proceedings of the Geometric Networks, Metric Space Embeddings and Spatial Data Mining, 01.11., 2009

2008
On the parameterized complexity of d-dimensional point set pattern matching.
Inf. Process. Lett., 2008

Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D.
Discret. Comput. Geom., 2008

There Are Not Too Many Magic Configurations.
Discret. Comput. Geom., 2008

Visibility maps of segments and triangles in 3D.
Comput. Geom., 2008

Matching point sets with respect to the Earth Mover's Distance.
Comput. Geom., 2008

Parameterized Complexity of Geometric Problems.
Comput. J., 2008

Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems.
Algorithmica, 2008

Approximate Point-to-Surface Registration with a Single Characteristic Point.
Proceedings of the VISAPP 2008: Proceedings of the Third International Conference on Computer Vision Theory and Applications, Funchal, Madeira, Portugal, January 22-25, 2008, 2008

Closed-Form Solutions for Continuous PCA and Bounding Box Algorithms.
Proceedings of the Computer Vision and Computer Graphics. Theory and Applications, 2008

Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Experimental Study of Bounding Box Algorithms.
Proceedings of the GRAPP 2008, 2008

2007
Dilation and Detours in Geometric Networks.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Embedding Point Sets into Plane Graphs of Small Dilation.
Int. J. Comput. Geom. Appl., 2007

Configurations with few crossings in topological graphs.
Comput. Geom., 2007

Fixed-Parameter Tractability for Non-Crossing Spanning Trees.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Approximation Algorithms for a Point-to-Surface Registration Problem in Medical Navigation.
Proceedings of the Frontiers in Algorithmics, First Annual International Workshop, 2007

New upper bounds on the quality of the PCA bounding boxes in r<sup>2</sup> and r<sup>3</sup>.
Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, 2007

On the Number of Cycles in Planar Graphs.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

A Disk-Covering Problem with Application in Optical Interferometry.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

On Rolling Cube Puzzles.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006
Guarding Art Galleries by Guarding Witnesses.
Int. J. Comput. Geom. Appl., 2006

Minimum-Cost Coverage of Point Sets by Disks
CoRR, 2006

A Fixed-Parameter Algorithm for the Minimum Weight Triangulation Problem Based on Small Graph Separators.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006

Registration of 3D - patterns and shapes with characteristic points.
Proceedings of the VISAPP 2006: Proceedings of the First International Conference on Computer Vision Theory and Applications, 2006

Approximation Algorithms for the Minimum Convex Partition Problem.
Proceedings of the Algorithm Theory, 2006

On the Parameterized Complexity of <i>d</i>-Dimensional Point Set Pattern Matching.
Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006

Fréchet Distance for Curves, Revisited.
Proceedings of the Algorithms, 2006

Minimum-cost coverage of point sets by disks.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem.
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

2005
Exact and Approximation Algorithms for Computing the Dilation Spectrum of Paths, Trees, and Cycles.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Spanning trees with few crossings in geometric and topological graphs.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

An exclusion region for minimum dilation triangulations.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Matching surfaces with characteristic points.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

2004
Testing congruence and symmetry for general 3-dimensional objects.
Comput. Geom., 2004

Covering with Ellipses.
Algorithmica, 2004

Comparison of Distance Measures for Planar Curves.
Algorithmica, 2004

Ein neues algorithmisches Verfahren zur Fluoroskopie-basierten Neuronavigation.
Proceedings of the Bildverarbeitung für die Medizin 2004, Algorithmen - Systeme, 2004

2003
On counting point-hyperplane incidences.
Comput. Geom., 2003

The complexity of (un)folding.
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

2002
Testing the Congruence of d-Dimensional Point Sets.
Int. J. Comput. Geom. Appl., 2002

Covering shapes by ellipses.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001
Matching Polygonal Curves with Respect to the Fréchet Distance.
Proceedings of the STACS 2001, 2001


  Loading...