default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLinda Kleist
Person information
- affiliation: Potsdam University, Germany
- affiliation (former): Technische Universität Braunschweig, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2019
[b1]Linda Kleist
:
Planar graphs and face areas: Area-Universality. Technical University of Berlin, Germany, 2019
Journal Articles
- 2025
- [j15]Mikkel Abrahamsen, Linda Kleist, Tillmann Miltzow:
Geometric Embeddability of Complexes is ∃ℝ-complete. J. ACM 72(1): 9:1-9:26 (2025) - 2024
- [j14]Paul Jungeblut, Linda Kleist, Tillmann Miltzow:
The Complexity of the Hausdorff Distance. Discret. Comput. Geom. 71(1): 177-213 (2024) - [j13]Elena Arseneva, Linda Kleist, Boris Klemz, Maarten Löffler, André Schulz, Birgit Vogtenhuber, Alexander Wolff:
Adjacency Graphs of Polyhedral Surfaces. Discret. Comput. Geom. 71(4): 1429-1455 (2024) - 2023
- [j12]Thomas Byrne, Sándor P. Fekete, Jörg Kalcsics, Linda Kleist:
Competitive location problems: balanced facility location and the One-Round Manhattan Voronoi Game. Ann. Oper. Res. 321(1): 79-101 (2023) - [j11]Eva Stehr, Linda Kleist:
Folding polyiamonds into octahedra. Comput. Geom. 108: 101917 (2023) - [j10]Michael Gene Dobbins, Linda Kleist, Tillmann Miltzow, Pawel Rzazewski:
Completeness for the Complexity Class $\forall \exists \mathbb {R}$ and Area-Universality. Discret. Comput. Geom. 70(1): 154-188 (2023) - 2022
- [j9]Kevin Buchin, Alexander Hill, Sándor P. Fekete, Linda Kleist, Irina Kostitsyna, Dominik Krupke, Roel Lambers, Martijn Struijs:
Minimum Scan Cover and Variants: Theory and Experiments. ACM J. Exp. Algorithmics 27: 4.5:1-4.5:28 (2022) - [j8]Charles Camacho, Silvia Fernández-Merchant, Marija Jelic Milutinovic, Rachel Kirsch, Linda Kleist, Elizabeth Bailey Matson, Jennifer White:
Bounding the tripartite-circle crossing number of complete tripartite graphs. J. Graph Theory 100(1): 5-27 (2022) - 2021
- [j7]Oswin Aichholzer, Hugo A. Akitaya, Kenneth C. Cheung, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Linda Kleist, Irina Kostitsyna, Maarten Löffler, Zuzana Masárová, Klara Mundilova, Christiane Schmidt:
Folding polyominoes with holes into a cube. Comput. Geom. 93: 101700 (2021) - [j6]William S. Evans, Stefan Felsner, Linda Kleist, Stephen G. Kobourov:
On Area-Universal Quadrangulations. J. Graph Algorithms Appl. 25(1): 171-193 (2021) - [j5]Sándor P. Fekete, Vijaykrishna Gurunathan, Kushagra Juneja, Phillip Keldenich, Linda Kleist, Christian Scheffer:
Worst-case optimal squares packing into disks. J. Comput. Geom. 13(2): 3-29 (2021) - [j4]Sándor P. Fekete, Linda Kleist, Dominik Krupke:
Minimum Scan Cover with Angular Transition Costs. SIAM J. Discret. Math. 35(2): 1337-1355 (2021) - 2020
- [j3]Stefan Felsner, Linda Kleist, Torsten Mütze, Leon Sering:
Rainbow Cycles in Flip Graphs. SIAM J. Discret. Math. 34(1): 1-39 (2020) - 2019
- [j2]Linda Kleist, Boris Klemz, Anna Lubiw, Lena Schlipf, Frank Staals, Darren Strash:
Convexity-increasing morphs of planar graphs. Comput. Geom. 84: 69-88 (2019) - 2018
- [j1]Linda Kleist:
Drawing planar graphs with prescribed face areas. J. Comput. Geom. 9(1): 290-311 (2018)
Conference and Workshop Papers
- 2025
- [c31]Mikkel Abrahamsen, Kevin Buchin, Maike Buchin, Linda Kleist, Maarten Löffler, Lena Schlipf, André Schulz, Jack Stade:
Reconfiguration of Unit Squares and Disks: PSPACE-Hardness in Simple Settings. SoCG 2025: 1:1-1:18 - [c30]Håvard Bakke Bjerkevik, Linda Kleist, Torsten Ueckerdt, Birgit Vogtenhuber:
Flipping Non-Crossing Spanning Trees. SODA 2025: 2313-2325 - [c29]Hugo A. Akitaya, Jean Cardinal, Stefan Felsner, Linda Kleist, Robert Lauff:
Facet-Hamiltonicity. SODA 2025: 5051-5064 - 2024
- [c28]Francesco Bernardini, Daniel Biediger, Ileana Pineda, Linda Kleist, Aaron T. Becker:
Strongly-Connected Minimal-Cost Radio-Networks Among Fixed Terminals Using Mobile Relays and Avoiding No-Transmission Zones. CASE 2024: 2059-2066 - [c27]Hugo A. Akitaya, Ahmad Biniaz, Erik D. Demaine, Linda Kleist, Frederick Stock, Csaba D. Tóth:
Minimum Plane Bichromatic Spanning Trees. ISAAC 2024: 4:1-4:14 - [c26]Aleksander Bjørn Grodt Christiansen, Linda Kleist, Irene Parada, Eva Rotenberg:
Augmenting Plane Straight-Line Graphs to Meet Parity Constraints. WG 2024: 121-135 - [c25]Linda Kleist, Peter Kramer, Christian Rieck:
On the Connectivity of the Flip Graph of Plane Spanning Paths. WG 2024: 327-342 - 2023
- [c24]Mikkel Abrahamsen, Linda Kleist, Tillmann Miltzow:
Geometric Embeddability of Complexes Is ∃ℝ-Complete. SoCG 2023: 1:1-1:19 - [c23]Daniel Bertschinger, Nicolas El Maalouly, Linda Kleist, Tillmann Miltzow, Simon Weber:
The Complexity of Recognizing Geometric Hypergraphs. GD (1) 2023: 163-179 - [c22]Anders Aamand, Mikkel Abrahamsen, Lorenzo Beretta, Linda Kleist:
Online Sorting and Translational Packing of Convex Polygons. SODA 2023: 1806-1833 - 2022
- [c21]James Davies, Chaya Keller, Linda Kleist, Shakhar Smorodinsky, Bartosz Walczak:
A Solution to Ringel's Circle Problem. SoCG 2022: 33:1-33:14 - [c20]Paul Jungeblut, Linda Kleist, Tillmann Miltzow:
The Complexity of the Hausdorff Distance. SoCG 2022: 48:1-48:17 - [c19]Moritz Buchem, Linda Kleist, Daniel Schmidt genannt Waldschmidt:
Scheduling with Machine Conflicts. WAOA 2022: 36-60 - 2021
- [c18]Eva Bolle, Linda Kleist:
Folding Polyiamonds into Octahedra. CCCG 2021: 260-270 - [c17]Elena Arseneva, Linda Kleist, Boris Klemz, Maarten Löffler, André Schulz, Birgit Vogtenhuber, Alexander Wolff:
Adjacency Graphs of Polyhedral Surfaces. SoCG 2021: 11:1-11:17 - [c16]Sándor P. Fekete, Vijaykrishna Gurunathan, Kushagra Juneja, Phillip Keldenich, Linda Kleist, Christian Scheffer:
Packing Squares into a Disk with Optimal Worst-Case Density. SoCG 2021: 36:1-36:16 - [c15]Mikkel Abrahamsen, Linda Kleist, Tillmann Miltzow:
Training Neural Networks is ER-complete. NeurIPS 2021: 18293-18306 - [c14]Thomas Byrne, Sándor P. Fekete, Jörg Kalcsics, Linda Kleist:
Competitive Location Problems: Balanced Facility Location and the One-Round Manhattan Voronoi Game. WALCOM 2021: 103-115 - [c13]Elena Arseneva, Pilar Cano, Linda Kleist, Tamara Mchedlidze, Saeed Mehrabi, Irene Parada, Pavel Valtr:
Upward Point Set Embeddings of Paths and Trees. WALCOM 2021: 234-246 - [c12]Kevin Buchin, Sándor P. Fekete, Alexander Hill, Linda Kleist, Irina Kostitsyna, Dominik Krupke, Roel Lambers, Martijn Struijs:
Minimum Scan Cover and Variants - Theory and Experiments. SEA 2021: 4:1-4:16 - 2020
- [c11]Sándor P. Fekete, Linda Kleist, Dominik Krupke:
Minimum Scan Cover with Angular Transition Costs. SoCG 2020: 43:1-43:18 - [c10]Aaron T. Becker, Sándor P. Fekete, Li Huang, Phillip Keldenich, Linda Kleist, Dominik Krupke, Christian Rieck, Arne Schmidt:
Targeted Drug Delivery: Algorithmic Methods for Collecting a Swarm of Particles with Uniform, External Forces. ICRA 2020: 2508-2514 - 2019
- [c9]Oswin Aichholzer, Hugo A. Akitaya, Kenneth C. Cheung, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Linda Kleist, Irina Kostitsyna, Maarten Löffler, Zuzana Masárová, Klara Mundilova, Christiane Schmidt:
Folding Polyominoes with Holes into a Cube. CCCG 2019: 164-170 - [c8]Oswin Aichholzer, Linda Kleist, Boris Klemz, Felix Schröder, Birgit Vogtenhuber:
On the Edge-Vertex Ratio of Maximal Thrackles. GD 2019: 482-495 - 2018
- [c7]Stefan Felsner, Linda Kleist, Torsten Mütze, Leon Sering:
Rainbow Cycles in Flip Graphs. SoCG 2018: 38:1-38:14 - [c6]Linda Kleist:
On the Area-Universality of Triangulations. GD 2018: 333-346 - [c5]Michael Gene Dobbins, Linda Kleist, Tillmann Miltzow, Pawel Rzazewski:
∀∃ℝ-Completeness and Area-Universality. WG 2018: 164-175 - [c4]Linda Kleist, Boris Klemz, Anna Lubiw, Lena Schlipf, Frank Staals, Darren Strash:
Convexity-Increasing Morphs of Planar Graphs. WG 2018: 318-330 - 2016
- [c3]Linda Kleist:
Drawing Planar Graphs with Prescribed Face Areas. WG 2016: 158-170 - 2015
- [c2]Udo Hoffmann, Linda Kleist, Tillmann Miltzow:
Upper and Lower Bounds on Long Dual Paths in Line Arrangements. MFCS (2) 2015: 407-419 - 2014
- [c1]Linda Kleist, Benjamin Rahman:
Unit Contact Representations of Grid Subgraphs with Regular Polytopes in 2D and 3D. GD 2014: 137-148
Informal and Other Publications
- 2025
- [i32]Aleksander Bjørn Grodt Christiansen, Linda Kleist, Irene Parada, Eva Rotenberg:
Augmenting Plane Straight-Line Graphs to Meet Parity Constraints. CoRR abs/2502.10066 (2025) - [i31]Sofia Brenner, Linda Kleist, Torsten Mütze, Christian Rieck, Francesco Verciani:
Counterexample to Winkler's conjecture on Venn diagrams. CoRR abs/2503.18554 (2025) - [i30]Francesco Bernardini, Daniel Biediger, Ileana Pineda, Linda Kleist, Aaron T. Becker:
Using Mobile Relays to Strongly Connect a Minimum-Power Network between Terminals Complying with No-Transmission Zones. CoRR abs/2504.03747 (2025) - [i29]Hugo A. Akitaya, Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, John Iacono, Linda Kleist, Michiel Smid, Diane L. Souvaine, Leonidas Theocharous:
An Improved Bound for Plane Covering Paths. CoRR abs/2507.06477 (2025) - 2024
- [i28]Linda Kleist, Peter Kramer, Christian Rieck:
On the Connectivity of the Flip Graph of Plane Spanning Paths. CoRR abs/2407.03912 (2024) - [i27]Aaron T. Becker, Sándor P. Fekete, Li Huang, Phillip Keldenich, Linda Kleist, Dominik Krupke, Christian Rieck, Arne Schmidt:
Targeted Drug Delivery: Algorithmic Methods for Collecting a Swarm of Particles with Uniform External Forces. CoRR abs/2408.09729 (2024) - [i26]Hugo A. Akitaya, Ahmad Biniaz, Erik D. Demaine, Linda Kleist, Frederick Stock, Csaba D. Tóth:
Minimum Plane Bichromatic Spanning Trees. CoRR abs/2409.11614 (2024) - [i25]Håvard Bakke Bjerkevik, Linda Kleist, Torsten Ueckerdt, Birgit Vogtenhuber:
Flipping Non-Crossing Spanning Trees. CoRR abs/2410.23809 (2024) - [i24]Hugo A. Akitaya, Jean Cardinal, Stefan Felsner, Linda Kleist, Robert Lauff:
Facet-Hamiltonicity. CoRR abs/2411.02172 (2024) - [i23]Mikkel Abrahamsen, Kevin Buchin, Maike Buchin, Linda Kleist, Maarten Löffler, Lena Schlipf, André Schulz, Jack Stade:
Reconfiguration of unit squares and disks: PSPACE-hardness in simple settings. CoRR abs/2412.21017 (2024) - 2023
- [i22]Daniel Bertschinger, Nicolas El Maalouly, Linda Kleist, Tillmann Miltzow, Simon Weber:
The Complexity of Recognizing Geometric Hypergraphs. CoRR abs/2302.13597 (2023) - 2022
- [i21]Eva Stehr, Linda Kleist:
Folding Polyiamonds into Octahedra. CoRR abs/2207.13989 (2022) - 2021
- [i20]Moritz Buchem, Linda Kleist, Daniel Schmidt genannt Waldschmidt:
Scheduling with Contact Restrictions - A Problem Arising in Pandemics. CoRR abs/2102.08231 (2021) - [i19]Mikkel Abrahamsen, Linda Kleist, Tillmann Miltzow:
Training Neural Networks is ER-complete. CoRR abs/2102.09798 (2021) - [i18]Sándor P. Fekete, Vijaykrishna Gurunathan, Kushagra Juneja, Phillip Keldenich, Linda Kleist, Christian Scheffer:
Packing Squares into a Disk with Optimal Worst-Case Density. CoRR abs/2103.07258 (2021) - [i17]Elena Arseneva, Linda Kleist, Boris Klemz, Maarten Löffler, André Schulz, Birgit Vogtenhuber, Alexander Wolff:
Adjacency Graphs of Polyhedral Surfaces. CoRR abs/2103.09803 (2021) - [i16]Kevin Buchin, Sándor P. Fekete, Alexander Hill, Linda Kleist, Irina Kostitsyna, Dominik Krupke, Roel Lambers, Martijn Struijs:
Minimum Scan Cover and Variants - Theory and Experiments. CoRR abs/2103.14599 (2021) - [i15]Charles Camacho, Silvia Fernández-Merchant, Marija Jelic Milutinovic, Rachel Kirsch, Linda Kleist, Elizabeth Bailey Matson, Jennifer White:
The Tripartite-Circle Crossing Number of K2, 2, n. CoRR abs/2108.01032 (2021) - [i14]Mikkel Abrahamsen, Linda Kleist, Tillmann Miltzow:
Geometric Embeddability of Complexes is ∃R-complete. CoRR abs/2108.02585 (2021) - [i13]Anders Aamand, Mikkel Abrahamsen, Lorenzo Beretta, Linda Kleist:
Online Sorting and Translational Packing of Convex Polygons. CoRR abs/2112.03791 (2021) - [i12]Paul Jungeblut, Linda Kleist, Tillmann Miltzow:
The Complexity of the Hausdorff Distance. CoRR abs/2112.04343 (2021) - [i11]James Davies, Chaya Keller, Linda Kleist, Shakhar Smorodinsky, Bartosz Walczak:
A solution to Ringel's circle problem. CoRR abs/2112.05042 (2021) - 2020
- [i10]Sándor P. Fekete, Linda Kleist, Dominik Krupke:
Minimum Scan Cover with Angular Transition Costs. CoRR abs/2003.08816 (2020) - [i9]Thomas Byrne, Sándor P. Fekete, Jörg Kalcsics, Linda Kleist:
Competitive Location Problems: Balanced Facility Location and the One-Round Manhattan Voronoi Game. CoRR abs/2011.13275 (2020) - [i8]Elena Arseneva, Pilar Cano, Linda Kleist, Tamara Mchedlidze, Saeed Mehrabi, Irene Parada, Pavel Valtr:
Upward Point Set Embeddings of Paths and Trees. CoRR abs/2012.10525 (2020) - 2019
- [i7]Oswin Aichholzer, Linda Kleist, Boris Klemz, Felix Schröder, Birgit Vogtenhuber:
On the edge-vertex ratio of maximal thrackles. CoRR abs/1908.08857 (2019) - [i6]Oswin Aichholzer, Hugo A. Akitaya, Kenneth C. Cheung, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Linda Kleist, Irina Kostitsyna, Maarten Löffler, Zuzana Masárová, Klara Mundilova, Christiane Schmidt:
Folding Polyominoes with Holes into a Cube. CoRR abs/1910.09917 (2019) - 2018
- [i5]Linda Kleist, Boris Klemz, Anna Lubiw, Lena Schlipf, Frank Staals, Darren Strash:
Convexity-Increasing Morphs of Planar Graphs. CoRR abs/1802.06579 (2018) - [i4]Linda Kleist:
On the Area-Universality of Triangulations. CoRR abs/1808.10864 (2018) - 2017
- [i3]Michael Gene Dobbins, Linda Kleist, Tillmann Miltzow, Pawel Rzazewski:
∀∃R-completeness and area-universality. CoRR abs/1712.05142 (2017) - [i2]Stefan Felsner, Linda Kleist, Torsten Mütze, Leon Sering:
Rainbow cycles in flip graphs. CoRR abs/1712.07421 (2017) - 2015
- [i1]Udo Hoffmann, Linda Kleist, Tillmann Miltzow:
Upper and Lower Bounds on Long Dual-Paths in Line Arrangements. CoRR abs/1506.03728 (2015)
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-08-13 22:20 CEST 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:
