Scholar
Heiko Röglin
Google Scholar ID: NLLMDCkAAAAJ
Professor of Computer Science, University of Bonn
Theoretical Computer Science
Smoothed Analysis
Algorithmic Game Theory
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
860
H-index
14
i10-index
19
Publications
20
Co-authors
22
list available
Publications
9 items
Connected Subspace Clustering: Hardness, a Scalable Heuristic, and an Application to Sea Level Geodesy
2026
Cited
0
Finding Regions of Maximum Circularity in Plane Geometric Graphs
2026
Cited
0
Approximation Algorithms for the Traveling Thief Problem
2026
Cited
0
Effective Traveling for Metric Instances of the Traveling Thief Problem
2026
Cited
0
Parameterized Algorithms for the Drone Delivery Problem
International Symposium on Algorithms and Computation · 2026
Cited
0
New Algorithms and Hardness Results for Connected Clustering
2025
Cited
0
Parameterized Algorithms for Computing Pareto Sets
2025
Cited
0
Connected k-Median with Disjoint and Non-disjoint Clusters
2025
Cited
0
Load more
Resume
Academic Achievements
For a list of publications, please visit his publication page or see dblp or Google Scholar. He has supervised several PhD students and postdocs.
Research Experience
- Since July 2013, Professor (W3) of Theoretical Computer Science at the University of Bonn
- October 2010 to June 2013, Professor (W2) of Theoretical Computer Science at the University of Bonn
- July 2009 to September 2010, Assistant Professor of Operations Research at Maastricht University
- July 2008 to June 2009, Postdoctoral Research Fellow at Boston University, working with Shang-Hua Teng
- May 2008 to June 2008, Visiting Researcher at the Theory Group of Microsoft Research Asia in Beijing
- October 2004 to April 2008, PhD student in the Algorithms and Complexity Group at RWTH Aachen, headed by Berthold Vöcking
Education
- PhD, October 2004 to April 2008, RWTH Aachen, Algorithms and Complexity Group, Advisor: Berthold Vöcking
- Bachelor's Degree in Computer Science, October 2000 to August 2004, University of Dortmund
Background
Research interests include Beyond Worst-Case Analysis, Cluster Analysis, Algorithmic Game Theory, and Online Algorithms.
Co-authors
11 total
Bodo Manthey
Associate Professor, University of Twente
Matthias Englert
University of Warwick
Maria-Florina Balcan
Professor, School of Computer Science, Carnegie Mellon University
Vahab Mirrokni
Google Fellow, VP, Google Research
Dirk Sudholt
University of Passau, Germany
Matthias Mnich
TU Hamburg
Carsten Witt
Technical University of Denmark
Frank Neumann
Optimisation and Logistics, School of Computer