( en | de | ru )

 

Disambiguation of "Klute, Fabian"

Author of the publication

copydeleteadd this publication to your clipboard
Extending Partial 1-Planar Drawings.

, , , , and . ICALP, volume 168 of LIPIcs, page 43:1-43:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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. You can also use the button next to the name to display some publications already assigned to the person.

Dirk Klute

Andreas Klute

Max Klute

Wilhelm Klute

Wolfgang Klute

 

Other publications of authors with the same name

On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem., , and . STACS, volume 96 of LIPIcs, page 33:1-33:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)On Strict (Outer-)Confluent Graphs., , , and . GD, volume 11904 of Lecture Notes in Computer Science, page 147-161. Springer, (2019)Crossing-Optimal Extension of Simple Drawings., , , , and . CoRR, (2020)Extending Partial 1-Planar Drawings., , , , and . ICALP, volume 168 of LIPIcs, page 43:1-43:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Inserting One Edge into a Simple Drawing Is Hard., , , , , and . WG, volume 12301 of Lecture Notes in Computer Science, page 325-338. Springer, (2020)Labeling nonograms: Boundary labeling for curve arrangements., , and . Comput. Geom., (2021)Saturated k-Plane Drawings with Few Edges., and . CoRR, (2020)Exploring Semi-Automatic Map Labeling., , , , and . SIGSPATIAL/GIS, page 13-22. ACM, (2019)Extending Nearly Complete 1-Planar Drawings in Polynomial Time., , , , and . MFCS, volume 170 of LIPIcs, page 31:1-31:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Minimum Link Fencing., , , , , and . ISAAC, volume 248 of LIPIcs, page 34:1-34:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)