Dr. Lena Schlipf

Für eine vollständige Liste meiner Veröffentlichungen siehe:

Publikationen

Philipp Kindermann; Fabrizio Montecchiani; Lena Schlipf; André Schulz: Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles, in Journal of Graph Algorithms and Applications, Vol. 25, No. 1, pp. 1-28, 2021.
Boris Klemz; Linda Kleist; Anna Lubiw; Lena Schlipf; Frank Staals; Darren Strash: Convexity-Increasing Morphs of Planar Graphs, in Computational Geometry, 84, Seiten 69-88
Lena Schlipf; Jens M. Schmidt: Edge-Orders, in Algorithmica, 81(5), Seiten 1881-1900
Hee-Kap Ahn; Eunjin Oh; Lena Schlipf; Fabian Stehn; Darren Strash: On Romeo and Juliet Problems: Minimizing Distance to Sight, in Computational Geometry, 84, Seiten 12-21
Lena Schlipf; Jens M. Schmidt: Simple computation of st-edge- and st-numberings from ear decompositions, in Information Processing Letters, Vol. 145, 2019, pp. 58-63
Sergio Cabello; Otfried Cheong; Christian Knauer; Lena Schlipf: Finding largest rectangles in convex polygons, in Computational Geometry, Vol. 51, 2016, pp. 67-74
Valentin Polishchuk; Esther M. Arkin; Alon Efrat; Christian Knauer; Joseph S. B. Mitchell; Günter Rote; Lena Schlipf; Topi Talvitie: Shortest path to a segment and quickest visibility queries, in Journal of Computational Geometry, Vol. 7, No. 2, 2016, pp. 77-100

Alexander Pilz; Jonathan Rollin; Lena Schlipf; André Schulz: Augmenting Geometric Graphs with Matchings, in Graph Drawing and Network Visualization, 28th International Symposium, GD 2020, Vancouver, BC, Canada, pp. 490-504, September 16–18, 2020
Jonathan Rollin; Lena Schlipf; André Schulz: Recognizing Planar Laman Graphs, in Proceedings of the 27th Annual European Symposium on Algorithms (ESA'19), Seiten 79:1--79:12
Boris Klemz; Linda Kleist; Anna Lubiw; Lena Schlipf; Frank Staals; Darren Strash: Convexity-Increasing Morphs of Planar Graphs, in Proceedings of the 44th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'18), 2018
Philipp Kindermann; Fabrizio Montecchiani; Lena Schlipf; André Schulz: Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles, in Graph Drawing, Lecture Notes in Computer Science, Springer, Vol. 11282, 2018, pp. 152-166
Hee-Kap Ahn; Eunjin Oh; Lena Schlipf; Fabian Stehn; Darren Strash: On Romeo and Juliet Problems: Minimizing Distance-to-Sight, in Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT'18), 2018
Lena Schlipf; Jens. M. Schmidt: Edge-Orders, in Proceedings of the 44th International Colloquium on Automata, Languages and Programming (ICALP'17), 2017, pp. 75:1--75:14

Alexander Pilz; Jonathan Rollin; Lena Schlipf; André Schulz: Augmenting Polygons with Matchings, in Proceedings of the 36th European Workshop on Computational Geometry (EuroCG'20)
Jonathan Rollin; Lena Schlipf; André Schulz: Recognizing Planar Laman Graphs, in Proceedings of the 35th European Workshop on Computational Geometry (EuroCG’19)
Boris Klemz; Linda Kleist; Anna Lubiw; Lena Schlipf; Frank Staals; Darren Strash: Convexity-Increasing Morphs of Planar Graphs, in Proceedings of the 34th European Workshop on Computational Geometry (EuroCG’18), 2018, invited to the special issue of CGTA on EuroCG'18
Hee-Kap Ahn; Eunjin Oh; Lena Schlipf; Fabian Stehn; Darren Strash: On Romeo and Juliet Problems: Minimizing Distance-to-Sight, in Proceedings of the 34th European Workshop on Computational Geometry (EuroCG’18), 2018, invited to the special issue of CGTA on EuroCG'18

Christoph Doppelbauer | 12.08.2021