Linda Kleist

According to our database, Linda Kleist authored at least 40 papers between 2014 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2025

Flipping Non-Crossing Spanning Trees.

Håvard Bakke Bjerkevik, Linda Kleist, Torsten Ueckerdt, Birgit Vogtenhuber

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

Facet-Hamiltonicity.

Hugo A. Akitaya, Jean Cardinal, Stefan Felsner, Linda Kleist, Robert Lauff

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

2024

Adjacency Graphs of Polyhedral Surfaces.

Elena Arseneva, Linda Kleist, Boris Klemz, Maarten Löffler, André Schulz, Birgit Vogtenhuber, Alexander Wolff

Discret. Comput. Geom., June, 2024

The Complexity of the Hausdorff Distance.

Paul Jungeblut, Linda Kleist, Tillmann Miltzow

Discret. Comput. Geom., January, 2024

Reconfiguration of unit squares and disks: PSPACE-hardness in simple settings.

Mikkel Abrahamsen, Kevin Buchin, Maike Buchin, Linda Kleist, Maarten Löffler, Lena Schlipf, André Schulz, Jack Stade

CoRR, 2024

On the Connectivity of the Flip Graph of Plane Spanning Paths.

Linda Kleist, Peter Kramer, Christian Rieck

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2024

Augmenting Plane Straight-Line Graphs to Meet Parity Constraints.

Aleksander Bjørn Grodt Christiansen, Linda Kleist, Irene Parada, Eva Rotenberg

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2024

Minimum Plane Bichromatic Spanning Trees.

Hugo A. Akitaya, Ahmad Biniaz, Erik D. Demaine, Linda Kleist, Frederick Stock, Csaba D. Tóth

Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

Strongly-Connected Minimal-Cost Radio-Networks Among Fixed Terminals Using Mobile Relays and Avoiding No-Transmission Zones.

Francesco Bernardini, Daniel Biediger, Ileana Pineda, Linda Kleist, Aaron T. Becker

Proceedings of the 20th IEEE International Conference on Automation Science and Engineering, 2024

2023

Completeness for the Complexity Class $\forall \exists \mathbb {R}$ and Area-Universality.

Michael Gene Dobbins, Linda Kleist, Tillmann Miltzow, Pawel Rzazewski

Discret. Comput. Geom., July, 2023

Competitive location problems: balanced facility location and the One-Round Manhattan Voronoi Game.

Thomas Byrne, Sándor P. Fekete, Jörg Kalcsics, Linda Kleist

Ann. Oper. Res., February, 2023

Folding polyiamonds into octahedra.

Eva Stehr, Linda Kleist

Comput. Geom., 2023

Online Sorting and Translational Packing of Convex Polygons.

Anders Aamand, Mikkel Abrahamsen, Lorenzo Beretta, Linda Kleist

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

The Complexity of Recognizing Geometric Hypergraphs.

Daniel Bertschinger, Nicolas El Maalouly, Linda Kleist, Tillmann Miltzow, Simon Weber

Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

Geometric Embeddability of Complexes Is ∃ℝ-Complete.

Mikkel Abrahamsen, Linda Kleist, Tillmann Miltzow

Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022

Bounding the tripartite-circle crossing number of complete tripartite graphs.

Charles Camacho, Silvia Fernández-Merchant, Marija Jelic Milutinovic, Rachel Kirsch, Linda Kleist, Elizabeth Bailey Matson, Jennifer White

J. Graph Theory, 2022

Minimum Scan Cover and Variants: Theory and Experiments.

Kevin Buchin, Alexander Hill, Sándor P. Fekete, Linda Kleist, Irina Kostitsyna, Dominik Krupke, Roel Lambers, Martijn Struijs

ACM J. Exp. Algorithmics, 2022

Scheduling with Machine Conflicts.

Moritz Buchem, Linda Kleist, Daniel Schmidt genannt Waldschmidt

Proceedings of the Approximation and Online Algorithms - 20th International Workshop, 2022

A Solution to Ringel's Circle Problem.

