( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Simplifying Non-Simple Fan-Planar Drawings.

, , , и . J. Graph Algorithms Appl., 27 (2): 147-172 (2023)

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.

Knorr

Eduard Knorr

Klaus Knorr

Herbert Knorr

Fritz Knorr

 

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

Nearest-Neighbor Decompositions of Drawings., , , , , и . SWAT, том 227 из LIPIcs, стр. 21:1-21:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Simplifying Non-Simple Fan-Planar Drawings., , , и . J. Graph Algorithms Appl., 27 (2): 147-172 (2023)On the Maximum Number of Crossings in Star-Simple Drawings of $K_n$ with No Empty Lens., , , , и . J. Graph Algorithms Appl., 26 (3): 381-399 (2022)Dynamic Connectivity in Disk Graphs., , , , , , и . CoRR, (2021)On the Maximum Number of Crossings in Star-Simple Drawings of Kn with No Empty Lens., , , и . GD, том 12590 из Lecture Notes in Computer Science, стр. 382-389. Springer, (2020)Dynamic Connectivity in Disk Graphs., , , , , , и . Discret. Comput. Geom., 71 (1): 214-277 (января 2024)The Density Formula: One Lemma to Bound Them All., , , , , и . CoRR, (2023)Flipping Plane Spanning Paths., , , , , , , и . CoRR, (2022)Insertion-Only Dynamic Connectivity in General Disk Graphs., , , , и . CoRR, (2023)Dynamic Connectivity in Disk Graphs., , , , , , и . SoCG, том 224 из LIPIcs, стр. 49:1-49:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)