Lena Schlipf - RankMe

46 papers A* 3A 7B 5Journal 27Unranked 4

Year	Rank	Type	Title / Venue / Authors
2026	B	`conf`	On Compaction and Realizability of Almost Convex Octilinear Representations. WALCOM Henry Förster, Giacomo Ortali, Lena Schlipf
2025	—	`conf`	Minimum Monotone Spanning Trees. SOFSEM (1) Emilio Di Giacomo, Walter Didimo, Eleni Katsanou, Lena Schlipf, Antonios Symvonis, Alexander Wolff
2025	J	`jnl`	On Compaction and Realizability of Almost Convex Octilinear Representations. CoRR Henry Förster, Giacomo Ortali, Lena Schlipf
2025	A	`conf`	Reconfiguration in Curve Arrangements to Reduce Self-Intersections and Popular Faces. GD Florestan Brunck, Hsien-Chih Chang, Maarten Löffler, Tim Ophelders, Lena Schlipf
2025	A*	`conf`	Reconfiguration of Unit Squares and Disks: PSPACE-Hardness in Simple Settings. SoCG Mikkel Abrahamsen, Kevin Buchin, Maike Buchin, Linda Kleist, Maarten Löffler, Lena Schlipf, André Schulz, Jack Stade
2024	J	`jnl`	Minimum Monotone Spanning Trees. CoRR Emilio Di Giacomo, Walter Didimo, Eleni Katsanou, Lena Schlipf, Antonios Symvonis, Alexander Wolff
2024	J	`jnl`	Reconfiguration of unit squares and disks: PSPACE-hardness in simple settings. CoRR Mikkel Abrahamsen, Kevin Buchin, Maike Buchin, Linda Kleist, Maarten Löffler, Lena Schlipf, André Schulz, Jack Stade
2023	B	`conf`	On the 2-Layer Window Width Minimization Problem. SOFSEM Michael A. Bekos, Henry Förster, Michael Kaufmann, Stephen G. Kobourov, Myroslav Kryven, Axel Kuckuk, Lena Schlipf
2023	—	`conf`	Weakly and Strongly Fan-Planar Graphs. GD (1) Otfried Cheong, Henry Förster, Julia Katheder, Maximilian Pfister, Lena Schlipf
2023	J	`jnl`	Weakly and Strongly Fan-Planar Graphs. CoRR Otfried Cheong, Henry Förster, Julia Katheder, Maximilian Pfister, Lena Schlipf
2022	A	`conf`	Efficient Fréchet Distance Queries for Segments. ESA Maike Buchin, Ivor van der Hoog, Tim Ophelders, Lena Schlipf, Rodrigo I. Silveira, Frank Staals
2022	J	`jnl`	Efficient Fréchet distance queries for segments. CoRR Maike Buchin, Ivor van der Hoog, Tim Ophelders, Lena Schlipf, Rodrigo I. Silveira, Frank Staals
2022	A	`conf`	The Thickness of Fan-Planar Graphs is At Most Three. GD Otfried Cheong, Maximilian Pfister, Lena Schlipf
2022	J	`jnl`	The thickness of fan-planar graphs is at most three. CoRR Otfried Cheong, Maximilian Pfister, Lena Schlipf
2021	J	`jnl`	Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles. J. Graph Algorithms Appl. Philipp Kindermann, Fabrizio Montecchiani, Lena Schlipf, André Schulz
2021	A	`conf`	One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons. GD Patrizio Angelini, Philipp Kindermann, Andre Löffler, Lena Schlipf, Antonios Symvonis
2021	J	`jnl`	One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons. CoRR Patrizio Angelini, Philipp Kindermann, Andre Löffler, Lena Schlipf, Antonios Symvonis
2020	A	`conf`	Augmenting Geometric Graphs with Matchings. GD Alexander Pilz, Jonathan Rollin, Lena Schlipf, André Schulz
2020	J	`jnl`	Augmenting Geometric Graphs with Matchings. CoRR Alexander Pilz, Jonathan Rollin, Lena Schlipf, André Schulz
2019	J	`jnl`	Convexity-increasing morphs of planar graphs. Comput. Geom. Linda Kleist, Boris Klemz, Anna Lubiw, Lena Schlipf, Frank Staals, Darren Strash
2019	J	`jnl`	Edge-Orders. Algorithmica Lena Schlipf, Jens M. Schmidt
2019	J	`jnl`	On Romeo and Juliet Problems: Minimizing Distance-to-Sight. CoRR Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash
2019	J	`jnl`	On Romeo and Juliet problems: Minimizing distance-to-sight. Comput. Geom. Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash
2019	A	`conf`	Recognizing Planar Laman Graphs. ESA Jonathan Rollin, Lena Schlipf, André Schulz
2019	J	`jnl`	Simple computation of st-edge- and st-numberings from ear decompositions. Inf. Process. Lett. Lena Schlipf, Jens M. Schmidt
2018	B	`conf`	Convexity-Increasing Morphs of Planar Graphs. WG Linda Kleist, Boris Klemz, Anna Lubiw, Lena Schlipf, Frank Staals, Darren Strash
2018	J	`jnl`	Convexity-Increasing Morphs of Planar Graphs. CoRR Linda Kleist, Boris Klemz, Anna Lubiw, Lena Schlipf, Frank Staals, Darren Strash
2018	A	`conf`	Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles. GD Philipp Kindermann, Fabrizio Montecchiani, Lena Schlipf, André Schulz
2018	J	`jnl`	Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles. CoRR Philipp Kindermann, Fabrizio Montecchiani, Lena Schlipf, André Schulz
2018	—	`conf`	On Romeo and Juliet Problems: Minimizing Distance-to-Sight. SWAT Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash
2017	A*	`conf`	Edge-Orders. ICALP Lena Schlipf, Jens M. Schmidt
2017	J	`jnl`	On Gallai's conjecture for series-parallel graphs and planar 3-trees. CoRR Philipp Kindermann, Lena Schlipf, André Schulz
2016	J	`jnl`	Edge-Orders. CoRR Lena Schlipf, Jens M. Schmidt
2016	J	`jnl`	Finding largest rectangles in convex polygons. Comput. Geom. Sergio Cabello, Otfried Cheong, Christian Knauer, Lena Schlipf
2016	J	`jnl`	Shortest path to a segment and quickest visibility queries. J. Comput. Geom. Valentin Polishchuk, Esther M. Arkin, Alon Efrat, Christian Knauer, Joseph S. B. Mitchell, Günter Rote, Lena Schlipf, Topi Talvitie
2015	A*	`conf`	Shortest Path to a Segment and Quickest Visibility Queries. SoCG Esther M. Arkin, Alon Efrat, Christian Knauer, Joseph S. B. Mitchell, Valentin Polishchuk, Günter Rote, Lena Schlipf, Topi Talvitie
2014	J	`jnl`	Convex transversals. Comput. Geom. Esther M. Arkin, Claudia Dieckmann, Christian Knauer, Joseph S. B. Mitchell, Valentin Polishchuk, Lena Schlipf, Shang Yang
2014	J	`jnl`	Finding Largest Rectangles in Convex Polygons. CoRR Sergio Cabello, Otfried Cheong, Lena Schlipf
2013	J	`jnl`	Covering and piercing disks with two centers. Comput. Geom. Hee-Kap Ahn, Sang-Sub Kim, Christian Knauer, Lena Schlipf, Chan-Su Shin, Antoine Vigneron
2012	J	`jnl`	Computing the Discrete FRéChet Distance with Imprecise Input. Int. J. Comput. Geom. Appl. Hee-Kap Ahn, Christian Knauer, Marc Scherfenberg, Lena Schlipf, Antoine Vigneron
2012	J	`jnl`	Covering and Piercing Disks with Two Centers CoRR Hee-Kap Ahn, Sang-Sub Kim, Christian Knauer, Lena Schlipf, Chan-Su Shin, Antoine Vigneron
2012	J	`jnl`	Largest inscribed rectangles in convex polygons. J. Discrete Algorithms Christian Knauer, Lena Schlipf, Jens M. Schmidt, Hans Raj Tiwary
2012	J	`jnl`	Notes on Convex Transversals CoRR Lena Schlipf
2011	B	`conf`	Convex Transversals. WADS Esther M. Arkin, Claudia Dieckmann, Christian Knauer, Joseph S. B. Mitchell, Valentin Polishchuk, Lena Schlipf, Shang Yang
2011	B	`conf`	Covering and Piercing Disks with Two Centers. ISAAC Hee-Kap Ahn, Sang-Sub Kim, Christian Knauer, Lena Schlipf, Chan-Su Shin, Antoine Vigneron
2010	—	`conf`	Computing the Discrete Fréchet Distance with Imprecise Input. ISAAC (2) Hee-Kap Ahn, Christian Knauer, Marc Scherfenberg, Lena Schlipf, Antoine Vigneron