James Davies, Chaya Keller, Linda Kleist, Shakhar Smorodinsky, Bartosz Walczak

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021

Minimum Scan Cover with Angular Transition Costs.

Sándor P. Fekete, Linda Kleist, Dominik Krupke

SIAM J. Discret. Math., 2021

Worst-Case Optimal Squares Packing into Disks.

Sándor P. Fekete, Vijaykrishna Gurunathan, Kushagra Juneja, Phillip Keldenich, Linda Kleist, Christian Scheffer

J. Comput. Geom., 2021

On Area-Universal Quadrangulations.

William S. Evans, Stefan Felsner, Linda Kleist, Stephen G. Kobourov

J. Graph Algorithms Appl., 2021

The Tripartite-Circle Crossing Number of K_{2, 2, n}.

Charles Camacho, Silvia Fernández-Merchant, Marija Jelic Milutinovic, Rachel Kirsch, Linda Kleist, Elizabeth Bailey Matson, Jennifer White

CoRR, 2021

Scheduling with Contact Restrictions - A Problem Arising in Pandemics.

Moritz Buchem, Linda Kleist, Daniel Schmidt genannt Waldschmidt

CoRR, 2021

Folding polyominoes with holes into a cube.

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

Comput. Geom., 2021

Upward Point Set Embeddings of Paths and Trees.

Elena Arseneva, Pilar Cano, Linda Kleist, Tamara Mchedlidze, Saeed Mehrabi, Irene Parada, Pavel Valtr

Proceedings of the WALCOM: Algorithms and Computation, 2021

Training Neural Networks is ER-complete.

Mikkel Abrahamsen, Linda Kleist, Tillmann Miltzow

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Packing Squares into a Disk with Optimal Worst-Case Density.

Sándor P. Fekete, Vijaykrishna Gurunathan, Kushagra Juneja, Phillip Keldenich, Linda Kleist, Christian Scheffer

Proceedings of the 37th International Symposium on Computational Geometry, 2021

Folding Polyiamonds into Octahedra.

Eva Bolle, Linda Kleist

Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

2020

Rainbow Cycles in Flip Graphs.

Stefan Felsner, Linda Kleist, Torsten Mütze, Leon Sering

SIAM J. Discret. Math., 2020

Upward Point Set Embeddings of Paths and Trees.

Elena Arseneva, Pilar Cano, Linda Kleist, Tamara Mchedlidze, Saeed Mehrabi, Irene Parada, Pavel Valtr

CoRR, 2020

Targeted Drug Delivery: Algorithmic Methods for Collecting a Swarm of Particles with Uniform, External Forces.

Aaron T. Becker, Sándor P. Fekete, Li Huang, Phillip Keldenich, Linda Kleist, Dominik Krupke, Christian Rieck, Arne Schmidt

Proceedings of the 2020 IEEE International Conference on Robotics and Automation, 2020

2019

Planar graphs and face areas: Area-Universality.

Linda Kleist

PhD thesis, 2019

Convexity-increasing morphs of planar graphs.

Linda Kleist, Boris Klemz, Anna Lubiw, Lena Schlipf, Frank Staals, Darren Strash

Comput. Geom., 2019

On the Edge-Vertex Ratio of Maximal Thrackles.

Oswin Aichholzer, Linda Kleist, Boris Klemz, Felix Schröder, Birgit Vogtenhuber

Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

2018

Drawing planar graphs with prescribed face areas.

Linda Kleist

J. Comput. Geom., 2018

∀∃ℝ-Completeness and Area-Universality.

Michael Gene Dobbins, Linda Kleist, Tillmann Miltzow, Pawel Rzazewski

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

On the Area-Universality of Triangulations.

Linda Kleist

Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

2015

Upper and Lower Bounds on Long Dual Paths in Line Arrangements.

Udo Hoffmann, Linda Kleist, Tillmann Miltzow

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

2014

Unit Contact Representations of Grid Subgraphs with Regular Polytopes in 2D and 3D.

Linda Kleist, Benjamin Rahman

Proceedings of the Graph Drawing - 22nd International Symposium, 2014