Scholar
Linda Kleist
Google Scholar ID: -0-W2TgAAAAJ
Universität Hamburg
computational geometry
algorithms
graphs
discrete mathematics
complexity
Follow
Google Scholar
↗
Citations & Impact
All-time
Citations
292
H-index
10
i10-index
10
Publications
20
Co-authors
50
list available
Contact
No contact links provided.
Publications
11 items
Hamilton paths and cycles in flip graphs of (almost-)perfect matchings
2026
Cited
0
Touring a Sequence of Orthogonal Polygons
2026
Cited
0
Covering and Partitioning Complex Objects with Small Pieces
2026
Cited
0
Flip Distance of Non-Crossing Spanning Trees: NP-Hardness and Improved Bounds
2026
Cited
0
Online Packing of Orthogonal Polygons
2026
Cited
0
The Price of Connectivity Augmentation on Planar Graphs
2025
Cited
0
An Improved Bound for Plane Covering Paths
2025
Cited
0
Using Mobile Relays to Strongly Connect a Minimum-Power Network between Terminals Complying with No-Transmission Zones
2025
Cited
0
Load more
Resume (English only)
Co-authors
50 total
Co-author 1
Sándor P. Fekete
Technische Universität Braunschweig, L3S Research Center
Mikkel Abrahamsen
Associate Professor of Computer Science, University of Copenhagen
Paweł Rzążewski
Warsaw University of Technology, Faculty of Mathematics and Information Science
Maarten Löffler
Computer Science, Utrecht University
Stefan Felsner
Professor für Diskrete Mathematik, TU Berlin
Hugo A. Akitaya
Assistant Professor of Computer Science, University of Massachusetts Lowell
Christian Rieck
PostDoc, University of Kassel
