Unit Contact Representations of Grid Subgraphs with Regular Polytopes in 2D and 3D. - Linda Kleist; Benjamin Rahman (GD, 2014)

Upper and Lower Bounds on Long Dual Paths in Line Arrangements. - Udo Hoffmann; Linda Kleist; Tillmann Miltzow (MFCS (2), 2015)

On the Area-Universality of Triangulations. - Linda Kleist (GD, 2018)

∀∃ℝ-Completeness and Area-Universality. - Michael Gene Dobbins; Linda Kleist; Tillmann Miltzow; Pawel Rzazewski (WG, 2018)

Drawing planar graphs with prescribed face areas. - Linda Kleist (J. Comput. Geom., 2018)

On the Edge-Vertex Ratio of Maximal Thrackles. - Oswin Aichholzer; Linda Kleist; Boris Klemz; Felix Schröder; Birgit Vogtenhuber (GD, 2019)

Convexity-increasing morphs of planar graphs. - Linda Kleist; Boris Klemz; Anna Lubiw; Lena Schlipf; Frank Staals; Darren Strash (Comput. Geom., 2019)

Planar graphs and face areas: Area-Universality. - Linda Kleist (2019)

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 001 (ICRA, 2020)

Upward Point Set Embeddings of Paths and Trees. - Elena Arseneva; Pilar Cano; Linda Kleist; Tamara Mchedlidze; Saeed Mehrabi 004; Irene Parada; Pavel Valtr 001 (CoRR, 2020)

Rainbow Cycles in Flip Graphs. - Stefan Felsner; Linda Kleist; Torsten Mütze; Leon Sering (SIAM J. Discret. Math., 2020)

Folding Polyiamonds into Octahedra. - Eva Bolle; Linda Kleist (CCCG, 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 (SoCG, 2021)

Training Neural Networks is ER-complete. - Mikkel Abrahamsen; Linda Kleist; Tillmann Miltzow (NeurIPS, 2021)

Upward Point Set Embeddings of Paths and Trees. - Elena Arseneva; Pilar Cano; Linda Kleist; Tamara Mchedlidze; Saeed Mehrabi 001; Irene Parada; Pavel Valtr 001 (WALCOM, 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 001 (Comput. Geom., 2021)

Scheduling with Contact Restrictions - A Problem Arising in Pandemics. - Moritz Buchem; Linda Kleist; Daniel Schmidt genannt Waldschmidt (CoRR, 2021)

The Tripartite-Circle Crossing Number of K2, 2, n. - Charles Camacho; Silvia Fernández-Merchant; Marija Jelic Milutinovic; Rachel Kirsch; Linda Kleist; Elizabeth Bailey Matson; Jennifer White (CoRR, 2021)

On Area-Universal Quadrangulations. - William S. Evans; Stefan Felsner; Linda Kleist; Stephen G. Kobourov (J. Graph Algorithms Appl., 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)

Minimum Scan Cover with Angular Transition Costs. - Sándor P. Fekete; Linda Kleist; Dominik Krupke (SIAM J. Discret. Math., 2021)

A Solution to Ringel's Circle Problem. - James Davies; Chaya Keller; Linda Kleist; Shakhar Smorodinsky; Bartosz Walczak (SoCG, 2022)

Scheduling with Machine Conflicts. - Moritz Buchem; Linda Kleist; Daniel Schmidt genannt Waldschmidt (WAOA, 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)

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)

The Complexity of Recognizing Geometric Hypergraphs. - Daniel Bertschinger; Nicolas El Maalouly; Linda Kleist; Tillmann Miltzow; Simon Weber 001 (GD (1), 2023)

Online Sorting and Translational Packing of Convex Polygons. - Anders Aamand; Mikkel Abrahamsen; Lorenzo Beretta 001; Linda Kleist (SODA, 2023)

Folding polyiamonds into octahedra. - Eva Stehr; Linda Kleist (Comput. Geom., 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., 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., 2023)

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 (CASE, 2024)

Minimum Plane Bichromatic Spanning Trees. - Hugo A. Akitaya; Ahmad Biniaz; Erik D. Demaine; Linda Kleist; Frederick Stock; Csaba D. Tóth (ISAAC, 2024)

Augmenting Plane Straight-Line Graphs to Meet Parity Constraints. - Aleksander Bjørn Grodt Christiansen; Linda Kleist; Irene Parada; Eva Rotenberg (WG, 2024)

On the Connectivity of the Flip Graph of Plane Spanning Paths. - Linda Kleist; Peter Kramer 001; Christian Rieck (WG, 2024)

The Complexity of the Hausdorff Distance. - Paul Jungeblut; Linda Kleist; Tillmann Miltzow (Discret. Comput. Geom., 2024)

Adjacency Graphs of Polyhedral Surfaces. - Elena Arseneva; Linda Kleist; Boris Klemz; Maarten Löffler; André Schulz 001; Birgit Vogtenhuber; Alexander Wolff 001 (Discret. Comput. Geom., 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 001; Jack Stade (SoCG, 2025)

Facet-Hamiltonicity. - Hugo A. Akitaya; Jean Cardinal; Stefan Felsner; Linda Kleist; Robert Lauff (SODA, 2025)

Flipping Non-Crossing Spanning Trees. - Håvard Bakke Bjerkevik; Linda Kleist; Torsten Ueckerdt; Birgit Vogtenhuber (SODA, 2025)

Geometric Embeddability of Complexes is ∃ℝ-complete. - Mikkel Abrahamsen; Linda Kleist; Tillmann Miltzow (J. ACM, 2025)

Counterexample to Winkler's conjecture on Venn diagrams. - Sofia Brenner; Linda Kleist; Torsten Mütze; Christian Rieck; Francesco Verciani (CoRR, 2025)

Using Mobile Relays to Strongly Connect a Minimum-Power Network between Terminals Complying with No-Transmission Zones. - Francesco Bernardini; Daniel Biediger; Ileana Pineda; Linda Kleist; Aaron T. Becker (CoRR, 2025)

An Improved Bound for Plane Covering Paths. - 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 (CoRR, 2025)