( en | de | ru )

 

Disambiguation of "Knauer, Christian"

Author of the publication

copydeleteadd this publication to your clipboard
On the Parameterized Complexity of d-Dimensional Point Set Pattern Matching.

, , and . IWPEC, volume 4169 of Lecture Notes in Computer Science, page 175-183. Springer, (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Christian Knauer

Markus Christian Knauer

Markus Knauer

Struktur-Reaktivitäts-Korrelation von Dieselruß und Charakterisierung von PAHs und Carbonylen im Abgas von Biokraftstoffen. TU München, (2010)

Wolfgang Knauer

Wolfgang Knauer

 

Other publications of authors with the same name

Dilation-Optimal Edge Deletion in Polygonal Cycles., , , , and . Int. J. Comput. Geom. Appl., 20 (1): 69-87 (2010)Matching Point Sets with Respect to the Earth Mover's Distance., , , and . ESA, volume 3669 of Lecture Notes in Computer Science, page 520-531. Springer, (2005)Shortest Path to a Segment and Quickest Visibility Queries., , , , , , , and . SoCG, volume 34 of LIPIcs, page 658-673. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)On Rolling Cube Puzzles., , , , , , , , and . CCCG, page 141-144. Carleton University, Ottawa, Canada, (2007)Acyclic Orientation of Drawings., , , and . SWAT, volume 4059 of Lecture Notes in Computer Science, page 268-279. Springer, (2006)On the Parameterized Complexity of d-Dimensional Point Set Pattern Matching., , and . IWPEC, volume 4169 of Lecture Notes in Computer Science, page 175-183. Springer, (2006)Hardness of discrepancy computation and ε-net verification in high dimension., , , and . J. Complex., 28 (2): 162-176 (2012)Maximizing the Area of Overlap of Two Unions of Disks Under Rigid Motion., , , , , and . SWAT, volume 3111 of Lecture Notes in Computer Science, page 138-149. Springer, (2004)The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension., , and . IWPEC, volume 5917 of Lecture Notes in Computer Science, page 198-209. Springer, (2009)Approximating the Average Stretch Factor of Geometric Graphs., , , and . ISAAC (1), volume 6506 of Lecture Notes in Computer Science, page 37-48. Springer, (2010)