From post

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.

 

Другие публикации лиц с тем же именем

On the Parameterized Complexity of d-Dimensional Point Set Pattern Matching., , и . IWPEC, том 4169 из Lecture Notes in Computer Science, стр. 175-183. Springer, (2006)Acyclic Orientation of Drawings., , , и . SWAT, том 4059 из Lecture Notes in Computer Science, стр. 268-279. Springer, (2006)Hardness of discrepancy computation and ε-net verification in high dimension., , , и . J. Complex., 28 (2): 162-176 (2012)Dilation-Optimal Edge Deletion in Polygonal Cycles., , , , и . Int. J. Comput. Geom. Appl., 20 (1): 69-87 (2010)Shortest Path to a Segment and Quickest Visibility Queries., , , , , , , и . SoCG, том 34 из LIPIcs, стр. 658-673. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Matching Point Sets with Respect to the Earth Mover's Distance., , , и . ESA, том 3669 из Lecture Notes in Computer Science, стр. 520-531. Springer, (2005)On Rolling Cube Puzzles., , , , , , , , и . CCCG, стр. 141-144. Carleton University, Ottawa, Canada, (2007)Shortest path to a segment and quickest visibility queries., , , , , , , и . J. Comput. Geom., 7 (2): 77-100 (2016)09451 Abstracts Collection - Geometric Networks, Metric Space Embeddings and Spatial Data Mining., , , , и . Geometric Networks, Metric Space Embeddings and Spatial Data Mining, том 09451 из Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2009)The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension., , и . IWPEC, том 5917 из Lecture Notes in Computer Science, стр. 198-209. Springer, (2009)