Lena Schlipf

Follow

Generating author description...

All published works
Action Title Year Authors
+ PDF Chat Reconfiguration of unit squares and disks: PSPACE-hardness in simple settings 2024 Mikkel Abrahamsen
Kevin Buchin
Maike Buchin
Linda Kleist
Maarten Löffler
Lena Schlipf
André Schulz
Jack Stade
+ PDF Chat Minimum Monotone Spanning Trees 2024 Emilio Di Giacomo
Walter Didimo
Eleni Katsanou
Lena Schlipf
Antonios Symvonis
Alexander Wolff
+ PDF Chat The Thickness of Fan-Planar Graphs is At Most Three 2023 Otfried Cheong
Maximilian Pfister
Lena Schlipf
+ Weakly and Strongly Fan-Planar Graphs 2023 Otfried Cheong
Henry Förster
Julia Katheder
Maximilian Pfister
Lena Schlipf
+ Efficient Fréchet distance queries for segments 2022 Maike Buchin
Ivor van der Hoog
Tim Ophelders
Lena Schlipf
Rodrigo I. Silveira
Frank Staals
+ The thickness of fan-planar graphs is at most three 2022 Otfried Cheong
Maximilian Pfister
Lena Schlipf
+ Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles 2021 Philipp Kindermann
Fabrizio Montecchiani
Lena Schlipf
André Schulz
+ PDF Chat One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons 2021 Patrizio Angelini
Philipp Kindermann
Andre Löffler
Lena Schlipf
Antonios Symvonis
+ One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons 2021 Patrizio Angelini
Philipp Kindermann
Andre Löffler
Lena Schlipf
Antonios Symvonis
+ Augmenting Geometric Graphs with Matchings 2020 Alexander Pilz
Jonathan Rollin
Lena Schlipf
André Schulz
+ PDF Chat Augmenting Geometric Graphs with Matchings 2020 Alexander Pilz
Jonathan Rollin
Lena Schlipf
André Schulz
+ Augmenting Geometric Graphs with Matchings 2020 Alexander Pilz
Jonathan Rollin
Lena Schlipf
André Schulz
+ Convexity-increasing morphs of planar graphs 2019 Linda Kleist
Boris Klemz
Anna Lubiw
Lena Schlipf
Frank Staals
Darren Strash
+ On Romeo and Juliet problems: Minimizing distance-to-sight 2019 Hee-Kap Ahn
Eunjin Oh
Lena Schlipf
Fabian Stehn
Darren Strash
+ On Romeo and Juliet Problems: Minimizing Distance-to-Sight 2019 Hee-Kap Ahn
Eunjin Oh
Lena Schlipf
Fabian Stehn
Darren Strash
+ On Romeo and Juliet Problems: Minimizing Distance-to-Sight 2019 Hee-Kap Ahn
Eunjin Oh
Lena Schlipf
Fabian Stehn
Darren Strash
+ Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles 2018 Philipp Kindermann
Fabrizio Montecchiani
Lena Schlipf
André Schulz
+ Convexity-Increasing Morphs of Planar Graphs 2018 Linda Kleist
Boris Klemz
Anna Lubiw
Lena Schlipf
Frank Staals
Darren Strash
+ PDF Chat Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles 2018 Philipp Kindermann
Fabrizio Montecchiani
Lena Schlipf
André Schulz
+ PDF Chat Convexity-Increasing Morphs of Planar Graphs 2018 Linda Kleist
Boris Klemz
Anna Lubiw
Lena Schlipf
Frank Staals
Darren Strash
+ Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles 2018 Philipp Kindermann
Fabrizio Montecchiani
Lena Schlipf
André Schulz
+ Convexity-Increasing Morphs of Planar Graphs 2018 Linda Kleist
Boris Klemz
Anna Lubiw
Lena Schlipf
Frank Staals
Darren Strash
+ On Gallai's conjecture for series-parallel graphs and planar 3-trees 2017 Philipp Kindermann
Lena Schlipf
André Schulz
+ Edge-Orders 2016 Lena Schlipf
Jens M. Schmidt
+ PDF Chat Finding largest rectangles in convex polygons 2015 Sergio Cabello
Otfried Cheong
Christian Knauer
Lena Schlipf
+ Finding Largest Rectangles in Convex Polygons 2014 Sergio Cabello
Otfried Cheong
Christian Knauer
Lena Schlipf
+ Stabbing and Covering Geometric Objects in the Plane 2014 Lena Schlipf
+ Finding Largest Rectangles in Convex Polygons 2014 Sergio Cabello
Otfried Cheong
Christian Knauer
Lena Schlipf
+ Convex transversals 2012 Esther M. Arkin
Claudia Dieckmann
Christian Knauer
Joseph S. B. Mitchell
Valentin Polishchuk
Lena Schlipf
Shang Yang
+ Covering and piercing disks with two centers 2012 Hee-Kap Ahn
Sang-Sub Kim
Christian Knauer
Lena Schlipf
Chan-Su Shin
Antoine Vigneron
+ Covering and Piercing Disks with Two Centers 2012 Hee-Kap Ahn
Sang-Sub Kim
Christian Knauer
Lena Schlipf
Chan-Su Shin
Antoine Vigneron
+ Notes on Convex Transversals 2012 Lena Schlipf
+ Covering and Piercing Disks with Two Centers 2012 Hee-Kap Ahn
Sang-Sub Kim
Christian Knauer
Lena Schlipf
Chan-Su Shin
Antoine Vigneron
+ PDF Chat Covering and Piercing Disks with Two Centers 2011 Hee-Kap Ahn
Sang-Sub Kim
Christian Knauer
Lena Schlipf
Chan-Su Shin
Antoine Vigneron
Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ More planar two-center algorithms 1999 Timothy M. Chan
4
+ PDF Chat Convexity-Increasing Morphs of Planar Graphs 2018 Linda Kleist
Boris Klemz
Anna Lubiw
Lena Schlipf
Frank Staals
Darren Strash
3
+ Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets 2005 Hee-Kap Ahn
Peter Braß
Otfried Cheong
Hyeon-Suk Na
Chan-Su Shin
Antoine Vigneron
3
+ PDF Chat How to Morph Planar Graph Drawings 2017 Soroush Alamdari
Patrizio Angelini
Fidel Barrera-Cruz
Timothy M. Chan
Giordano Da Lozzo
Giuseppe Di Battista
Fabrizio Frati
Penny Haxell
Anna Lubiw
Maurizio Patrignani
3
+ Deformations of plane graphs 1983 Carsten Thomassen
3
+ PDF Chat Powers of tensors and fast matrix multiplication 2014 François Le Gall
3
+ PDF Chat Small Grid Embeddings of 3-Polytopes 2010 Ares Ribó Mor
Günter Rote
André Schulz
3
+ Deformations of Plane Rectilinear Complexes 1944 Stewart S. Cairns
3
+ PDF Chat Compatible geometric matchings 2009 Oswin Aichholzer
Sergey Bereg
Adrian Dumitrescu
Alfredo Garcı́a
Clemens Huemer
Ferrán Hurtado
Mikio Kanō
Alberto Márquez
David Rappaport
Shakhar Smorodinsky
2
+ The maximum numbers of faces of a convex polytope 1970 Peter McMullen
2
+ None 2004 2
+ PDF Chat A Near-Linear Algorithm for the Planar 2-Center Problem 1997 Micha Sharir
2
+ PDF Chat Drawings of planar graphs with few slopes and segments 2006 Vida Dujmović
David Eppstein
Matthew Suderman
David R. Wood
2
+ PDF Chat A Survey on Graph Drawing Beyond Planarity 2019 Walter Didimo
Giuseppe Liotta
Fabrizio Montecchiani
2
+ PDF Chat Realization Spaces of Polytopes 1996 Jürgen Richter-Gebert
2
+ PDF Chat Strictly convex drawings of planar graphs 2006 Imre Bárány
Günter Rote
2
+ PDF Chat The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree 2012 Vít Jelínek
Eva Jelínková
Jan Kratochvı́l
Bernard Lidický
Marek Tesař
Tomáš Vyskočil
2
+ Convex hull computations 1997 Raimund Seidel
2
+ PDF Chat Disjoint Compatible Geometric Matchings 2012 Mashhood Ishaque
Diane L. Souvaine
Csaba D. Tóth
2
+ Matrix sparsification and nested dissection over arbitrary fields 2013 Noga Alon
Raphael Yuster
2
+ PDF Chat Monotone drawings of planar graphs 2004 János Pach
Gézá Tóth
2
+ Convex Representations of Graphs 1960 W. T. Tutte
2
+ None 2001 Stefan Felsner
2
+ A polynomial-time algorithm for Outerplanar Diameter Improvement 2017 Nathann Cohen
Daniel Gonçalves
Eun Jung Kim
Christophe Paul
Ignasi Sau
Dimitrios M. Thilikos
Mathias Weller
2
+ Approximation of convex bodies by rectangles 1993 Marek Lassak
2
+ PDF Chat Minimum-weight triangulation is NP-hard 2008 Wolfgang Mulzer
Günter Rote
2
+ Tutte's barycenter method applied to isotopies 2003 Éric Colin de Verdière
Michel Pocchiola
Gert Vegter
2
+ Encyclopedia of Algorithms 2014 Ming‐Yang Kao
1
+ PDF Chat Computing the Discrete Fréchet Distance in Subquadratic Time 2014 Pankaj Agarwal
Rinat Ben Avraham
Haim Kaplan
Micha Sharir
1
+ PDF Chat T-shape visibility representations of 1-planar graphs 2017 Franz J. Brandenburg
1
+ PDF Chat Ortho-polygon Visibility Representations of Embedded Graphs 2017 Emilio Di Giacomo
Walter Didimo
William Evans
Giuseppe Liotta
Henk Meijer
Fabrizio Montecchiani
Stephen Wismath
1
+ Encyclopedia of Algorithms 2016 Ming‐Yang Kao
1
+ Über Mengen konvexer Körper mit gemeinschaftlichen Punkte. 1923 Ed. Helly
1
+ PDF Chat Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles 2018 Philipp Kindermann
Fabrizio Montecchiani
Lena Schlipf
André Schulz
1
+ PDF Chat $$\beta $$-Stars or On Extending a Drawing of a Connected Subgraph 2018 Tamara Mchedlidze
Jérôme Urhausen
1
+ Edge partitions of optimal 2-plane and 3-plane graphs 2019 Michael A. Bekos
Emilio Di Giacomo
Walter Didimo
Giuseppe Liotta
Fabrizio Montecchiani
Chrysanthi N. Raftopoulou
1
+ Convex transversals 2012 Esther M. Arkin
Claudia Dieckmann
Christian Knauer
Joseph S. B. Mitchell
Valentin Polishchuk
Lena Schlipf
Shang Yang
1
+ Planar Octilinear Drawings with One Bend Per Edge 2015 Michael A. Bekos
Martin Gronemann
Michael Kaufmann
Robert Krug
1
+ Upward Planar Morphs 2018 Giordano Da Lozzo
Giuseppe Di Battista
Fabrizio Frati
Maurizio Patrignani
Vincenzo Roselli
1
+ PDF Chat The Complexity of Drawing a Graph in a Polygonal Region 2018 Anna Lubiw
Tillmann Miltzow
Debajyoti Mondal
1
+ On topological graphs with at most four crossings per edge 2019 Eyal Ackerman
1
+ Graduate Texts in Mathematics 1977 Rajendra Bhatia
Glen Bredon
Wolfgang Walter
Joseph Rotman
M. Ram Murty
Jane Gilman
Peter Walters
Martin Golubitsky
Ioannis Karatzas
Henri Cohen
1
+ Triangle-free intersection graphs of line segments with large chromatic number 2013 Arkadiusz Pawlik
Jakub Kozik
Tomasz Krawczyk
Michał Lasoń
Piotr Micek
William T. Trotter
Bartosz Walczak
1
+ Outerplanar graph drawings with few slopes 2014 Kolja Knauer
Piotr Micek
Bartosz Walczak
1
+ PDF Chat An annotated bibliography on 1-planarity 2017 Stephen Kobourov
Giuseppe Liotta
Fabrizio Montecchiani
1
+ PDF Chat Simplifying Non-simple Fan-Planar Drawings 2021 Boris Klemz
Kristin Knorr
Meghana M. Reddy
Felix Schröder
1
+ PDF Chat The Density of Fan-Planar Graphs 2022 Michael Kaufmann
Torsten Ueckerdt
1
+ PDF Chat Compatible Geometric Matchings 2008 Oswin Aichholzer
Sergey Bereg
Adrian Dumitrescu
Alfredo Garcı́a
Clemens Huemer
Ferrán Hurtado
Mikio Kano
Alberto Márquez
David Rappaport
Shakhar Smorodinsky
1
+ PDF Chat Handbook of discrete and computational geometry 1998 1
+ Helly-Type Theorems and Geometric Transversals 2004 Rephael Wenger
1