Lena Schlipf

Available identifiers

zbMath Open schlipf.lenaWikidataQ102412244 ScholiaQ102412244MaRDI QIDQ390127

List of research outcomes

Publication	Date of Publication	Type
Weakly and Strongly Fan-Planar Graphs	2023-08-17	Paper
The thickness of fan-planar graphs is at most three	2023-08-16	Paper
One-bend drawings of outerplanar graphs inside simple polygons	2022-07-01	Paper
https://portal.mardi4nfdi.de/entity/Q5075827	2022-05-11	Paper
Augmenting Geometric Graphs with Matchings	2021-12-01	Paper
Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles	2021-01-19	Paper
On Romeo and Juliet Problems: Minimizing Distance-to-Sight.	2020-08-25	Paper
https://portal.mardi4nfdi.de/entity/Q5111406	2020-05-27	Paper
Convexity-increasing morphs of planar graphs	2019-10-25	Paper
On Romeo and Juliet problems: minimizing distance-to-sight	2019-10-25	Paper
Edge-orders	2019-05-07	Paper
Simple computation of \textit{st}-edge- and \textit{st}-numberings from ear decompositions	2019-03-11	Paper
Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles	2019-02-15	Paper
Convexity-increasing morphs of planar graphs	2018-11-22	Paper
Shortest path to a segment and quickest visibility queries	2017-10-10	Paper
On Gallai's conjecture for series-parallel graphs and planar 3-trees	2017-06-13	Paper
Shortest path to a segment and quickest visibility queries	2017-03-30	Paper
Finding largest rectangles in convex polygons	2016-01-18	Paper
Convex transversals	2014-01-22	Paper
Covering and piercing disks with two centers	2013-01-25	Paper
COMPUTING THE DISCRETE FRÉCHET DISTANCE WITH IMPRECISE INPUT	2012-11-23	Paper
Largest inscribed rectangles in convex polygons	2012-09-13	Paper
Covering and Piercing Disks with Two Centers	2011-12-16	Paper
Convex transversals	2011-08-12	Paper
Computing the discrete Fréchet distance with imprecise input	2010-12-09	Paper

Research outcomes over time

This page was built for person: Lena Schlipf