( en | de | ru )

 

Disambiguation of "Knauer, Christian"

Author of the publication

copydeleteadd this publication to your clipboard
Top-k Manhattan Spatial Skyline Queries.

, , , and . WALCOM, volume 8344 of Lecture Notes in Computer Science, page 22-33. Springer, (2014)

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)

Irmgard Knauer

Bernd Knauer

 

Other publications of authors with the same name

Dilation and Detours in Geometric Networks., and . Handbook of Approximation Algorithms and Metaheuristics, Chapman and Hall/CRC, (2007)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)Acyclic Orientation of Drawings., , , and . SWAT, volume 4059 of Lecture Notes in Computer Science, page 268-279. Springer, (2006)On the dilation spectrum of paths, cycles, and trees., , , and . Comput. Geom., 42 (9): 923-933 (2009)Fixed-parameter tractability and lower bounds for stabbing problems., , , and . Comput. Geom., 46 (7): 839-860 (2013)Hardness of discrepancy computation and ε-net verification in high dimension., , , and . J. Complex., 28 (2): 162-176 (2012)Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D., , , , , , and . Discret. Comput. Geom., 39 (1-3): 17-37 (2008)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)