From post

Eliminating Crossings in Ordered Graphs

, , , , , , и . Proc. 19th Scand. Symp. Algorithm Theory (SWAT'24), том из LIPIcs, Schloss Dagstuhl -- Leibniz-Institut für Informatik, (2024)To appear..

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.

 

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

Two optimization problems for unit disks., и . Comput. Geom., (2018)Stackelberg Shortest Path Tree Game, Revisited. CoRR, (2012)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)A point calculus for interlevel set homology., , и . Pattern Recognit. Lett., 33 (11): 1436-1444 (2012)Maximum Matchings in Geometric Intersection Graphs., , и . STACS, том 154 из LIPIcs, стр. 31:1-31:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Two Optimization Problems for Unit Disks., и . CoRR, (2017)Higher-order Voronoi diagrams on triangulated surfaces., , и . Inf. Process. Lett., 109 (9): 440-445 (2009)The Inverse Voronoi Problem in Graphs I: Hardness., , , и . Algorithmica, 82 (10): 3018-3040 (2020)Covering point sets with two disjoint disks or squares., , , , , и . Comput. Geom., 40 (3): 195-206 (2008)