Heiko Röglin

ORCID

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 32

Top Venues

CoRR

ESA

LATIN

ACM Trans. Algorithms

Publications

Anna Arutyunova, Anna Großwendt, Heiko Röglin, Melanie Schmidt, Julian Wargalla
Upper and lower bounds for complete linkage in general metric spaces. Mach. Learn. 113 (1) (2024)
Frederik Brüning, Anne Driemel, Alperen Ergür, Heiko Röglin
On the number of iterations of the DBA algorithm. CoRR (2024)
Frederik Brüning, Anne Driemel, Alperen Ergür, Heiko Röglin
On the number of iterations of the DBA algorithm. SDM (2024)
Matthias Englert, Heiko Röglin, Berthold Vöcking
Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP. CoRR (2023)
René Beier, Heiko Röglin, Clemens Rösner, Berthold Vöcking
The smoothed number of Pareto-optimal solutions in bicriteria integer optimization. Math. Program. 200 (1) (2023)
Lukas Drexler, Jan Eube, Kelin Luo, Heiko Röglin, Melanie Schmidt, Julian Wargalla
Connected k-Center and k-Diameter Clustering. ICALP (2023)
Anna Arutyunova, Heiko Röglin
The Price of Hierarchical Clustering. CoRR (2022)
Lukas Drexler, Jan Eube, Kelin Luo, Heiko Röglin, Melanie Schmidt, Julian Wargalla
Connected k-Center and k-Diameter Clustering. CoRR (2022)
Anna Arutyunova, Heiko Röglin
The Price of Hierarchical Clustering. ESA (2022)
Anna Arutyunova, Anne Driemel, Jan-Henrik Haunert, Herman J. Haverkort, Jürgen Kusche, Elmar Langetepe, Philip Mayer, Petra Mutzel, Heiko Röglin
Minimum-Error Triangulations for Sea Surface Reconstruction. CoRR (2022)
Anna Arutyunova, Anne Driemel, Jan-Henrik Haunert, Herman J. Haverkort, Jürgen Kusche, Elmar Langetepe, Philip Mayer, Petra Mutzel, Heiko Röglin
Minimum-Error Triangulations for Sea Surface Reconstruction. SoCG (2022)
Anna Arutyunova, Anna Großwendt, Heiko Röglin, Melanie Schmidt, Julian Wargalla
Upper and Lower Bounds for Complete Linkage in General Metric Spaces. APPROX-RANDOM (2021)
Peter Rottmann, Anne Driemel, Herman J. Haverkort, Heiko Röglin, Jan-Henrik Haunert
Bicriteria Aggregation of Polygons via Graph Cuts. GIScience (II) (2021)
Anup Bhattacharya, Jan Eube, Heiko Röglin, Melanie Schmidt
Noisy, Greedy and Not so Greedy k-Means++. ESA (2020)
Britta Peis, Oliver Schaudt, Heiko Röglin, Bert Randerath, Rainer Schrader, Frank Vallentin
Preface: 15th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2017). Discret. Appl. Math. 272 (2020)
Heiko Röglin
Smoothed Analysis of Pareto Curves in Multiobjective Optimization. CoRR (2020)
Anna Großwendt, Heiko Röglin, Melanie Schmidt
Analysis of Ward's Method. CoRR (2019)
Anna Großwendt, Heiko Röglin, Melanie Schmidt
Analysis of Ward's Method. SODA (2019)
Anup Bhattacharya, Jan Eube, Heiko Röglin, Melanie Schmidt
Noisy, Greedy and Not So Greedy k-means++. CoRR (2019)
Carsten Fischer, Heiko Röglin
Probabilistic Analysis of Online (Class-Constrained) Bin Packing and Bin Covering. LATIN (2018)
Matthias Mnich, Heiko Röglin, Clemens Rösner
New deterministic algorithms for solving parity games. Discret. Optim. 30 (2018)
Alantha Newman, Heiko Röglin, Johanna Seif
The Alternating Stock Size Problem and the Gasoline Puzzle. ACM Trans. Algorithms 14 (2) (2018)
Bodo Manthey, Claire Mathieu, Heiko Röglin, Eli Upfal
Probabilistic Methods in the Design and Analysis of Algorithms (Dagstuhl Seminar 17141). Dagstuhl Reports 7 (4) (2017)
Anna Großwendt, Heiko Röglin
Improved Analysis of Complete-Linkage Clustering. Algorithmica 78 (4) (2017)
Heiko Röglin, Clemens Rösner
The Smoothed Number of Pareto-Optimal Solutions in Non-integer Bicriteria Optimization. TAMC (2017)
Michael Etscheid, Heiko Röglin
Smoothed Analysis of Local Search for the Maximum-Cut Problem. ACM Trans. Algorithms 13 (2) (2017)
Michael Etscheid, Stefan Kratsch, Matthias Mnich, Heiko Röglin
Polynomial kernels for weighted problems. J. Comput. Syst. Sci. 84 (2017)
Matthias Englert, Heiko Röglin, Berthold Vöcking
Smoothed Analysis of the 2-Opt Algorithm for the General TSP. ACM Trans. Algorithms 13 (1) (2016)
Matthias Mnich, Heiko Röglin, Clemens Rösner
New Deterministic Algorithms for Solving Parity Games. LATIN (2016)
Alantha Newman, Heiko Röglin, Johanna Seif
The Alternating Stock Size Problem and the Gasoline Puzzle. ESA (2016)
Tobias Brunsch, Michael Etscheid, Heiko Röglin
Bounds for the Convergence Time of Local Search in Scheduling Problems. WINE (2016)
Carsten Fischer, Heiko Röglin
Probabilistic Analysis of the Dual Next-Fit Algorithm for Bin Covering. LATIN (2016)
Carsten Fischer, Heiko Röglin
Probabilistic Analysis of the Dual Next-Fit Algorithm for Bin Covering. CoRR (2015)
Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin, Clemens Rösner
Smoothed Analysis of the Successive Shortest Path Algorithm. CoRR (2015)
Matthias Mnich, Heiko Röglin, Clemens Rösner
New Deterministic Algorithms for Solving Parity Games. CoRR (2015)
Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin, Clemens Rösner
Smoothed Analysis of the Successive Shortest Path Algorithm. SIAM J. Comput. 44 (6) (2015)
Alantha Newman, Heiko Röglin, Johanna Seif
The Alternating Stock Size Problem and the Gasoline Puzzle. CoRR (2015)
André Berger, Heiko Röglin, Ruben van der Zwaan
Internet routing between autonomous systems: Fast algorithms for path trading. Discret. Appl. Math. 185 (2015)
Anna Großwendt, Heiko Röglin
Improved Analysis of Complete-Linkage Clustering. ESA (2015)
Michael Etscheid, Stefan Kratsch, Matthias Mnich, Heiko Röglin
Polynomial Kernels for Weighted Problems. MFCS (2) (2015)
Tobias Brunsch, Anna Großwendt, Heiko Röglin
Solving Totally Unimodular LPs with the Shadow Vertex Algorithm. STACS (2015)
Tobias Brunsch, Heiko Röglin
Improved Smoothed Analysis of Multiobjective Optimization. J. ACM 62 (1) (2015)
Michael Etscheid, Stefan Kratsch, Matthias Mnich, Heiko Röglin
Polynomial Kernels for Weighted Problems. CoRR (2015)
Michael Etscheid, Heiko Röglin
Smoothed Analysis of the Squared Euclidean Maximum-Cut Problem. ESA (2015)
Tobias Brunsch, Heiko Röglin, Cyriel Rutten, Tjark Vredeveld
Smoothed performance guarantees for local search. Math. Program. 146 (1-2) (2014)
Matthias Englert, Heiko Röglin, Berthold Vöcking
Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP. Algorithmica 68 (1) (2014)
Tobias Brunsch, Navin Goyal, Luis Rademacher, Heiko Röglin
Lower Bounds for the Average and Smoothed Number of Pareto-Optima. Theory Comput. 10 (2014)
Tobias Brunsch, Anna Großwendt, Heiko Röglin
Solving Totally Unimodular LPs with the Shadow Vertex Algorithm. CoRR (2014)
Maria-Florina Balcan, Bodo Manthey, Heiko Röglin, Tim Roughgarden
Analysis of Algorithms Beyond the Worst Case (Dagstuhl Seminar 14372). Dagstuhl Reports 4 (9) (2014)
Konstantin Voevodski, Maria-Florina Balcan, Heiko Röglin, Shang-Hua Teng, Yu Xia
Efficient Clustering with Limited Distance Information. CoRR (2014)
Michael Etscheid, Heiko Röglin
Smoothed Analysis of Local Search for the Maximum-Cut Problem. SODA (2014)
Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin
Smoothed analysis of the successive shortest path algorithm. CTW (2013)
Matthias Englert, Heiko Röglin, Jacob Spönemann, Berthold Vöcking
Economical Caching. ACM Trans. Comput. Theory 5 (2) (2013)
Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin
Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching. J. Graph Algorithms Appl. 17 (6) (2013)
Bodo Manthey, Heiko Röglin
Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences. J. Comput. Geom. 4 (1) (2013)
Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin
Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching. WALCOM (2013)
Tobias Brunsch, Heiko Röglin
A bad instance for k-means++. Theor. Comput. Sci. 505 (2013)
Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin
Smoothed Analysis of the Successive Shortest Path Algorithm. SODA (2013)
Tobias Brunsch, Heiko Röglin
Finding Short Paths on Polytopes by the Shadow Vertex Algorithm CoRR (2013)
Tobias Brunsch, Heiko Röglin
Finding Short Paths on Polytopes by the Shadow Vertex Algorithm. ICALP (1) (2013)
Timo Kötzing, Frank Neumann, Heiko Röglin, Carsten Witt
Theoretical analysis of two ACO approaches for the traveling salesman problem. Swarm Intell. 6 (1) (2012)
Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin
Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching CoRR (2012)
Andreas Emil Feldmann, Heiko Röglin, Berthold Vöcking
Computing approximate Nash equilibria in network congestion games. Networks 59 (4) (2012)
Konstantin Voevodski, Maria-Florina Balcan, Heiko Röglin, Shang-Hua Teng, Yu Xia
Active Clustering of Biological Sequences. J. Mach. Learn. Res. 13 (2012)
Tobias Brunsch, Heiko Röglin
Improved smoothed analysis of multiobjective optimization. STOC (2012)
David Arthur, Bodo Manthey, Heiko Röglin
Smoothed Analysis of the k-Means Method. J. ACM 58 (5) (2011)
Tobias Brunsch, Heiko Röglin
A Bad Instance for k-Means++. TAMC (2011)
Konstantin Voevodski, Maria-Florina Balcan, Heiko Röglin, Shang-Hua Teng, Yu Xia
Clustering Protein Sequences Given the Approximation Stability of the Min-Sum Objective Function CoRR (2011)
Tobias Brunsch, Heiko Röglin, Cyriel Rutten, Tjark Vredeveld
Smoothed Performance Guarantees for Local Search CoRR (2011)
Martin Hoefer, Vahab S. Mirrokni, Heiko Röglin, Shang-Hua Teng
Competitive routing over time. Theor. Comput. Sci. 412 (39) (2011)
Konstantin Voevodski, Maria-Florina Balcan, Heiko Röglin, Shang-Hua Teng, Yu Xia
Min-sum Clustering of Protein Sequences with Limited Distance Information. SIMBAD (2011)
Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking
Uncoordinated Two-Sided Matching Markets. SIAM J. Comput. 40 (1) (2011)
Tobias Brunsch, Heiko Röglin
Lower Bounds for the Smoothed Number of Pareto Optimal Solutions. TAMC (2011)
Bodo Manthey, Heiko Röglin
Smoothed Analysis: Analysis of Algorithms Beyond Worst Case. it Inf. Technol. 53 (6) (2011)
Tobias Brunsch, Heiko Röglin
Improved Smoothed Analysis of Multiobjective Optimization CoRR (2011)
Tobias Brunsch, Heiko Röglin, Cyriel Rutten, Tjark Vredeveld
Smoothed Performance Guarantees for Local Search. ESA (2011)
André Berger, Heiko Röglin, Ruben van der Zwaan
Path Trading: Fast Algorithms, Smoothed Analysis, and Hardness Results. SEA (2011)
Timo Kötzing, Frank Neumann, Heiko Röglin, Carsten Witt
Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem. ANTS Conference (2010)
Tobias Brunsch, Heiko Röglin
Lower Bounds for the Smoothed Number of Pareto optimal Solutions CoRR (2010)
Patrick Briest, Heiko Röglin
The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers. WAOA (2010)
Konstantin Voevodski, Maria-Florina Balcan, Heiko Röglin, Shang-Hua Teng, Yu Xia
Efficient Clustering with Limited Distance Information. UAI (2010)
Konstantin Voevodski, Maria-Florina Balcan, Heiko Röglin, Shang-Hua Teng, Yu Xia
Efficient Clustering with Limited Distance Information CoRR (2010)
Heiner Ackermann, Heiko Röglin, Ulf Schellbach, Nils Schweer
Analysis of Algorithms. Algorithm Engineering (2010)
Maria-Florina Balcan, Heiko Röglin, Shang-Hua Teng
Agnostic Clustering. ALT (2009)
Martin Hoefer, Vahab S. Mirrokni, Heiko Röglin, Shang-Hua Teng
Competitive Routing over Time. WINE (2009)
Heiko Röglin, Shang-Hua Teng
Smoothed Analysis of Multiobjective Optimization. FOCS (2009)
David Arthur, Bodo Manthey, Heiko Röglin
k-Means Has Polynomial Smoothed Complexity. FOCS (2009)
Matthias Englert, Heiko Röglin, Matthias Westermann
Evaluation of online strategies for reordering buffers. ACM J. Exp. Algorithmics 14 (2009)
Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking
Uncoordinated two-sided matching markets. SIGecom Exch. 8 (1) (2009)
Matthias Englert, Heiko Röglin, Jacob Spönemann, Berthold Vöcking
Economical Caching. STACS (2009)
David Arthur, Bodo Manthey, Heiko Röglin
k-Means has Polynomial Smoothed Complexity CoRR (2009)
Heiner Ackermann, Heiko Röglin, Berthold Vöcking
Pure Nash equilibria in player-specific and weighted congestion games. Theor. Comput. Sci. 410 (17) (2009)
Bodo Manthey, Heiko Röglin
-means method. SODA (2009)
Bodo Manthey, Heiko Röglin
-Means Clustering with Bregman Divergences. ISAAC (2009)
Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking
A Unified Approach to Congestion Games and Two-Sided Markets. Internet Math. 5 (4) (2008)
Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking
Uncoordinated two-sided matching markets. EC (2008)
Andreas Emil Feldmann, Heiko Röglin, Berthold Vöcking
Computing Approximate Nash Equilibria in Network Congestion Games. SIROCCO (2008)
Heiner Ackermann, Heiko Röglin, Berthold Vöcking
On the impact of combinatorial structure on congestion games. J. ACM 55 (6) (2008)
Patrick Briest, Paul W. Goldberg, Heiko Röglin
Approximate Equilibria in Games with Few Players CoRR (2008)
Heiner Ackermann, Heiko Röglin
On the Convergence Time of the Best Response Dynamics in Player-specific Congestion Games CoRR (2008)

Heiko Röglin.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Heiko Röglin