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)Computing a Center-Transversal Line., , , и . FSTTCS, том 4337 из Lecture Notes in Computer Science, стр. 93-104. Springer, (2006)Covering point sets with two disjoint disks or squares., , , , , и . Comput. Geom., 40 (3): 195-206 (2008)Matching Point Sets with Respect to the Earth Mover's Distance., , , и . ESA, том 3669 из Lecture Notes in Computer Science, стр. 520-531. Springer, (2005)Maximizing Dominance in the Plane and Its Applications., , и . WADS, том 11646 из Lecture Notes in Computer Science, стр. 325-338. Springer, (2019)Algorithmic Aspects of Proportional Symbol Maps., , , и . ESA, том 4168 из Lecture Notes in Computer Science, стр. 720-731. Springer, (2006)Geometric Simultaneous Embeddings of a Graph and a Matching., , , , , и . J. Graph Algorithms Appl., 15 (1): 79-96 (2011)Maximum Matchings in Geometric Intersection Graphs., , и . STACS, том 154 из LIPIcs, стр. 31:1-31:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Some Open Problems in Computational Geometry (Invited Talk).. MFCS, том 170 из LIPIcs, стр. 2:1-2:6. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)On the Minimum Consistent Subset Problem., , , , , , и . WADS, том 11646 из Lecture Notes in Computer Science, стр. 155-167. Springer, (2019)