Heiko Röglin

1.4k total citations
49 papers, 511 citations indexed

About

Heiko Röglin is a scholar working on Artificial Intelligence, Management Science and Operations Research and Computer Networks and Communications. According to data from OpenAlex, Heiko Röglin has authored 49 papers receiving a total of 511 indexed citations (citations by other indexed papers that have themselves been cited), including 18 papers in Artificial Intelligence, 18 papers in Management Science and Operations Research and 16 papers in Computer Networks and Communications. Recurrent topics in Heiko Röglin's work include Optimization and Search Problems (13 papers), Vehicle Routing Optimization Methods (10 papers) and Auction Theory and Applications (10 papers). Heiko Röglin is often cited by papers focused on Optimization and Search Problems (13 papers), Vehicle Routing Optimization Methods (10 papers) and Auction Theory and Applications (10 papers). Heiko Röglin collaborates with scholars based in Germany, United States and Netherlands. Heiko Röglin's co-authors include Bodo Manthey, Berthold Vöcking, David Arthur, Matthias Englert, Shang‐Hua Teng, Vahab Mirrokni, Michael Etscheid, Paul W. Goldberg, Frank Neumann and Timo Kötzing and has published in prestigious journals such as SHILAP Revista de lepidopterología, Journal of the ACM and Machine Learning.

In The Last Decade

Heiko Röglin

41 papers receiving 473 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Heiko Röglin Germany	14	207	110	107	100	100	49	511
Morteza Zadimoghaddam United States	15	184 0.9×	150 1.4×	199 1.9×	53 0.5×	267 2.7×	51	575
Qi Lei China	12	266 1.3×	35 0.3×	55 0.5×	132 1.3×	124 1.2×	35	656
Witold Pedrycz Canada	10	287 1.4×	194 1.8×	155 1.4×	40 0.4×	56 0.6×	23	724
Boris Goldengorin Netherlands	13	121 0.6×	142 1.3×	55 0.5×	259 2.6×	139 1.4×	59	614
Dalila Boughaci Algeria	13	251 1.2×	44 0.4×	75 0.7×	84 0.8×	148 1.5×	64	512
Guido Proietti Italy	14	95 0.5×	209 1.9×	51 0.5×	49 0.5×	259 2.6×	68	543
Mark Nicholson United Kingdom	10	207 1.0×	85 0.8×	39 0.4×	113 1.1×	103 1.0×	31	688
Evdokia Nikolova United States	11	82 0.4×	28 0.3×	130 1.2×	42 0.4×	106 1.1×	41	467
Anna Moss Israel	5	212 1.0×	192 1.7×	85 0.8×	61 0.6×	320 3.2×	7	738
Ola Svensson Switzerland	16	149 0.7×	315 2.9×	114 1.1×	278 2.8×	377 3.8×	69	789

Countries citing papers authored by Heiko Röglin

Since Specialization

Citations

This map shows the geographic impact of Heiko Röglin's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Heiko Röglin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Heiko Röglin more than expected).

Fields of papers citing papers by Heiko Röglin

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Heiko Röglin. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Heiko Röglin. The network helps show where Heiko Röglin may publish in the future.

Co-authorship network of co-authors of Heiko Röglin

This figure shows the co-authorship network connecting the top 25 collaborators of Heiko Röglin. A scholar is included among the top collaborators of Heiko Röglin based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Heiko Röglin. Heiko Röglin is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Driemel, Anne, et al.. (2025). On the number of iterations of the DBA algorithm. Data Mining and Knowledge Discovery. 39(5).

Röglin, Heiko, et al.. (2025). The Price of Hierarchical Clustering. Algorithmica. 87(10). 1420–1452.

Driemel, Anne, et al.. (2024). Bicriteria Shapes: Hierarchical Grouping and Aggregation of Polygons with an Efficient Graph-Cut Approach. ACM Transactions on Spatial Algorithms and Systems. 11(1). 1–23.

Röglin, Heiko, et al.. (2023). Upper and lower bounds for complete linkage in general metric spaces. Machine Learning. 113(1). 489–518. 1 indexed citations

Driemel, Anne, et al.. (2021). Bicriteria Aggregation of Polygons via Graph Cuts. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

Röglin, Heiko, et al.. (2020). Noisy, Greedy and Not so Greedy k-Means++. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

Etscheid, Michael, Stefan Kratsch, Matthias Mnich, & Heiko Röglin. (2016). Polynomial kernels for weighted problems. Journal of Computer and System Sciences. 84. 1–10. 13 indexed citations

Röglin, Heiko, et al.. (2015). Solving Totally Unimodular LPs with the Shadow Vertex Algorithm. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 30. 171–183. 2 indexed citations

Röglin, Heiko, et al.. (2014). Internet routing between autonomous systems: Fast algorithms for path trading. Discrete Applied Mathematics. 185. 8–17. 1 indexed citations

10.

Cornelissen, Kamiel, et al.. (2013). Smoothed analysis of the successive shortest path algorithm. University of Twente Research Information. 1180–1189. 6 indexed citations

11.

Röglin, Heiko, et al.. (2013). Smoothed performance guarantees for local search. Mathematical Programming. 146(1-2). 185–218. 2 indexed citations

12.

Balcan, Maria-Florina, et al.. (2012). Active clustering of biological sequences. Journal of Machine Learning Research. 13(1). 203–225. 19 indexed citations

13.

Röglin, Heiko, et al.. (2012). A bad instance fork-means++. Theoretical Computer Science. 505. 19–26. 9 indexed citations

14.

Hoefer, Martin, Vahab Mirrokni, Heiko Röglin, & Shang‐Hua Teng. (2011). Competitive routing over time. Theoretical Computer Science. 412(39). 5420–5432. 16 indexed citations

15.

Manthey, Bodo & Heiko Röglin. (2009). Improved smoothed analysis of the k-means method. arXiv (Cornell University). 461–470. 16 indexed citations

16.

Manthey, Bodo & Heiko Röglin. (2009). Improved Smoothed Analysis of the k-Means Method. 461–470. 7 indexed citations

17.

Englert, Matthias, Heiko Röglin, & Matthias Westermann. (2009). Evaluation of online strategies for reordering buffers. ACM Journal of Experimental Algorithmics. 14. 2 indexed citations

18.

Röglin, Heiko, et al.. (2008). Pure Nash equilibria in player-specific and weighted congestion games. Theoretical Computer Science. 410(17). 1552–1563. 3 indexed citations

19.

Englert, Matthias, Heiko Röglin, & Berthold Vöcking. (2007). Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP: extended abstract. Symposium on Discrete Algorithms. 1295–1304. 19 indexed citations

20.

Newman, Alantha, et al.. (2007). Decision-making based on approximate and smoothed Pareto curves. Theoretical Computer Science. 378(3). 253–270. 16 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact