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.

 

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

Graph Planarity Testing with Hierarchical Embedding Constraints., , и . CoRR, (2019)Greedy rectilinear drawings., , , , , , , , и . Theor. Comput. Sci., (2019)On the Parameterized Complexity of s-club Cluster Deletion Problems., , , и . SOFSEM, том 13878 из Lecture Notes in Computer Science, стр. 159-173. Springer, (2023)Parameterized Complexity of Graph Planarity with Restricted Cyclic Orders., , и . WG, том 13453 из Lecture Notes in Computer Science, стр. 383-397. Springer, (2022)Evaluating Animation Parameters for Morphing Edge Drawings., , , и . GD (1), том 14465 из Lecture Notes in Computer Science, стр. 246-262. Springer, (2023)Pole Dancing: 3D Morphs for Tree Drawings., , , , , , , и . GD, том 11282 из Lecture Notes in Computer Science, стр. 371-384. Springer, (2018)Quasi-upward Planar Drawings with Minimum Curve Complexity., , , и . GD, том 12868 из Lecture Notes in Computer Science, стр. 195-209. Springer, (2021)Recognizing Map Graphs of Bounded Treewidth., , , , , и . SWAT, том 227 из LIPIcs, стр. 8:1-8:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)(k, p)-Planarity: A Relaxation of Hybrid Planarity., , , , и . WALCOM, том 11355 из Lecture Notes in Computer Science, стр. 148-159. Springer, (2019)Ortho-Polygon Visibility Representations of 3-Connected 1-Plane Graphs., , и . GD, том 11282 из Lecture Notes in Computer Science, стр. 524-537. Springer, (2018)