Author of the publication

Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs.

, , , , , and . WALCOM, volume 10167 of Lecture Notes in Computer Science, page 204-216. 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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Infinite All-Layers Simple Foldability., , , , , and . Graphs Comb., 36 (2): 231-244 (2020)Reconfiguration of connected graph partitions., , , , , , , , and . J. Graph Theory, 102 (1): 35-66 (2023)Folding polyominoes with holes into a cube, , , , , , , , , and 1 other author(s). Computational Geometry, (2021)Realizability of Free Spaces of Curves., , , , and . ISAAC, volume 283 of LIPIcs, page 3:1-3:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Distance Measures for Embedded Graphs., , , , and . ISAAC, volume 149 of LIPIcs, page 55:1-55:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Snipperclips: Cutting Tools into Desired Polygons using Themselves., , , , , , , , , and . CoRR, (2021)Characterizing Universal Reconfigurability of Modular Pivoting Robots., , , , , , , , , and . CoRR, (2020)Maximum Area Axis-Aligned Square Packings., , , and . MFCS, volume 117 of LIPIcs, page 77:1-77:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Upward Partitioned Book Embeddings., , , and . GD, volume 10692 of Lecture Notes in Computer Science, page 210-223. Springer, (2017)Pushing Blocks by Sweeping Lines., , and . FUN, volume 226 of LIPIcs, page 1:1-1:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)