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.

 

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

Bitonic st-Orderings for Upward Planar Graphs: The Variable Embedding Setting., , , и . WG, том 12301 из Lecture Notes in Computer Science, стр. 339-351. Springer, (2020)The mixed page number of graphs., , , , и . Theor. Comput. Sci., (2022)Recognizing Map Graphs of Bounded Treewidth., , , , , и . SWAT, том 227 из LIPIcs, стр. 8:1-8:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Multi-level Steiner Trees., , , , , , , , , и 1 other автор(ы). ACM J. Exp. Algorithmics, 24 (1): 2.5:1-2.5:22 (2019)Recognizing DAGs with Page-Number 2 Is NP-complete., , , , , и . GD, том 13764 из Lecture Notes in Computer Science, стр. 361-370. Springer, (2022)Convex Grid Drawings of Planar Graphs with Constant Edge-Vertex Resolution., , , и . IWOCA, том 13270 из Lecture Notes in Computer Science, стр. 157-171. Springer, (2022)Geometric Representations of Dichotomous Ordinal Data., , , и . WG, том 11789 из Lecture Notes in Computer Science, стр. 205-217. Springer, (2019)Book Embeddings of Nonplanar Graphs with Small Faces in Few Pages., , , , , и . SoCG, том 164 из LIPIcs, стр. 16:1-16:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Bitonic st-Orderings for Upward Planar Graphs: Splits and Bends in the Variable Embedding Scenario., , , и . Algorithmica, 85 (9): 2667-2692 (сентября 2023)Drawing Shortest Paths in Geodetic Graphs., , , , , , и . J. Graph Algorithms Appl., 26 (3): 353-361 (2022)