Notes on Convex Transversals - Lena Schlipf (CoRR, 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)

Largest inscribed rectangles in convex polygons. - Christian Knauer; Lena Schlipf; Jens M. Schmidt; Hans Raj Tiwary (J. Discrete Algorithms, 2012)

Covering and piercing disks with two centers. - Hee-Kap Ahn; Sang-Sub Kim 001; Christian Knauer; Lena Schlipf; Chan-Su Shin; Antoine Vigneron (Comput. Geom., 2013)

Convex transversals. - Esther M. Arkin; Claudia Dieckmann; Christian Knauer; Joseph S. B. Mitchell; Valentin Polishchuk; Lena Schlipf; Shang Yang (Comput. Geom., 2014)

Finding Largest Rectangles in Convex Polygons. - Sergio Cabello; Otfried Cheong; Lena Schlipf (CoRR, 2014)

Finding largest rectangles in convex polygons. - Sergio Cabello; Otfried Cheong; Christian Knauer; Lena Schlipf (Comput. Geom., 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)

On Gallai's conjecture for series-parallel graphs and planar 3-trees. - Philipp Kindermann; Lena Schlipf; André Schulz 001 (CoRR, 2017)

Recognizing Planar Laman Graphs. - Jonathan Rollin; Lena Schlipf; André Schulz 001 (ESA, 2019)

Edge-Orders. - Lena Schlipf; Jens M. Schmidt (Algorithmica, 2019)

On Romeo and Juliet problems: Minimizing distance-to-sight. - Hee-Kap Ahn; Eunjin Oh 001; Lena Schlipf; Fabian Stehn; Darren Strash (Comput. Geom., 2019)

Convexity-increasing morphs of planar graphs. - Linda Kleist; Boris Klemz; Anna Lubiw; Lena Schlipf; Frank Staals; Darren Strash (Comput. Geom., 2019)

Simple computation of st-edge- and st-numberings from ear decompositions. - Lena Schlipf; Jens M. Schmidt (Inf. Process. Lett., 2019)

Augmenting Geometric Graphs with Matchings. - Alexander Pilz; Jonathan Rollin; Lena Schlipf; André Schulz 001 (GD, 2020)

One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons. - Patrizio Angelini; Philipp Kindermann; Andre Löffler; Lena Schlipf; Antonios Symvonis (GD, 2021)

Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles. - Philipp Kindermann; Fabrizio Montecchiani; Lena Schlipf; André Schulz 001 (J. Graph Algorithms Appl., 2021)

Efficient Fréchet Distance Queries for Segments. - Maike Buchin; Ivor van der Hoog; Tim Ophelders; Lena Schlipf; Rodrigo I. Silveira; Frank Staals (ESA, 2022)

The Thickness of Fan-Planar Graphs is At Most Three. - Otfried Cheong; Maximilian Pfister 002; Lena Schlipf (GD, 2022)

Weakly and Strongly Fan-Planar Graphs. - Otfried Cheong; Henry Förster; Julia Katheder; Maximilian Pfister 002; Lena Schlipf (GD (1), 2023)

On the 2-Layer Window Width Minimization Problem. - Michael A. Bekos; Henry Förster; Michael Kaufmann 001; Stephen G. Kobourov; Myroslav Kryven; Axel Kuckuk; Lena Schlipf (SOFSEM, 2023)

Reconfiguration of Unit Squares and Disks: PSPACE-Hardness in Simple Settings. - Mikkel Abrahamsen; Kevin Buchin; Maike Buchin; Linda Kleist; Maarten Löffler; Lena Schlipf; André Schulz 001; Jack Stade (SoCG, 2025)

Minimum Monotone Spanning Trees. - Emilio Di Giacomo; Walter Didimo; Eleni Katsanou; Lena Schlipf; Antonios Symvonis; Alexander Wolff 001 (SOFSEM (1), 2025)