| 2026 | ESA | Approximation Algorithms for the Traveling Thief Problem. | Jan Eube, Kelin Luo, Heiko Rglin, Sarah Sturm |
| 2026 | ESA | New Algorithms and Hardness Results for Connected Clustering. | Jan Eube, Heiko Rglin |
| 2026 | PPSN | Effective Traveling for Metric Instances of the Traveling Thief Problem. | Jan Eube, Kelin Luo, Aneta Neumann, Frank Neumann, Heiko Rglin |
| 2025 | ESA | Connected k-Median with Disjoint and Non-Disjoint Clusters. | Jan Eube, Kelin Luo, Dorian Reineccius, Heiko Rglin, Melanie Schmidt |
| 2025 | ESA | Parameterized Algorithms for Computing Pareto Sets. | Joshua Knen, Heiko Rglin, Tarek Stuck |
| 2025 | ISAAC | Parameterized Algorithms for the Drone Delivery Problem. | Simon Bartlmae, Andreas Hene, Joshua Knen, Heiko Rglin |
| 2025 | STACS | Approximate Minimum Tree Cover in All Symmetric Monotone Norms Simultaneously. | Matthias Kaul, Kelin Luo, Matthias Mnich, Heiko Rglin |
| 2024 | SDM | On the number of iterations of the DBA algorithm. | Frederik Brning, Anne Driemel, Alperen Ergr, Heiko Rglin |
| 2023 | ICALP | Connected k-Center and k-Diameter Clustering. | Lukas Drexler, Jan Eube, Kelin Luo, Heiko Rglin, Melanie Schmidt, Julian Wargalla |
| 2022 | ESA | The Price of Hierarchical Clustering. | Anna Arutyunova, Heiko Rglin |
| 2020 | ESA | Noisy, Greedy and Not so Greedy k-Means++. | Anup Bhattacharya, Jan Eube, Heiko Rglin, Melanie Schmidt |
| 2019 | SODA | Analysis of Ward's Method. | Anna Growendt, Heiko Rglin, Melanie Schmidt |
| 2018 | LATIN | Probabilistic Analysis of Online (Class-Constrained) Bin Packing and Bin Covering. | Carsten Fischer, Heiko Rglin |
| 2017 | TAMC | The Smoothed Number of Pareto-Optimal Solutions in Non-integer Bicriteria Optimization. | Heiko Rglin, Clemens Rsner |
| 2016 | ESA | The Alternating Stock Size Problem and the Gasoline Puzzle. | Alantha Newman, Heiko Rglin, Johanna Seif |
| 2016 | LATIN | Probabilistic Analysis of the Dual Next-Fit Algorithm for Bin Covering. | Carsten Fischer, Heiko Rglin |
| 2016 | LATIN | New Deterministic Algorithms for Solving Parity Games. | Matthias Mnich, Heiko Rglin, Clemens Rsner |
| 2015 | ESA | Smoothed Analysis of the Squared Euclidean Maximum-Cut Problem. | Michael Etscheid, Heiko Rglin |
| 2015 | ESA | Improved Analysis of Complete-Linkage Clustering. | Anna Growendt, Heiko Rglin |
| 2015 | MFCS | Polynomial Kernels for Weighted Problems. | Michael Etscheid, Stefan Kratsch, Matthias Mnich, Heiko Rglin |
| 2015 | STACS | Solving Totally Unimodular LPs with the Shadow Vertex Algorithm. | Tobias Brunsch, Anna Growendt, Heiko Rglin |
| 2014 | SODA | Smoothed Analysis of Local Search for the Maximum-Cut Problem. | Michael Etscheid, Heiko Rglin |
| 2013 | ICALP | Finding Short Paths on Polytopes by the Shadow Vertex Algorithm. | Tobias Brunsch, Heiko Rglin |
| 2013 | SODA | Smoothed Analysis of the Successive Shortest Path Algorithm. | Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Rglin |
| 2013 | WALCOM | Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching. | Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Rglin |
| 2012 | STOC | Improved smoothed analysis of multiobjective optimization. | Tobias Brunsch, Heiko Rglin |
| 2011 | ESA | Smoothed Performance Guarantees for Local Search. | Tobias Brunsch, Heiko Rglin, Cyriel Rutten, Tjark Vredeveld |
| 2011 | TAMC | A Bad Instance for k-Means++. | Tobias Brunsch, Heiko Rglin |
| 2011 | TAMC | Lower Bounds for the Smoothed Number of Pareto Optimal Solutions. | Tobias Brunsch, Heiko Rglin |
| 2010 | UAI | Efficient Clustering with Limited Distance Information. | Konstantin Voevodski, Maria-Florina Balcan, Heiko Rglin, Shang-Hua Teng, Yu Xia |
| 2010 | WAOA | The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers. | Patrick Briest, Heiko Rglin |
| 2009 | ALT | Agnostic Clustering. | Maria-Florina Balcan, Heiko Rglin, Shang-Hua Teng |
| 2009 | FOCS | k-Means Has Polynomial Smoothed Complexity. | David Arthur, Bodo Manthey, Heiko Rglin |
| 2009 | FOCS | Smoothed Analysis of Multiobjective Optimization. | Heiko Rglin, Shang-Hua Teng |
| 2009 | ISAAC | Worst-Case and Smoothed Analysis of | Bodo Manthey, Heiko Rglin |
| 2009 | SODA | Improved smoothed analysis of the | Bodo Manthey, Heiko Rglin |
| 2009 | STACS | Economical Caching. | Matthias Englert, Heiko Rglin, Jacob Spnemann, Berthold Vcking |
| 2008 | SIROCCO | Computing Approximate Nash Equilibria in Network Congestion Games. | Andreas Emil Feldmann, Heiko Rglin, Berthold Vcking |
| 2007 | IPCO | The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization. | Ren Beier, Heiko Rglin, Berthold Vcking |
| 2007 | SODA | Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP: extended abstract. | Matthias Englert, Heiko Rglin, Berthold Vcking |
| 2006 | FOCS | On the Impact of Combinatorial Structure on Congestion Games. | Heiner Ackermann, Heiko Rglin, Berthold Vcking |
| 2005 | IPCO | Smoothed Analysis of Integer Programming. | Heiko Rglin, Berthold Vcking |
| 2005 | ISAAC | Decision Making Based on Approximate and Smoothed Pareto Curves. | Heiner Ackermann, Alantha Newman, Heiko Rglin, Berthold Vcking |
| 2004 | PPSN | Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization. | Patrick Briest, Dimo Brockhoff, Bastian Degener, Matthias Englert, Christian Gunia, Oliver Heering, Thomas Jansen, Michael Leifhelm, Kai Plociennik, Heiko Rglin, Andrea Schweer, Dirk Sudholt, Stefan Tannenbaum, Ingo Wegener |
| 2004 | PPSN | The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes. | Patrick Briest, Dimo Brockhoff, Bastian Degener, Matthias Englert, Christian Gunia, Oliver Heering, Thomas Jansen, Michael Leifhelm, Kai Plociennik, Heiko Rglin, Andrea Schweer, Dirk Sudholt, Stefan Tannenbaum, Ingo Wegener |