Scholar
Torsten Ueckerdt
Google Scholar ID: QWbu1vAAAAAJ
Karlsruhe Institute of Technology
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
1,072
H-index
16
i10-index
27
Publications
20
Co-authors
22
list available
Contact
No contact links provided.
Publications
9 items
Flip Distance of Non-Crossing Spanning Trees: NP-Hardness and Improved Bounds
2026
Cited
0
Number of Edges in 3-Connected Graphs with Cyclic Neighborhoods
2025
Cited
0
The Price of Connectivity Augmentation on Planar Graphs
2025
Cited
0
Edge densities of drawings of graphs with one forbidden cell
2025
Cited
0
Linear Layouts of Graphs with Priority Queues
2025
Cited
0
Odd coloring graphs with linear neighborhood complexity
2025
Cited
0
Boundedness and Separation in the Graph Covering Number Framework
2025
Cited
0
Crossing Number of 3-Plane Drawings
2025
Cited
0
Load more
Resume (English only)
Research Experience
The research focuses on problems in graph theory and combinatorics, including extremal graph theory, Ramsey-type problems, graph representations, and graph labelings.
Co-authors
22 total
Stephen Kobourov
Professor of Computer Science, Technical University Munich
Michael Kaufmann
Professor of Computer Science, Tübingen University
Co-author 3
Co-author 4
Alexander Wolff
Chair for Algorithms and Complexity, Institute of Computer Science, University of Würzburg
Jean Cardinal
Université libre de Bruxelles (ULB)
David Eppstein
Distinguished Professor of Computer Science, University of California, Irvine
Kurt Mehlhorn
Professor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics Campus
×
Welcome back
Sign in to Agora
Welcome back! Please sign in to continue.
Email address
Password
Forgot password?
Continue
Do not have an account?
Sign up