( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Fixed-Parameter Approach to Two-Layer Planarization.

, , , , , , , , , , , и . GD, том 2265 из Lecture Notes in Computer Science, стр. 1-15. Springer, (2001)

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.

Karl Vida

Jochen Vida

Vida Maruhn

Vida Nezhat

Vida Vafaizadeh

 

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

On validating planar worlds., и . SODA, стр. 791-792. ACM/SIAM, (2001)Thickness and antithickness of graphs., и . J. Comput. Geom., 9 (1): 356-386 (2018)Track Layouts, Layered Path Decompositions, and Leveled Planarity., , , , и . Algorithmica, 81 (4): 1561-1583 (2019)Minor-closed graph classes with bounded layered pathwidth., , , , и . CoRR, (2018)Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers., , , , , , , , , и 1 other автор(ы). ESA, том 144 из LIPIcs, стр. 3:1-3:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)An affine invariant k-nearest neighbor regression estimate., , , и . ISIT, стр. 1445-1447. IEEE, (2012)Biased range trees., , и . SODA, стр. 486-495. SIAM, (2009)Proof of the Clustered Hadwiger Conjecture., , , и . FOCS, стр. 1921-1930. IEEE, (2023)Every Large Point Set contains Many Collinear Points or an Empty Pentagon., , , , , , , , , и . CCCG, стр. 99-102. (2009)Drawing Planar Graphs with Many Collinear Vertices., , , , и . GD, том 9801 из Lecture Notes in Computer Science, стр. 152-165. Springer, (2016)