The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Christian Knauer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Sven Schönherr, Robert Günzler, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Udo Warschewske
    Ein neues algorithmisches Verfahren zur Fluoroskopie-basierten Neuronavigation. [Citation Graph (0, 0)][DBLP]
    Bildverarbeitung für die Medizin, 2004, pp:229-233 [Conf]
  2. Marc Benkert, Joachim Gudmundsson, Christian Knauer, Esther Moet, René van Oostrum, Alexander Wolff
    A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem. [Citation Graph (0, 0)][DBLP]
    COCOON, 2006, pp:166-175 [Conf]
  3. Helmut Alt, Christian Knauer, Günter Rote, Sue Whitesides
    The complexity of (un)folding. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:164-170 [Conf]
  4. 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. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:449-458 [Conf]
  5. Peter Braß, Christian Knauer
    Testing the congruence of d-dimensional point sets. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2000, pp:310-314 [Conf]
  6. Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote
    New upper bounds on the quality of the PCA bounding boxes in r2 and r3. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:275-283 [Conf]
  7. Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom Pinchasi, Günter Rote
    There are not too many magic configurations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:142-149 [Conf]
  8. Boris Aronov, Sariel Har-Peled, Christian Knauer, Yusu Wang, Carola Wenk
    Fréchet Distance for Curves, Revisited. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:52-63 [Conf]
  9. Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote
    Matching Point Sets with Respect to the Earth Mover's Distance. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:520-531 [Conf]
  10. 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. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:311-322 [Conf]
  11. Peter Braß, Christian Knauer
    Testing the Congruence of d-Dimensional Point Sets. [Citation Graph (0, 0)][DBLP]
    EWCG, 2000, pp:104-107 [Conf]
  12. Esther Moet, Christian Knauer, Marc J. van Kreveld
    Visibility Maps of Segments and Triangles in 3D. [Citation Graph (0, 0)][DBLP]
    ICCSA (1), 2006, pp:20-29 [Conf]
  13. Kyung-Yong Chwa, Byung-Cheol Jo, Christian Knauer, Esther Moet, René van Oostrum, Chan-Su Shin
    Guarding Art Galleries by Guarding Witnesses. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:352-363 [Conf]
  14. Annette Ebbers-Baumann, Ansgar Grüne, Marek Karpinski, Rolf Klein, Christian Knauer, Andrzej Lingas
    Embedding Point Sets into Plane Graphs of Small Dilation. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:5-16 [Conf]
  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. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:849-858 [Conf]
  16. Christian Knauer, Étienne Schramm, Andreas Spillner, Alexander Wolff
    Configurations with Few Crossings in Topological Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:604-613 [Conf]
  17. Sergio Cabello, Panos Giannopoulos, Christian Knauer
    On the Parameterized Complexity of d-Dimensional Point Set Pattern Matching. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2006, pp:175-183 [Conf]
  18. Alon Efrat, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Günter Rote, Carola Wenk
    Covering shapes by ellipses. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:453-454 [Conf]
  19. Helmut Alt, Christian Knauer, Carola Wenk
    Matching Polygonal Curves with Respect to the Fréchet Distance. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:63-74 [Conf]
  20. Eyal Ackerman, Kevin Buchin, Christian Knauer, Günter Rote
    Acyclic Orientation of Drawings. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:268-279 [Conf]
  21. 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. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:138-149 [Conf]
  22. Christian Knauer, Andreas Spillner
    Approximation Algorithms for the Minimum Convex Partition Problem. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:232-241 [Conf]
  23. Christian Knauer, Andreas Spillner
    A Fixed-Parameter Algorithm for the Minimum Weight Triangulation Problem Based on Small Graph Separators. [Citation Graph (0, 0)][DBLP]
    WG, 2006, pp:49-57 [Conf]
  24. Darko Dimitrov, Christian Knauer, Klaus Kriegel
    Registration of 3D - patterns and shapes with characteristic points. [Citation Graph (0, 0)][DBLP]
    VISAPP (1), 2006, pp:393-400 [Conf]
  25. Helmut Alt, Christian Knauer, Carola Wenk
    Comparison of Distance Measures for Planar Curves. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:38, n:1, pp:45-58 [Journal]
  26. Alon Efrat, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Günter Rote, Carola Wenk
    Covering with Ellipses. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:38, n:1, pp:145-160 [Journal]
  27. Peter Braß, Christian Knauer
    On counting point-hyperplane incidences. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:25, n:1-2, pp:13-20 [Journal]
  28. Peter Braß, Christian Knauer
    Testing congruence and symmetry for general 3-dimensional objects. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:27, n:1, pp:3-11 [Journal]
  29. Kyung-Yong Chwa, Byung-Cheol Jo, Christian Knauer, Esther Moet, René van Oostrum, Chan-Su Shin
    Guarding Art Galleries by Guarding Witnesses. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2006, v:16, n:2-3, pp:205-226 [Journal]
  30. Peter Braß, Christian Knauer
    Testing the Congruence of d-Dimensional Point Sets. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2002, v:12, n:1-2, pp:115-124 [Journal]
  31. Trung Nguyen, Jean-Daniel Boissonnat, Frédéric Falzon, Christian Knauer
    A Disk-Covering Problem with Application in Optical Interferometry. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:173-176 [Conf]
  32. 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. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:141-144 [Conf]
  33. Kevin Buchin, Christian Knauer, Klaus Kriegel, André Schulz, Raimund Seidel
    On the Number of Cycles in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 2007, pp:97-107 [Conf]
  34. Magnús M. Halldórsson, Christian Knauer, Andreas Spillner, Takeshi Tokuyama
    Fixed-Parameter Tractability for Non-Crossing Spanning Trees. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:410-421 [Conf]
  35. Darko Dimitrov, Christian Knauer, Klaus Kriegel, Fabian Stehn
    Approximation Algorithms for a Point-to-Surface Registration Problem in Medical Navigation. [Citation Graph (0, 0)][DBLP]
    FAW, 2007, pp:26-37 [Conf]
  36. Christian Knauer, Étienne Schramm, Andreas Spillner, Alexander Wolff
    Configurations with few crossings in topological graphs. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:37, n:2, pp:104-114 [Journal]
  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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  38. Trung Nguyen, Jean-Daniel Boissonnat, Frédéric Falzon, Christian Knauer
    A disk-covering problem with application in optical interferometry [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  39. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  40. Constructing Optimal Highways. [Citation Graph (, )][DBLP]


  41. Matching point sets with respect to the Earth mover's distance. [Citation Graph (, )][DBLP]


  42. Matching surfaces with characteristic points. [Citation Graph (, )][DBLP]


  43. An exclusion region for minimum dilation triangulations. [Citation Graph (, )][DBLP]


  44. Spanning trees with few crossings in geometric and topological graphs. [Citation Graph (, )][DBLP]


  45. Covering a Simple Polygon by Monotone Directions. [Citation Graph (, )][DBLP]


  46. Approximate Nearest Neighbor Search under Translation Invariant Hausdorff Distance. [Citation Graph (, )][DBLP]


  47. The Directed Hausdorff Distance between Imprecise Point Sets. [Citation Graph (, )][DBLP]


  48. Dilation-Optimal Edge Deletion in Polygonal Cycles. [Citation Graph (, )][DBLP]


  49. The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension. [Citation Graph (, )][DBLP]


  50. Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension. [Citation Graph (, )][DBLP]


  51. The Complexity of Geometric Problems in High Dimension. [Citation Graph (, )][DBLP]


  52. Approximate Point-to-Surface Registration with a Single Characteristic Point. [Citation Graph (, )][DBLP]


  53. Experimental Study of Bounding Box Algorithms. [Citation Graph (, )][DBLP]


  54. Minimizing the Weighted Directed Hausdorff Distance between Colored Point Sets under Translations and Rigid Motions. [Citation Graph (, )][DBLP]


  55. Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. [Citation Graph (, )][DBLP]


  56. Parameterized Complexity of Geometric Problems. [Citation Graph (, )][DBLP]


  57. Visibility maps of segments and triangles in 3D. [Citation Graph (, )][DBLP]


  58. Matching point sets with respect to the Earth Mover's Distance. [Citation Graph (, )][DBLP]


  59. Bounds on the quality of the PCA bounding boxes. [Citation Graph (, )][DBLP]


  60. Algorithms for graphs of bounded treewidth via orthogonal range searching. [Citation Graph (, )][DBLP]


  61. On the dilation spectrum of paths, cycles, and trees. [Citation Graph (, )][DBLP]


  62. Covering a simple polygon by monotone directions. [Citation Graph (, )][DBLP]


  63. Computing k-Centers On a Line [Citation Graph (, )][DBLP]


  64. The parameterized complexity of some geometric problems in unbounded dimension [Citation Graph (, )][DBLP]


  65. Fixed-parameter tractability and lower bounds for stabbing problems [Citation Graph (, )][DBLP]


  66. The directed Hausdorff distance between imprecise point sets [Citation Graph (, )][DBLP]


  67. Abstract Milling with Turn Costs [Citation Graph (, )][DBLP]


  68. Computing Principal Components Dynamically [Citation Graph (, )][DBLP]


  69. There Are Not Too Many Magic Configurations. [Citation Graph (, )][DBLP]


  70. Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002