( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
How to Draw a Planarization.

, , и . SOFSEM, том 10139 из Lecture Notes in Computer Science, стр. 295-308. Springer, (2017)

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.

Ernst Radermacher

Ursula Radermacher

Friedhelm Radermacher

Elke Radermacher

Erwin Radermacher

 

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

Drawing Clustered Graphs on Disk Arrangements., , , и . WALCOM, том 11355 из Lecture Notes in Computer Science, стр. 160-171. Springer, (2019)Geometric Crossing-Minimization - A Scalable Randomized Approach., и . ESA, том 144 из LIPIcs, стр. 76:1-76:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)How to Draw a Planarization., , и . J. Graph Algorithms Appl., 23 (4): 653-682 (2019)Inserting an edge into a geometric embedding., и . Comput. Geom., (2022)Drawing Clustered Planar Graphs on Disk Arrangements., , , и . J. Graph Algorithms Appl., 24 (2): 105-131 (2020)Towards a Characterization of Stretchable Aligned Graphs., , и . GD, том 12590 из Lecture Notes in Computer Science, стр. 295-307. Springer, (2020)Multilevel Planarity., , , и . J. Graph Algorithms Appl., 25 (1): 151-170 (2021)Geometric Graph Drawing Algorithms - Theory, Engineering and Experiments. Karlsruhe University, Germany, (2020)base-search.net (ftubkarlsruhe:oai:EVASTAR-Karlsruhe.de:1000117664).Multilevel Planarity., , , и . CoRR, (2018)Geometric Heuristics for Rectilinear Crossing Minimization., , , и . ACM Journal of Experimental Algorithmics, 24 (1): 1.12:1-1.12:21 (2019)