Linda Kleist

87 papers A* 13A 5B 10Journal 53Unranked 5
YearRankTypeTitle / Venue / Authors
2026 J jnl
Covering and Partitioning Complex Objects with Small Pieces.
CoRR
Anders Aamand, Mikkel Abrahamsen, Reilly Browne, Mayank Goswami, Prahlad Narasimhan Kasthurirangan, Linda Kleist, Joseph S. B. Mitchell, Valentin Polishchuk, Jack Stade
2026 J jnl
Flip Distance of Non-Crossing Spanning Trees: NP-Hardness and Improved Bounds.
CoRR
Håvard Bakke Bjerkevik, Joseph Dorfer, Linda Kleist, Torsten Ueckerdt, Birgit Vogtenhuber
2026 J jnl
Online Packing of Orthogonal Polygons.
CoRR
Tim Gerlach, Benjamin Hennies, Linda Kleist
2025 A conf
An Improved Bound for Plane Covering Paths.
ESA
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
2025 J jnl
An Improved Bound for Plane Covering Paths.
CoRR
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
2025 J jnl
Augmenting Plane Straight-Line Graphs to Meet Parity Constraints.
CoRR
Aleksander Bjørn Grodt Christiansen, Linda Kleist, Irene Parada, Eva Rotenberg
2025 J jnl
Counterexample to Winkler's conjecture on Venn diagrams.
CoRR
Sofia Brenner, Linda Kleist, Torsten Mütze, Christian Rieck, Francesco Verciani
2025 A* conf
Facet-Hamiltonicity.
SODA
Hugo A. Akitaya, Jean Cardinal, Stefan Felsner, Linda Kleist, Robert Lauff
2025 A* conf
Flipping Non-Crossing Spanning Trees.
SODA
Håvard Bakke Bjerkevik, Linda Kleist, Torsten Ueckerdt, Birgit Vogtenhuber
2025 J jnl
Geometric Embeddability of Complexes is ∃ℝ-complete.
J. ACM
Mikkel Abrahamsen, Linda Kleist, Tillmann Miltzow
2025 J jnl
Minimum Plane Bichromatic Spanning Trees.
ACM Trans. Algorithms
Hugo A. Akitaya, Ahmad Biniaz, Erik D. Demaine, Linda Kleist, Frederick Stock, Csaba D. Tóth
2025 A* conf
Reconfiguration of Unit Squares and Disks: PSPACE-Hardness in Simple Settings.
SoCG
Mikkel Abrahamsen, Kevin Buchin, Maike Buchin, Linda Kleist, Maarten Löffler, Lena Schlipf, André Schulz, Jack Stade
2025 A conf
The Price of Connectivity Augmentation on Planar Graphs.
GD
Hugo A. Akitaya, Justin Dallant, Erik D. Demaine, Michael Kaufmann, Linda Kleist, Frederick Stock, Csaba D. Tóth, Torsten Ueckerdt
2025 J jnl
The Price of Connectivity Augmentation on Planar Graphs.
CoRR
Hugo A. Akitaya, Justin Dallant, Erik D. Demaine, Michael Kaufmann, Linda Kleist, Frederick Stock, Csaba D. Tóth, Torsten Ueckerdt
2025 J jnl
Using Mobile Relays to Strongly Connect a Minimum-Power Network between Terminals Complying with No-Transmission Zones.
CoRR
Francesco Bernardini, Daniel Biediger, Ileana Pineda, Linda Kleist, Aaron T. Becker
2024 J jnl
Adjacency Graphs of Polyhedral Surfaces.
Discret. Comput. Geom.
Elena Arseneva, Linda Kleist, Boris Klemz, Maarten Löffler, André Schulz, Birgit Vogtenhuber, Alexander Wolff
2024 B conf
Augmenting Plane Straight-Line Graphs to Meet Parity Constraints.
WG
Aleksander Bjørn Grodt Christiansen, Linda Kleist, Irene Parada, Eva Rotenberg
2024 J jnl
Facet-Hamiltonicity.
CoRR
Hugo A. Akitaya, Jean Cardinal, Stefan Felsner, Linda Kleist, Robert Lauff
2024 J jnl
Flipping Non-Crossing Spanning Trees.
CoRR
Håvard Bakke Bjerkevik, Linda Kleist, Torsten Ueckerdt, Birgit Vogtenhuber
2024 B conf
Minimum Plane Bichromatic Spanning Trees.
ISAAC
Hugo A. Akitaya, Ahmad Biniaz, Erik D. Demaine, Linda Kleist, Frederick Stock, Csaba D. Tóth
2024 J jnl
Minimum Plane Bichromatic Spanning Trees.
CoRR
Hugo A. Akitaya, Ahmad Biniaz, Erik D. Demaine, Linda Kleist, Frederick Stock, Csaba D. Tóth
2024 B conf
On the Connectivity of the Flip Graph of Plane Spanning Paths.
WG
Linda Kleist, Peter Kramer, Christian Rieck
2024 J jnl
On the Connectivity of the Flip Graph of Plane Spanning Paths.
CoRR
Linda Kleist, Peter Kramer, Christian Rieck
2024 J jnl
Reconfiguration of unit squares and disks: PSPACE-hardness in simple settings.
CoRR
Mikkel Abrahamsen, Kevin Buchin, Maike Buchin, Linda Kleist, Maarten Löffler, Lena Schlipf, André Schulz, Jack Stade
2024 — conf
Strongly-Connected Minimal-Cost Radio-Networks Among Fixed Terminals Using Mobile Relays and Avoiding No-Transmission Zones.
CASE
Francesco Bernardini, Daniel Biediger, Ileana Pineda, Linda Kleist, Aaron T. Becker
2024 J jnl
Targeted Drug Delivery: Algorithmic Methods for Collecting a Swarm of Particles with Uniform External Forces.
CoRR
Aaron T. Becker, Sándor P. Fekete, Li Huang, Phillip Keldenich, Linda Kleist, Dominik Krupke, Christian Rieck, Arne Schmidt
2024 J jnl
The Complexity of the Hausdorff Distance.
Discret. Comput. Geom.
Paul Jungeblut, Linda Kleist, Tillmann Miltzow
2024 J jnl
The Tripartite-Circle Crossing Number of Graphs With Two Small Partition Classes.
Comput. Geom. Topol.
Charles Camacho, Silvia Fernández-Merchant, Marija Jelic Milutinovic, Rachel Kirsch, Linda Kleist, Elizabeth Bailey Matson, Jennifer White
2023 J jnl
Competitive location problems: balanced facility location and the One-Round Manhattan Voronoi Game.
Ann. Oper. Res.
Thomas Byrne, Sándor P. Fekete, Jörg Kalcsics, Linda Kleist
2023 J jnl
Completeness for the Complexity Class $\forall \exists \mathbb {R}$ and Area-Universality.
Discret. Comput. Geom.
Michael Gene Dobbins, Linda Kleist, Tillmann Miltzow, Pawel Rzazewski
2023 J jnl
Folding polyiamonds into octahedra.
Comput. Geom.
Eva Stehr, Linda Kleist
2023 A* conf
Geometric Embeddability of Complexes Is ∃ℝ-Complete.
SoCG
Mikkel Abrahamsen, Linda Kleist, Tillmann Miltzow
2023 A* conf
Online Sorting and Translational Packing of Convex Polygons.
SODA
Anders Aamand, Mikkel Abrahamsen, Lorenzo Beretta, Linda Kleist
2023 — conf
The Complexity of Recognizing Geometric Hypergraphs.
GD (1)
Daniel Bertschinger, Nicolas El Maalouly, Linda Kleist, Tillmann Miltzow, Simon Weber
2023 J jnl
The Complexity of Recognizing Geometric Hypergraphs.
CoRR
Daniel Bertschinger, Nicolas El Maalouly, Linda Kleist, Tillmann Miltzow, Simon Weber
2022 A* conf
A Solution to Ringel's Circle Problem.
SoCG
James Davies, Chaya Keller, Linda Kleist, Shakhar Smorodinsky, Bartosz Walczak
2022 J jnl
Bounding the tripartite-circle crossing number of complete tripartite graphs.
J. Graph Theory
Charles Camacho, Silvia Fernández-Merchant, Marija Jelic Milutinovic, Rachel Kirsch, Linda Kleist, Elizabeth Bailey Matson, Jennifer White
2022 J jnl
Folding Polyiamonds into Octahedra.
CoRR
Eva Stehr, Linda Kleist
2022 J jnl
Minimum Scan Cover and Variants: Theory and Experiments.
ACM J. Exp. Algorithmics
Kevin Buchin, Alexander Hill, Sándor P. Fekete, Linda Kleist, Irina Kostitsyna, Dominik Krupke, Roel Lambers, Martijn Struijs
2022 B conf
Scheduling with Machine Conflicts.
WAOA
Moritz Buchem, Linda Kleist, Daniel Schmidt genannt Waldschmidt
2022 A* conf
The Complexity of the Hausdorff Distance.
SoCG
Paul Jungeblut, Linda Kleist, Tillmann Miltzow
2021 J jnl
A solution to Ringel's circle problem.
CoRR
James Davies, Chaya Keller, Linda Kleist, Shakhar Smorodinsky, Bartosz Walczak
2021 A* conf
Adjacency Graphs of Polyhedral Surfaces.
SoCG
Elena Arseneva, Linda Kleist, Boris Klemz, Maarten Löffler, André Schulz, Birgit Vogtenhuber, Alexander Wolff
2021 J jnl
Adjacency Graphs of Polyhedral Surfaces.
CoRR
Elena Arseneva, Linda Kleist, Boris Klemz, Maarten Löffler, André Schulz, Birgit Vogtenhuber, Alexander Wolff
2021 B conf
Competitive Location Problems: Balanced Facility Location and the One-Round Manhattan Voronoi Game.
WALCOM
Thomas Byrne, Sándor P. Fekete, Jörg Kalcsics, Linda Kleist
2021 — conf
Folding Polyiamonds into Octahedra.
CCCG
Eva Bolle, Linda Kleist
2021 J jnl
Folding polyominoes with holes into a cube.
Comput. Geom.
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
2021 J jnl
Geometric Embeddability of Complexes is ∃R-complete.
CoRR
Mikkel Abrahamsen, Linda Kleist, Tillmann Miltzow
2021 B conf
Minimum Scan Cover and Variants - Theory and Experiments.
SEA
Kevin Buchin, Sándor P. Fekete, Alexander Hill, Linda Kleist, Irina Kostitsyna, Dominik Krupke, Roel Lambers, Martijn Struijs
2021 J jnl
Minimum Scan Cover and Variants - Theory and Experiments.
CoRR
Kevin Buchin, Sándor P. Fekete, Alexander Hill, Linda Kleist, Irina Kostitsyna, Dominik Krupke, Roel Lambers, Martijn Struijs
2021 J jnl
Minimum Scan Cover with Angular Transition Costs.
SIAM J. Discret. Math.
Sándor P. Fekete, Linda Kleist, Dominik Krupke
2021 J jnl
On Area-Universal Quadrangulations.
J. Graph Algorithms Appl.
William S. Evans, Stefan Felsner, Linda Kleist, Stephen G. Kobourov
2021 J jnl
Online Sorting and Translational Packing of Convex Polygons.
CoRR
Anders Aamand, Mikkel Abrahamsen, Lorenzo Beretta, Linda Kleist
2021 A* conf
Packing Squares into a Disk with Optimal Worst-Case Density.
SoCG
Sándor P. Fekete, Vijaykrishna Gurunathan, Kushagra Juneja, Phillip Keldenich, Linda Kleist, Christian Scheffer
2021 J jnl
Packing Squares into a Disk with Optimal Worst-Case Density.
CoRR
Sándor P. Fekete, Vijaykrishna Gurunathan, Kushagra Juneja, Phillip Keldenich, Linda Kleist, Christian Scheffer
2021 J jnl
Scheduling with Contact Restrictions - A Problem Arising in Pandemics.
CoRR
Moritz Buchem, Linda Kleist, Daniel Schmidt genannt Waldschmidt
2021 J jnl
The Complexity of the Hausdorff Distance.
CoRR
Paul Jungeblut, Linda Kleist, Tillmann Miltzow
2021 J jnl
The Tripartite-Circle Crossing Number of K
CoRR
Charles Camacho, Silvia Fernández-Merchant, Marija Jelic Milutinovic, Rachel Kirsch, Linda Kleist, Elizabeth Bailey Matson, Jennifer White
2021 A* conf
Training Neural Networks is ER-complete.
NeurIPS
Mikkel Abrahamsen, Linda Kleist, Tillmann Miltzow
2021 J jnl
Training Neural Networks is ER-complete.
CoRR
Mikkel Abrahamsen, Linda Kleist, Tillmann Miltzow
2021 B conf
Upward Point Set Embeddings of Paths and Trees.
WALCOM
Elena Arseneva, Pilar Cano, Linda Kleist, Tamara Mchedlidze, Saeed Mehrabi, Irene Parada, Pavel Valtr
2021 J jnl
Worst-case optimal squares packing into disks.
J. Comput. Geom.
Sándor P. Fekete, Vijaykrishna Gurunathan, Kushagra Juneja, Phillip Keldenich, Linda Kleist, Christian Scheffer
2020 J jnl
Competitive Location Problems: Balanced Facility Location and the One-Round Manhattan Voronoi Game.
CoRR
Thomas Byrne, Sándor P. Fekete, Jörg Kalcsics, Linda Kleist
2020 A* conf
Minimum Scan Cover with Angular Transition Costs.
SoCG
Sándor P. Fekete, Linda Kleist, Dominik Krupke
2020 J jnl
Minimum Scan Cover with Angular Transition Costs.
CoRR
Sándor P. Fekete, Linda Kleist, Dominik Krupke
2020 J jnl
Rainbow Cycles in Flip Graphs.
SIAM J. Discret. Math.
Stefan Felsner, Linda Kleist, Torsten Mütze, Leon Sering
2020 A* conf
Targeted Drug Delivery: Algorithmic Methods for Collecting a Swarm of Particles with Uniform, External Forces.
ICRA
Aaron T. Becker, Sándor P. Fekete, Li Huang, Phillip Keldenich, Linda Kleist, Dominik Krupke, Christian Rieck, Arne Schmidt
2020 J jnl
Upward Point Set Embeddings of Paths and Trees.
CoRR
Elena Arseneva, Pilar Cano, Linda Kleist, Tamara Mchedlidze, Saeed Mehrabi, Irene Parada, Pavel Valtr
2019 J jnl
Convexity-increasing morphs of planar graphs.
Comput. Geom.
Linda Kleist, Boris Klemz, Anna Lubiw, Lena Schlipf, Frank Staals, Darren Strash
2019 — conf
Folding Polyominoes with Holes into a Cube.
CCCG
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
2019 J jnl
Folding Polyominoes with Holes into a Cube.
CoRR
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
2019 A conf
On the Edge-Vertex Ratio of Maximal Thrackles.
GD
Oswin Aichholzer, Linda Kleist, Boris Klemz, Felix Schröder, Birgit Vogtenhuber
2019 J jnl
On the edge-vertex ratio of maximal thrackles.
CoRR
Oswin Aichholzer, Linda Kleist, Boris Klemz, Felix Schröder, Birgit Vogtenhuber
2019 — —
Planar graphs and face areas: Area-Universality.
Linda Kleist
2018 B conf
Convexity-Increasing Morphs of Planar Graphs.
WG
Linda Kleist, Boris Klemz, Anna Lubiw, Lena Schlipf, Frank Staals, Darren Strash
2018 J jnl
Convexity-Increasing Morphs of Planar Graphs.
CoRR
Linda Kleist, Boris Klemz, Anna Lubiw, Lena Schlipf, Frank Staals, Darren Strash
2018 J jnl
Drawing planar graphs with prescribed face areas.
J. Comput. Geom.
Linda Kleist
2018 A conf
On the Area-Universality of Triangulations.
GD
Linda Kleist
2018 J jnl
On the Area-Universality of Triangulations.
CoRR
Linda Kleist
2018 A* conf
Rainbow Cycles in Flip Graphs.
SoCG
Stefan Felsner, Linda Kleist, Torsten Mütze, Leon Sering
2018 B conf
∀∃ℝ-Completeness and Area-Universality.
WG
Michael Gene Dobbins, Linda Kleist, Tillmann Miltzow, Pawel Rzazewski
2017 J jnl
Rainbow cycles in flip graphs.
CoRR
Stefan Felsner, Linda Kleist, Torsten Mütze, Leon Sering
2017 J jnl
∀∃R-completeness and area-universality.
CoRR
Michael Gene Dobbins, Linda Kleist, Tillmann Miltzow, Pawel Rzazewski
2016 B conf
Drawing Planar Graphs with Prescribed Face Areas.
WG
Linda Kleist
2015 — conf
Upper and Lower Bounds on Long Dual Paths in Line Arrangements.
MFCS (2)
Udo Hoffmann, Linda Kleist, Tillmann Miltzow
2015 J jnl
Upper and Lower Bounds on Long Dual-Paths in Line Arrangements.
CoRR
Udo Hoffmann, Linda Kleist, Tillmann Miltzow
2014 A conf
Unit Contact Representations of Grid Subgraphs with Regular Polytopes in 2D and 3D.
GD
Linda Kleist, Benjamin Rahman