( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Crossing-Optimal Extension of Simple Drawings.

, , , , и . CoRR, (2020)

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.

Dirk Klute

Max Klute

Andreas Klute

Wilhelm Klute

Wolfgang Klute

 

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

Crossing-Optimal Extension of Simple Drawings., , , , и . CoRR, (2020)On Strict (Outer-)Confluent Graphs., , , и . GD, том 11904 из Lecture Notes in Computer Science, стр. 147-161. Springer, (2019)On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem., , и . STACS, том 96 из LIPIcs, стр. 33:1-33:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Extending Partial 1-Planar Drawings., , , , и . ICALP, том 168 из LIPIcs, стр. 43:1-43:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Four Pages Are Indeed Necessary for Planar Graphs., , , , , и . CoRR, (2020)On Fully Diverse Sets of Geometric Objects and Graphs., и . WG, том 13453 из Lecture Notes in Computer Science, стр. 328-341. Springer, (2022)Crossing-Optimal Extension of Simple Drawings., , , , и . ICALP, том 198 из LIPIcs, стр. 72:1-72:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Maximizing Ink in Partial Edge Drawings of k-plane Graphs., , , и . GD, том 11904 из Lecture Notes in Computer Science, стр. 323-336. Springer, (2019)Mixed Linear Layouts: Complexity, Heuristics, and Experiments., , и . GD, том 11904 из Lecture Notes in Computer Science, стр. 460-467. Springer, (2019)Finding Large Matchings in 1-Planar Graphs of Minimum Degree 3., и . WG, том 12301 из Lecture Notes in Computer Science, стр. 248-260. Springer, (2020)