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.

 

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

The Straight-Line RAC Drawing Problem Is NP-Hard., , и . SOFSEM, том 6543 из Lecture Notes in Computer Science, стр. 74-85. Springer, (2011)Many-to-One Boundary Labeling with Backbones, , , , , , , и . Journal of Graph Algorithms and Applications, 19 (3): 779--816 (2015)A Universal Slope Set for 1-Bend Planar Drawings., , , и . SoCG, том 77 из LIPIcs, стр. 9:1-9:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Slanted Orthogonal Drawings., , , , и . GD, том 8242 из Lecture Notes in Computer Science, стр. 424-435. Springer, (2013)The Rique-Number of Graphs., , , , , и . GD, том 13764 из Lecture Notes in Computer Science, стр. 371-386. Springer, (2022)Recognizing DAGs with Page-Number 2 Is NP-complete., , , , , и . GD, том 13764 из Lecture Notes in Computer Science, стр. 361-370. Springer, (2022)Circle-Representations of Simple 4-Regular Planar Graphs., и . GD, том 7704 из Lecture Notes in Computer Science, стр. 138-149. Springer, (2012)Convex Grid Drawings of Planar Graphs with Constant Edge-Vertex Resolution., , , и . IWOCA, том 13270 из Lecture Notes in Computer Science, стр. 157-171. Springer, (2022)Beyond-Planarity: Turán-Type Results for Non-Planar Bipartite Graphs., , , , и . ISAAC, том 123 из LIPIcs, стр. 28:1-28:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Four Pages Are Indeed Necessary for Planar Graphs., , , , , и . CoRR, (2020)