Lena Schlipf

Orcid: 0000-0001-7043-1867

Affiliations:
  • University of Tübingen, Germany


According to our database1, Lena Schlipf authored at least 23 papers between 2010 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Minimum Monotone Spanning Trees.
Proceedings of the SOFSEM 2025: Theory and Practice of Computer Science, 2025

Reconfiguration of Unit Squares and Disks: PSPACE-Hardness in Simple Settings.
Proceedings of the 41st International Symposium on Computational Geometry, 2025

2023
On the 2-Layer Window Width Minimization Problem.
Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

Weakly and Strongly Fan-Planar Graphs.
Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

2022
The Thickness of Fan-Planar Graphs is At Most Three.
Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022

Efficient Fréchet Distance Queries for Segments.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021
One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons.
Proceedings of the Graph Drawing and Network Visualization - 29th International Symposium, 2021

2020
Augmenting Geometric Graphs with Matchings.
Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

2019
Simple computation of st-edge- and st-numberings from ear decompositions.
Inf. Process. Lett., 2019

Recognizing Planar Laman Graphs.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018
Convexity-Increasing Morphs of Planar Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

On Romeo and Juliet Problems: Minimizing Distance-to-Sight.
Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles.
Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

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

Edge-Orders.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
Finding largest rectangles in convex polygons.
Comput. Geom., 2016

2015
Shortest Path to a Segment and Quickest Visibility Queries.
Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014
Finding Largest Rectangles in Convex Polygons.
CoRR, 2014

2012
Largest inscribed rectangles in convex polygons.
J. Discrete Algorithms, 2012

Notes on Convex Transversals
CoRR, 2012

2011
Convex Transversals.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Covering and Piercing Disks with Two Centers.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

2010
Computing the Discrete Fréchet Distance with Imprecise Input.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010


  Loading...