( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Parameterized Complexity of 1-Planarity.

, , и . WADS, том 8037 из Lecture Notes in Computer Science, стр. 97-108. Springer, (2013)

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.

Sergio Moccia

Sergio Dellavalle

Sérgio Campos

Sergio Scognamillo

Sergio Greco

 

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

Maximizing Dominance in the Plane and Its Applications., , и . WADS, том 11646 из Lecture Notes in Computer Science, стр. 325-338. Springer, (2019)Computing a Center-Transversal Line., , , и . FSTTCS, том 4337 из Lecture Notes in Computer Science, стр. 93-104. Springer, (2006)On the Parameterized Complexity of d-Dimensional Point Set Pattern Matching., , и . IWPEC, том 4169 из Lecture Notes in Computer Science, стр. 175-183. Springer, (2006)Matching Point Sets with Respect to the Earth Mover's Distance., , , и . ESA, том 3669 из Lecture Notes in Computer Science, стр. 520-531. Springer, (2005)Covering point sets with two disjoint disks or squares., , , , , и . Comput. Geom., 40 (3): 195-206 (2008)Geometric Simultaneous Embeddings of a Graph and a Matching., , , , , и . J. Graph Algorithms Appl., 15 (1): 79-96 (2011)Algorithmic Aspects of Proportional Symbol Maps., , , и . ESA, том 4168 из Lecture Notes in Computer Science, стр. 720-731. Springer, (2006)Some Open Problems in Computational Geometry (Invited Talk).. MFCS, том 170 из LIPIcs, стр. 2:1-2:6. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Maximum Matchings in Geometric Intersection Graphs., , и . STACS, том 154 из LIPIcs, стр. 31:1-31:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard., и . SIAM J. Comput., 42 (5): 1803-1829 (2013)