default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLena Schlipf
Person information
- affiliation: University of Tübingen, Germany
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i14]Emilio Di Giacomo, Walter Didimo, Eleni Katsanou, Lena Schlipf, Antonios Symvonis, Alexander Wolff:
Minimum Monotone Spanning Trees. CoRR abs/2411.14038 (2024)- 2023
- [c15]Otfried Cheong
, Henry Förster, Julia Katheder, Maximilian Pfister, Lena Schlipf:
Weakly and Strongly Fan-Planar Graphs. GD (1) 2023: 53-68 - [c14]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: 209-221 - [i13]Otfried Cheong, Henry Förster, Julia Katheder, Maximilian Pfister, Lena Schlipf:
Weakly and Strongly Fan-Planar Graphs. CoRR abs/2308.08966 (2023) - 2022
- [c13]Maike Buchin, Ivor van der Hoog, Tim Ophelders, Lena Schlipf, Rodrigo I. Silveira, Frank Staals:
Efficient Fréchet Distance Queries for Segments. ESA 2022: 29:1-29:14 - [c12]Otfried Cheong, Maximilian Pfister, Lena Schlipf:
The Thickness of Fan-Planar Graphs is At Most Three. GD 2022: 247-260 - [i12]Maike Buchin, Ivor van der Hoog, Tim Ophelders, Lena Schlipf, Rodrigo I. Silveira, Frank Staals:
Efficient Fréchet distance queries for segments. CoRR abs/2203.01794 (2022) - [i11]Otfried Cheong, Maximilian Pfister, Lena Schlipf:
The thickness of fan-planar graphs is at most three. CoRR abs/2208.12324 (2022) - 2021
- [j11]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): 1-28 (2021) - [c11]Patrizio Angelini, Philipp Kindermann, Andre Löffler, Lena Schlipf, Antonios Symvonis:
One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons. GD 2021: 184-192 - [i10]Patrizio Angelini, Philipp Kindermann, Andre Löffler, Lena Schlipf, Antonios Symvonis:
One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons. CoRR abs/2108.12321 (2021) - 2020
- [c10]Alexander Pilz, Jonathan Rollin, Lena Schlipf, André Schulz:
Augmenting Geometric Graphs with Matchings. GD 2020: 490-504 - [i9]Alexander Pilz, Jonathan Rollin, Lena Schlipf, André Schulz:
Augmenting Geometric Graphs with Matchings. CoRR abs/2008.08413 (2020)
2010 – 2019
- 2019
- [j10]Lena Schlipf, Jens M. Schmidt:
Edge-Orders. Algorithmica 81(5): 1881-1900 (2019) - [j9]Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash:
On Romeo and Juliet problems: Minimizing distance-to-sight. Comput. Geom. 84: 12-21 (2019) - [j8]Linda Kleist, Boris Klemz, Anna Lubiw, Lena Schlipf, Frank Staals, Darren Strash:
Convexity-increasing morphs of planar graphs. Comput. Geom. 84: 69-88 (2019) - [j7]Lena Schlipf, Jens M. Schmidt:
Simple computation of st-edge- and st-numberings from ear decompositions. Inf. Process. Lett. 145: 58-63 (2019) - [c9]Jonathan Rollin, Lena Schlipf, André Schulz:
Recognizing Planar Laman Graphs. ESA 2019: 79:1-79:12 - [i8]Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash:
On Romeo and Juliet Problems: Minimizing Distance-to-Sight. CoRR abs/1906.01114 (2019) - 2018
- [c8]Philipp Kindermann, Fabrizio Montecchiani, Lena Schlipf, André Schulz:
Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles. GD 2018: 152-166 - [c7]Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash:
On Romeo and Juliet Problems: Minimizing Distance-to-Sight. SWAT 2018: 6:1-6:13 - [c6]Linda Kleist, Boris Klemz, Anna Lubiw, Lena Schlipf, Frank Staals, Darren Strash:
Convexity-Increasing Morphs of Planar Graphs. WG 2018: 318-330 - [i7]Linda Kleist, Boris Klemz, Anna Lubiw, Lena Schlipf, Frank Staals, Darren Strash:
Convexity-Increasing Morphs of Planar Graphs. CoRR abs/1802.06579 (2018) - [i6]Philipp Kindermann, Fabrizio Montecchiani, Lena Schlipf, André Schulz:
Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles. CoRR abs/1808.08496 (2018) - 2017
- [c5]Lena Schlipf, Jens M. Schmidt:
Edge-Orders. ICALP 2017: 75:1-75:14 - [i5]Philipp Kindermann, Lena Schlipf, André Schulz:
On Gallai's conjecture for series-parallel graphs and planar 3-trees. CoRR abs/1706.04130 (2017) - 2016
- [j6]Sergio Cabello, Otfried Cheong, Christian Knauer, Lena Schlipf:
Finding largest rectangles in convex polygons. Comput. Geom. 51: 67-74 (2016) - [j5]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): 77-100 (2016) - [i4]Lena Schlipf, Jens M. Schmidt:
Edge-Orders. CoRR abs/1607.04431 (2016) - 2015
- [c4]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: 658-673 - 2014
- [j4]Esther M. Arkin, Claudia Dieckmann, Christian Knauer, Joseph S. B. Mitchell, Valentin Polishchuk, Lena Schlipf, Shang Yang:
Convex transversals. Comput. Geom. 47(2): 224-239 (2014) - [i3]Sergio Cabello, Otfried Cheong, Lena Schlipf:
Finding Largest Rectangles in Convex Polygons. CoRR abs/1405.1223 (2014) - 2013
- [j3]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): 253-262 (2013) - 2012
- [j2]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): 27-44 (2012) - [j1]Christian Knauer, Lena Schlipf, Jens M. Schmidt, Hans Raj Tiwary:
Largest inscribed rectangles in convex polygons. J. Discrete Algorithms 13: 78-85 (2012) - [i2]Hee-Kap Ahn, Sang-Sub Kim, Christian Knauer, Lena Schlipf, Chan-Su Shin, Antoine Vigneron:
Covering and Piercing Disks with Two Centers. CoRR abs/1201.1198 (2012) - [i1]Lena Schlipf:
Notes on Convex Transversals. CoRR abs/1211.5107 (2012) - 2011
- [c3]Hee-Kap Ahn, Sang-Sub Kim, Christian Knauer, Lena Schlipf, Chan-Su Shin, Antoine Vigneron:
Covering and Piercing Disks with Two Centers. ISAAC 2011: 50-59 - [c2]Esther M. Arkin, Claudia Dieckmann, Christian Knauer, Joseph S. B. Mitchell, Valentin Polishchuk, Lena Schlipf, Shang Yang:
Convex Transversals. WADS 2011: 49-60 - 2010
- [c1]Hee-Kap Ahn, Christian Knauer, Marc Scherfenberg, Lena Schlipf, Antoine Vigneron:
Computing the Discrete Fréchet Distance with Imprecise Input. ISAAC (2) 2010: 422-433
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:54 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
