Lena Schlipf

According to our database, Lena Schlipf authored at least 21 papers between 2012 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

On the 2-Layer Window Width Minimization Problem.

Michael A. Bekos, Henry Förster, Michael Kaufmann, Stephen G. Kobourov, Myroslav Kryven, Axel Kuckuk, Lena Schlipf

Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

Weakly and Strongly Fan-Planar Graphs.

Otfried Cheong, Henry Förster, Julia Katheder, Maximilian Pfister, Lena Schlipf

Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

2022

The Thickness of Fan-Planar Graphs is At Most Three.

Otfried Cheong, Maximilian Pfister, Lena Schlipf

Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022

Efficient Fréchet Distance Queries for Segments.

Maike Buchin, Ivor van der Hoog, Tim Ophelders, Lena Schlipf, Rodrigo I. Silveira, Frank Staals

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles.

Philipp Kindermann, Fabrizio Montecchiani, Lena Schlipf, André Schulz

J. Graph Algorithms Appl., 2021

One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons.

Patrizio Angelini, Philipp Kindermann, Andre Löffler, Lena Schlipf, Antonios Symvonis

Proceedings of the Graph Drawing and Network Visualization - 29th International Symposium, 2021

2020

Augmenting Geometric Graphs with Matchings.

Alexander Pilz, Jonathan Rollin, Lena Schlipf, André Schulz

Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

2019

Simple computation of st-edge- and st-numberings from ear decompositions.

Lena Schlipf, Jens M. Schmidt

Inf. Process. Lett., 2019

Convexity-increasing morphs of planar graphs.

Linda Kleist, Boris Klemz, Anna Lubiw, Lena Schlipf, Frank Staals, Darren Strash

Comput. Geom., 2019

On Romeo and Juliet problems: Minimizing distance-to-sight.

Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash

Comput. Geom., 2019

Edge-Orders.

Lena Schlipf, Jens M. Schmidt

Algorithmica, 2019

Recognizing Planar Laman Graphs.

Jonathan Rollin, Lena Schlipf, André Schulz

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2017

On Gallai's conjecture for series-parallel graphs and planar 3-trees.

Philipp Kindermann, Lena Schlipf, André Schulz

CoRR, 2017

2016

Shortest path to a segment and quickest visibility queries.

Valentin Polishchuk, Esther M. Arkin, Alon Efrat, Christian Knauer, Joseph S. B. Mitchell, Günter Rote, Lena Schlipf, Topi Talvitie

J. Comput. Geom., 2016

Finding largest rectangles in convex polygons.

Sergio Cabello, Otfried Cheong, Christian Knauer, Lena Schlipf

Comput. Geom., 2016

2014

Finding Largest Rectangles in Convex Polygons.

Sergio Cabello, Otfried Cheong, Lena Schlipf

CoRR, 2014

Convex transversals.

Esther M. Arkin, Claudia Dieckmann, Christian Knauer, Joseph S. B. Mitchell, Valentin Polishchuk, Lena Schlipf, Shang Yang

Comput. Geom., 2014

2013

Covering and piercing disks with two centers.

Hee-Kap Ahn, Sang-Sub Kim, Christian Knauer, Lena Schlipf, Chan-Su Shin, Antoine Vigneron

Comput. Geom., 2013

2012

Largest inscribed rectangles in convex polygons.

Christian Knauer, Lena Schlipf, Jens M. Schmidt, Hans Raj Tiwary

J. Discrete Algorithms, 2012

Computing the Discrete FRéChet Distance with Imprecise Input.

Hee-Kap Ahn, Christian Knauer, Marc Scherfenberg, Lena Schlipf, Antoine Vigneron

Int. J. Comput. Geom. Appl., 2012

Notes on Convex Transversals

Lena Schlipf

CoRR, 2012