( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Synchronized Planarity with Applications to Constrained Planarity Problems.

, , и . ESA, том 204 из LIPIcs, стр. 19:1-19:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)

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.

Ignaz Rutter

Alina Ignaz

Winfried Rütter

Gunter Rütter

Helmut Rütter

 

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

Inserting an edge into a geometric embedding., и . Comput. Geom., (2022)Experimental Comparison of PC-Trees and PQ-Trees., , и . ACM J. Exp. Algorithmics, (декабря 2023)Parameterized Complexity of Graph Planarity with Restricted Cyclic Orders., , и . WG, том 13453 из Lecture Notes in Computer Science, стр. 383-397. Springer, (2022)Graph Drawing Contest Report., , , и . GD, том 12590 из Lecture Notes in Computer Science, стр. 507-519. Springer, (2020)Computing Large Matchings Fast, и . Technical report, 2007-19. #UKA#, (2007)Simultaneous Representation of Proper and Unit Interval Graphs., , , и . ESA, том 144 из LIPIcs, стр. 80:1-80:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Geometric Crossing-Minimization - A Scalable Randomized Approach., и . ESA, том 144 из LIPIcs, стр. 76:1-76:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Extending Partial Representations of Circle Graphs in Near-Linear Time., , и . MFCS, том 241 из LIPIcs, стр. 25:1-25:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Evolutionary Computation Meets Graph Drawing: Runtime Analysis for Crossing Minimisation on Layered Graph Drawings., , и . GECCO, ACM, (2024)Graph Drawing Contest Report, , , и . Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD'17), том 10692 из Lecture Notes in Computer Science, стр. 575--582. Springer-Verlag, (сентября 2017)