Lena Schlipf

Publication Activity (10 Years)

Years Active: 2010-2023
Publications (10 Years): 28

Top Topics

Convexity Properties

Top Venues

Publications

Michael A. Bekos, Henry Förster, Michael Kaufmann, Stephen G. Kobourov, Myroslav Kryven, Axel Kuckuk, Lena Schlipf
On the 2-Layer Window Width Minimization Problem. SOFSEM (2023)
Otfried Cheong, Henry Förster, Julia Katheder, Maximilian Pfister, Lena Schlipf
Weakly and Strongly Fan-Planar Graphs. CoRR (2023)
Otfried Cheong, Henry Förster, Julia Katheder, Maximilian Pfister, Lena Schlipf
Weakly and Strongly Fan-Planar Graphs. GD (1) (2023)
Maike Buchin, Ivor van der Hoog, Tim Ophelders, Lena Schlipf, Rodrigo I. Silveira, Frank Staals
Efficient Fréchet distance queries for segments. CoRR (2022)
Otfried Cheong, Maximilian Pfister, Lena Schlipf
The thickness of fan-planar graphs is at most three. CoRR (2022)
Otfried Cheong, Maximilian Pfister, Lena Schlipf
The Thickness of Fan-Planar Graphs is At Most Three. GD (2022)
Maike Buchin, Ivor van der Hoog, Tim Ophelders, Lena Schlipf, Rodrigo I. Silveira, Frank Staals
Efficient Fréchet Distance Queries for Segments. ESA (2022)
Philipp Kindermann, Fabrizio Montecchiani, Lena Schlipf, André Schulz
Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles. J. Graph Algorithms Appl. 25 (1) (2021)
Patrizio Angelini, Philipp Kindermann, Andre Löffler, Lena Schlipf, Antonios Symvonis
One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons. CoRR (2021)
Patrizio Angelini, Philipp Kindermann, Andre Löffler, Lena Schlipf, Antonios Symvonis
One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons. Graph Drawing (2021)
Alexander Pilz, Jonathan Rollin, Lena Schlipf, André Schulz
Augmenting Geometric Graphs with Matchings. CoRR (2020)
Alexander Pilz, Jonathan Rollin, Lena Schlipf, André Schulz
Augmenting Geometric Graphs with Matchings. Graph Drawing (2020)
Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash
On Romeo and Juliet Problems: Minimizing Distance-to-Sight. CoRR (2019)
Jonathan Rollin, Lena Schlipf, André Schulz
Recognizing Planar Laman Graphs. ESA (2019)
Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash
On Romeo and Juliet problems: Minimizing distance-to-sight. Comput. Geom. 84 (2019)
Lena Schlipf, Jens M. Schmidt
Edge-Orders. Algorithmica 81 (5) (2019)
Lena Schlipf, Jens M. Schmidt
Simple computation of st-edge- and st-numberings from ear decompositions. Inf. Process. Lett. 145 (2019)
Linda Kleist, Boris Klemz, Anna Lubiw, Lena Schlipf, Frank Staals, Darren Strash
Convexity-increasing morphs of planar graphs. Comput. Geom. 84 (2019)
Linda Kleist, Boris Klemz, Anna Lubiw, Lena Schlipf, Frank Staals, Darren Strash
Convexity-Increasing Morphs of Planar Graphs. WG (2018)
Linda Kleist, Boris Klemz, Anna Lubiw, Lena Schlipf, Frank Staals, Darren Strash
Convexity-Increasing Morphs of Planar Graphs. CoRR (2018)
Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash
On Romeo and Juliet Problems: Minimizing Distance-to-Sight. SWAT (2018)
Philipp Kindermann, Fabrizio Montecchiani, Lena Schlipf, André Schulz
Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles. Graph Drawing (2018)
Philipp Kindermann, Fabrizio Montecchiani, Lena Schlipf, André Schulz
Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles. CoRR (2018)
Lena Schlipf, Jens M. Schmidt
Edge-Orders. ICALP (2017)
Philipp Kindermann, Lena Schlipf, André Schulz
On Gallai's conjecture for series-parallel graphs and planar 3-trees. CoRR (2017)
Sergio Cabello, Otfried Cheong, Christian Knauer, Lena Schlipf
Finding largest rectangles in convex polygons. Comput. Geom. 51 (2016)
Lena Schlipf, Jens M. Schmidt
Edge-Orders. CoRR (2016)
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. J. Comput. Geom. 7 (2) (2016)
Esther M. Arkin, Alon Efrat, Christian Knauer, Joseph S. B. Mitchell, Valentin Polishchuk, Günter Rote, Lena Schlipf, Topi Talvitie
Shortest Path to a Segment and Quickest Visibility Queries. SoCG (2015)
Esther M. Arkin, Claudia Dieckmann, Christian Knauer, Joseph S. B. Mitchell, Valentin Polishchuk, Lena Schlipf, Shang Yang
Convex transversals. Comput. Geom. 47 (2) (2014)
Sergio Cabello, Otfried Cheong, Lena Schlipf
Finding Largest Rectangles in Convex Polygons. CoRR (2014)
Hee-Kap Ahn, Sang-Sub Kim, Christian Knauer, Lena Schlipf, Chan-Su Shin, Antoine Vigneron
Covering and piercing disks with two centers. Comput. Geom. 46 (3) (2013)
Lena Schlipf
Notes on Convex Transversals CoRR (2012)
Hee-Kap Ahn, Christian Knauer, Marc Scherfenberg, Lena Schlipf, Antoine Vigneron
Computing the Discrete FRéChet Distance with Imprecise Input. Int. J. Comput. Geom. Appl. 22 (1) (2012)
Hee-Kap Ahn, Sang-Sub Kim, Christian Knauer, Lena Schlipf, Chan-Su Shin, Antoine Vigneron
Covering and Piercing Disks with Two Centers CoRR (2012)
Christian Knauer, Lena Schlipf, Jens M. Schmidt, Hans Raj Tiwary
Largest inscribed rectangles in convex polygons. J. Discrete Algorithms 13 (2012)
Hee-Kap Ahn, Sang-Sub Kim, Christian Knauer, Lena Schlipf, Chan-Su Shin, Antoine Vigneron
Covering and Piercing Disks with Two Centers. ISAAC (2011)
Esther M. Arkin, Claudia Dieckmann, Christian Knauer, Joseph S. B. Mitchell, Valentin Polishchuk, Lena Schlipf, Shang Yang
Convex Transversals. WADS (2011)
Hee-Kap Ahn, Christian Knauer, Marc Scherfenberg, Lena Schlipf, Antoine Vigneron
Computing the Discrete Fréchet Distance with Imprecise Input. ISAAC (2) (2010)