Team

Christian Knauer

Christian Knauer
Room
2.49
E-Mail
christian.knauer@uni-bayreuth.de
Phone
+49 921 557740
Office hours
By appointment only
Publications
DBLP · Google Scholar

Publications

  1. Better Late than Never: the Complexity of Arrangements of PolyhedraBoris Aronov and Sang Won Bae and Sergio Cabello and Otfried Cheong and David Eppstein and Christian Knauer and Raimund Seidel · 2025 · CoRR
  2. A Subquadratic Algorithm for Computing the L₁-Distance Between Two TerrainsPankaj K. Agarwal and Boris Aronov and Olivier Devillers and Christian Knauer and Guillaume Moroz · 2025 · 41st International Symposium on Computational Geometry (SoCG 2025)
  3. Geometric Matching and Bottleneck ProblemsSergio Cabello and Siu-Wing Cheng and Otfried Cheong and Christian Knauer · 2024 · 40th International Symposium on Computational Geometry (SoCG 2024)
  4. Parallel near-optimal pathfinding based on landmarksMaximilian Reischl and Christian Knauer and Michael Guthe · 2022 · Computers & Graphics
  5. Using Landmarks for Near-Optimal Pathfinding on the CPU and GPUMaximilian Reischl and Christian Knauer and Michael Guthe · 2020 · 28th Pacific Conference on Computer Graphics and Applications (PG 2020)
  6. Modellbasierte Methode zur Ableitung nicht-funktionaler Anforderungen im Kontext der SoftwaremodernisierungLukas Strey and Christian Hein and Tom Ritter and Christian Knauer and Angelika Ganz · 2020 · Modellierung 2020
  7. Corrigendum to: Approximating minimum-area rectangular and convex containers for packing convex polygonsMark de Berg and Christian Knauer · 2020 · Journal of Computational Geometry
  8. The geometric dilation of three pointsAnnette Ebbers-Baumann and Rolf Klein and Christian Knauer and Günter Rote · 2019 · Journal of Computational Geometry (JoCG)
  9. Fast Algorithms for Diameter-Optimally Augmenting Paths and TreesGroße, Ulrike and Knauer, Christian and Stehn, Fabian and Gudmundsson, Joachim and Smid, Michiel · 2019 · International Journal of Foundations of Computer Science
  10. Covering Many Points with a Small-Area Boxde Berg, Mark and Cabello, Sergio and Cheong, Otfried and Eppstein, David and Knauer, Christian · 2019 · Journal of Computational Geometry (JoCG)
  11. Placing your Coins on a ShelfHelmut Alt and Kevin Buchin and Steven Chaplick and Otfried Cheong and Philipp Kindermann and Christian Knauer and Fabian Stehn · 2018 · Journal of Computational Geometry (JoCG)
  12. Elastic geometric shape matching for translations under the Manhattan normChristian Knauer and Luise Sommer and Fabian Stehn · 2018 · Computational Geometry
  13. An FPTAS for an Elastic Shape Matching Problem with Cyclic NeighborhoodsKnauer, Christian and Sommer, Luise and Stehn, Fabian · 2018 · Computational Science and Its Applications -- ICCSA 2018
  14. Top-k Manhattan spatial skyline queriesWanbin Son and Fabian Stehn and Christian Knauer and Hee-Kap Ahn · 2017 · Inf. Process. Lett.
  15. Placing your Coins on a ShelfHelmut Alt and Kevin Buchin and Steven Chaplick and Otfried Cheong and Philipp Kindermann and Christian Knauer and Fabian Stehn · 2017 · 28th International Symposium on Algorithms and Computation, ISAAC 2017, December 9-12, 2017, Phuket, Thailand
  16. Minimum Cell Connection in Line Segment ArrangementsAlt, Helmut and Cabello, Sergio and Giannopoulos, Panos and Knauer, Christian · 2017 · International Journal of Computational Geometry & Applications
  17. Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex PolygonsHelmut Alt and Mark de Berg and Christian Knauer · 2017 · JoCG
  18. Shortest path to a segment and quickest visibility queriesValentin Polishchuk and Esther M. Arkin and Alon Efrat and Christian Knauer and Joseph S. B. Mitchell and Günter Rote and Lena Schlipf and Topi Talvitie and Valentin Polishchuk · 2016 · JoCG
  19. Guest Editors' ForewordChristian Knauer and Michiel H. M. Smid · 2016 · Int. J. Comput. Geometry Appl.
  20. Finding largest rectangles in convex polygonsSergio Cabello and Otfried Cheong and Christian Knauer and Lena Schlipf · 2016 · Comput. Geom.
  21. Shortest Path to a Segment and Quickest Visibility QueriesEsther Arkin and Alon Efrat and Christian Knauer and Joseph Mitchell and Valentin Polishchuk and Günter Rote and Lena Schlipf and Topi Talvitie · 2015 · 31st International Symposium on Computational Geometry, SoCG 2015, June 22-25, 2015, Eindhoven, The Netherlands
  22. Fixed-Parameter Complexity and Approximability of Norm MaximizationChristian Knauer and Stefan König and Daniel Werner · 2015 · Discrete & Computational Geometry
  23. Fast Algorithms for Diameter-Optimally Augmenting PathsUlrike Gro\sse and Joachim Gudmundsson and Christian Knauer and Michiel H. M. Smid and Fabian Stehn · 2015 · Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I
  24. Elastic Geometric Shape Matching for Point Sets under TranslationsChristian Knauer and Fabian Stehn · 2015 · Algorithms and Data Structures - 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings
  25. Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex PolygonsHelmut Alt and Mark de Berg and Christian Knauer · 2015 · Algorithms - ESA 2015 - 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings
  26. Top-k Manhattan Spatial Skyline QueriesWanbin Son and Fabian Stehn and Christian Knauer and Hee-Kap Ahn · 2014 · WALCOM
  27. Convex transversalsEsther Arkin and Claudia Dieckmann and Christian Knauer and Joseph Mitchell and Valentin Polishchuk and Lena Schlipf and Shang Yang · 2014 · Comput. Geom.
  28. Realistic roofs over a rectilinear polygonHee-Kap Ahn and Sang Won Bae and Christian Knauer and Mira Lee and Chan-Su Shin and Antoine Vigneron · 2013 · Comput. Geom.
  29. Range-Aggregate Queries for Geometric Extent ProblemsPeter Brass and Christian Knauer and Chan-Su Shin and Michiel H. M. Smid · 2013 · CATS
  30. On the complexity of Erdös-Szekeres and related problems in $\R^3$Panos Giannopoulos and Christian Knauer and Daniel Werner · 2013 · ESA
  31. Fixed-parameter tractability and lower bounds for stabbing problemsPanos Giannopoulos and Christian Knauer and Günter Rote and Daniel Werner · 2013 · Comput. Geom.
  32. Covering and piercing disks with two centersHee-Kap Ahn and Sang-Sub Kim and Christian Knauer and Lena Schlipf and Chan-Su Shin and Antoine Vigneron · 2013 · Comput. Geom.
  33. Advantages and Disadvantages of Training based Object Detection / Classification in SAS ImagesWolfgang Jans and Christian Knauer and Florian Langner and Wolfgang Middelmann · 2013 · POMA
  34. Largest inscribed rectangles in convex polygonsChristian Knauer and Lena Schlipf and Jens M. Schmidt and Hans Raj Tiwary · 2012 · J. Discrete Algorithms
  35. Hardness of discrepancy computation and eps-net verification in high dimensionPanos Giannopoulos and Christian Knauer and Magnus Wahlström and Daniel Werner · 2012 · J. Complexity
  36. Computing the Discrete Frëchet Distance with Imprecise InputHee-Kap Ahn and Christian Knauer and Marc Scherfenberg and Lena Schlipf and Antoine Vigneron · 2012 · Int. J. Comput. Geometry Appl.
  37. Approximating the average stretch factor of geometric graphsSiu-Wing Cheng and Christian Knauer and Stefan Langerman and Michiel H. M. Smid · 2012 · JoCG
  38. Advantages and Disadvantages of Training based Object Detection / Classification in SAS ImagesWolfgang Jans and Christian Knauer and Florian Langner and Wolfgang Middelmann · 2012 · 11th European Conference on Underwater Acoustics
  39. The directed Hausdorff distance between imprecise point setsChristian Knauer and Maarten Löffler and Marc Scherfenberg and Thomas Wolle · 2011 · Theor. Comput. Sci.
  40. The Aligned k-Center ProblemPeter Brass and Christian Knauer and Hyeon-Suk Na and Chan-Su Shin and Antoine Vigneron · 2011 · Int. J. Comput. Geometry Appl.
  41. On the computational complexity of Ham-Sandwich cuts, Helly sets, and related problemsChristian Knauer and Hans Raj Tiwary and Daniel Werner · 2011 · STACS
  42. On graphs and algebraic graphs that do not contain cycles of length 4Noga Alon and H. Tracy Hall and Christian Knauer and Rom Pinchasi and Raphael Yuster · 2011 · Journal of Graph Theory
  43. Non-uniform Geometric MatchingsChristian Knauer and Klaus Kriegel and Fabian Stehn · 2011 · ICCSA (3)
  44. Minimizing the weighted directed Hausdorff distance between colored point sets under translations and rigid motionsChristian Knauer and Klaus Kriegel and Fabian Stehn · 2011 · Theor. Comput. Sci.
  45. Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimensionSergio Cabello and Panos Giannopoulos and Christian Knauer and Däniel Marx and Günter Rote · 2011 · ACM Transactions on Algorithms
  46. Generating Realistic Roofs over a Rectilinear PolygonHee-Kap Ahn and Sang Won Bae and Christian Knauer and Mira Lee and Chan-Su Shin and Antoine Vigneron · 2011 · ISAAC
  47. Efficient Dynamical Computation of Principal ComponentsDarko Dimitrov and Mathias Holst and Christian Knauer and Klaus Kriegel · 2011 · GRAPP
  48. Covering and Piercing Disks with Two CentersHee-Kap Ahn and Sang-Sub Kim and Christian Knauer and Lena Schlipf and Chan-Su Shin and Antoine Vigneron · 2011 · ISAAC
  49. Convex TransversalsEsther Arkin and Claudia Dieckmann and Christian Knauer and Joseph Mitchell and Valentin Polishchuk and Lena Schlipf and Shang Yang · 2011 · WADS
  50. Benefit for Screnning by Automated Acoustic Data FusionWolfgang Jans and Christian Knauer and Florian Langner and Wolfgang Middelmann · 2011 · Underwater Acoustics Measurements: Technologies and Results
  51. Benefit for Classification by Automated Acoustic Data FusionAlfons Ebert and Wolfgang Jans and Christian Knauer and Florian Langner · 2011 · Underwater Acoustics Measurements: Technologies and Results
  52. Approximate Nearest Neighbor Search under Translation Invariant Hausdorff DistanceChristian Knauer and Marc Scherfenberg · 2011 · Int. J. Comput. Geometry Appl.
  53. A fixed-parameter algorithm for the minimum Manhattan network problemChristian Knauer and Andreas Spillner · 2011 · JoCG
  54. The effect of pre-processing on the outcome of an CAD/CAC system for underwater in SAS and conventional side scan imagesWolfgang Jans and Christian Knauer and Florian Langner and Wolfgang Middelmann · 2010 · 10th European Conference on Underwater Acoustics
  55. The Complexity of Geometric Problems in High DimensionChristian Knauer · 2010 · TAMC
  56. Performance gain by fusing classification resultes for differenet aspect angles in SAS side scan imagesAlfons Ebert and Wolfgang Jans and Christian Knauer and Florian Langner · 2010 · 10th European Conference on Underwater Acoustics
  57. Dilation-Optimal Edge Deletion in Polygonal CyclesHee-Kap Ahn and Mohammad Farshi and Christian Knauer and Michiel Smid and Yajun Wang · 2010 · Int. J. Comput. Geometry Appl.
  58. Covering a simple polygon by monotone directionsHee-Kap Ahn and Peter Brass and Christian Knauer and Hyeon-Suk Na and Chan-Su Shin · 2010 · Comput. Geom.
  59. Computing the Discrete Frëchet Distance with Imprecise InputHee-Kap Ahn and Christian Knauer and Marc Scherfenberg and Lena Schlipf and Antoine Vigneron · 2010 · ISAAC (2)
  60. Computing Geometric Minimum-Dilation Graphs is NP-HardPanos Giannopoulos and Rolf Klein and Christian Knauer and Martin Kutz and Däniel Marx · 2010 · Int. J. Comput. Geometry Appl.
  61. Computer Aided Detection and Clasification of MLOs in Side Scan Sonar ImagesWolfgang Jans and Christian Knauer and Florian Langner and Wolfgang Middelmann · 2010 · UDT EUROPE 2010
  62. Approximating the Average Stretch Factor of Geometric GraphsSiu-Wing Cheng and Christian Knauer and Stefan Langerman and Michiel H. M. Smid · 2010 · ISAAC (1)
  63. The Parameterized Complexity of Some Geometric Problems in Unbounded DimensionPanos Giannopoulos and Christian Knauer and Günter Rote · 2009 · IWPEC
  64. The Directed Hausdorff Distance between Imprecise Point SetsChristian Knauer and Maarten Löffler and Marc Scherfenberg and Thomas Wolle · 2009 · ISAAC
  65. Side scan sonar image resolution and automatic object detection, classification and identificationAlfons Ebert and Wolfgang Jans and Christian Knauer and Florian Langner · 2009 · OCEANS 2009 - EUROPE
  66. On the dilation spectrum of paths, cycles, and treesRolf Klein and Christian Knauer and Giri Narasimhan and Michiel Smid · 2009 · Comput. Geom.
  67. Minimizing the Weighted Directed Hausdorff Distance between Colored Point Sets under Translations and Rigid MotionsChristian Knauer and Klaus Kriegel and Fabian Stehn · 2009 · FAW
  68. Maximizing the Area of Overlap of Two Unions of Disks under Rigid MotionSergio Cabello and Mark de Berg and Panos Giannopoulos and Christian Knauer and Renë van Oostrum and Remco C. Veltkamp · 2009 · Int. J. Comput. Geometry Appl.
  69. Image processing in side scan sonar images for object detection and classificationWolfgang Jans and Christian Knauer and Florian Langner and Wolfgang Middelmann · 2009 · Underwater Acoustic Measurments: Technologies & Results
  70. Constructing Optimal HighwaysHee-Kap Ahn and Helmut Alt and Tetsuo Asano and Sang Won Bae and Peter Brass and Otfried Cheong and Christian Knauer and Hyeon-Suk Na and Chan-Su Shin and Alexander Wolff · 2009 · Int. J. Found. Comput. Sci.
  71. Bounds on the quality of the PCA bounding boxesDarko Dimitrov and Christian Knauer and Klaus Kriegel and Günter Rote · 2009 · Comput. Geom.
  72. Algorithms for graphs of bounded treewidth via orthogonal range searchingSergio Cabello and Christian Knauer · 2009 · Comput. Geom.
  73. A Polynomial-Time Approximation Algorithm for a Geometric Dispersion ProblemMarc Benkert and Joachim Gudmundsson and Christian Knauer and Renë van Oostrum and Alexander Wolff · 2009 · Int. J. Comput. Geometry Appl.
  74. Approximate Point-to-Surface Registration with a Single Characteristic PointDarko Dimitrov and Christian Knauer and Klaus Kriegel and Fabian Stehn · 2008 · VISAPP (1)
  75. Approximate Nearest Neighbor Search under Translation Invariant Hausdorff DistanceChristian Knauer and Marc Scherfenberg · 2008 · ISAAC
  76. Approximation Algorithms for a Point-to-Surface Registration Problem in Medical NavigationDarko Dimitrov and Christian Knauer and Klaus Kriegel and Fabian Stehn · 2007 · FAW