Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Heiko Röglin
Heiko Roeglin
2010 – today
- 2013
[c32]Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin: Smoothed analysis of the successive shortest path algorithm. CTW 2013: 27-30- [c31]Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin: Smoothed Analysis of the Successive Shortest Path Algorithm. SODA 2013: 1180-1189
- [c30]Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin: Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching. WALCOM 2013: 182-193
- [i13]Tobias Brunsch, Heiko Röglin: Finding Short Paths on Polytopes by the Shadow Vertex Algorithm. CoRR abs/1304.7235 (2013)
- 2012
- [j14]Konstantin Voevodski, Maria-Florina Balcan, Heiko Röglin, Shang-Hua Teng, Yu Xia: Active Clustering of Biological Sequences. Journal of Machine Learning Research 13: 203-225 (2012)
- [j13]Andreas Emil Feldmann, Heiko Röglin, Berthold Vöcking: Computing approximate Nash equilibria in network congestion games. Networks 59(4): 380-386 (2012)
- [j12]Timo Kötzing, Frank Neumann, Heiko Röglin, Carsten Witt: Theoretical analysis of two ACO approaches for the traveling salesman problem. Swarm Intelligence 6(1): 1-21 (2012)
- [c29]Tobias Brunsch, Heiko Röglin: Improved smoothed analysis of multiobjective optimization. STOC 2012: 407-426
- [i12]Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin: Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching. CoRR abs/1211.3299 (2012)
- 2011
- [j11]Bodo Manthey, Heiko Röglin: Smoothed Analysis: Analysis of Algorithms Beyond Worst Case. it - Information Technology 53(6): 280-286 (2011)
- [j10]David Arthur, Bodo Manthey, Heiko Röglin: Smoothed Analysis of the k-Means Method. J. ACM 58(5): 19 (2011)
- [j9]Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking: Uncoordinated Two-Sided Matching Markets. SIAM J. Comput. 40(1): 92-106 (2011)
- [j8]Martin Hoefer, Vahab S. Mirrokni, Heiko Röglin, Shang-Hua Teng: Competitive routing over time. Theor. Comput. Sci. 412(39): 5420-5432 (2011)
- [c28]Tobias Brunsch, Heiko Röglin, Cyriel Rutten, Tjark Vredeveld: Smoothed Performance Guarantees for Local Search. ESA 2011: 772-783
- [c27]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: 192-206
- [c26]
- [c25]Tobias Brunsch, Heiko Röglin: Lower Bounds for the Smoothed Number of Pareto Optimal Solutions. TAMC 2011: 416-427
- [c24]André Berger, Heiko Röglin, Ruben van der Zwaan: Path Trading: Fast Algorithms, Smoothed Analysis, and Hardness Results. SEA 2011: 43-53
- [i11]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 abs/1101.3620 (2011)
- [i10]Tobias Brunsch, Heiko Röglin, Cyriel Rutten, Tjark Vredeveld: Smoothed Performance Guarantees for Local Search. CoRR abs/1105.2686 (2011)
- [i9]Tobias Brunsch, Heiko Röglin: Improved Smoothed Analysis of Multiobjective Optimization. CoRR abs/1111.1546 (2011)
- 2010
- [c23]Timo Kötzing, Frank Neumann, Heiko Röglin, Carsten Witt: Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem. ANTS Conference 2010: 324-335
- [c22]Heiner Ackermann, Heiko Röglin, Ulf Schellbach, Nils Schweer: Analysis of Algorithms. Algorithm Engineering 2010: 127-193
- [c21]Konstantin Voevodski, Maria-Florina Balcan, Heiko Röglin, Shang-Hua Teng, Yu Xia: Efficient Clustering with Limited Distance Information. UAI 2010: 632-640
- [c20]Patrick Briest, Heiko Röglin: The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers. WAOA 2010: 47-58
- [i8]Konstantin Voevodski, Maria-Florina Balcan, Heiko Röglin, Shang-Hua Teng, Yu Xia: Efficient Clustering with Limited Distance Information. CoRR abs/1009.5168 (2010)
- [i7]Tobias Brunsch, Heiko Roeglin: Lower Bounds for the Smoothed Number of Pareto optimal Solutions. CoRR abs/1012.1163 (2010)
2000 – 2009
- 2009
- [j7]Matthias Englert, Heiko Röglin, Matthias Westermann: Evaluation of online strategies for reordering buffers. ACM Journal of Experimental Algorithmics 14 (2009)
- [j6]Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking: Uncoordinated two-sided matching markets. SIGecom Exchanges 8(1) (2009)
- [j5]Heiner Ackermann, Heiko Röglin, Berthold Vöcking: Pure Nash equilibria in player-specific and weighted congestion games. Theor. Comput. Sci. 410(17): 1552-1563 (2009)
- [c19]
- [c18]David Arthur, Bodo Manthey, Heiko Röglin: k-Means Has Polynomial Smoothed Complexity. FOCS 2009: 405-414
- [c17]
- [c16]Bodo Manthey, Heiko Röglin: Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences. ISAAC 2009: 1024-1033
- [c15]
- [c14]Matthias Englert, Heiko Röglin, Jacob Spönemann, Berthold Vöcking: Economical Caching. STACS 2009: 385-396
- [c13]Martin Hoefer, Vahab S. Mirrokni, Heiko Röglin, Shang-Hua Teng: Competitive Routing over Time. WINE 2009: 18-29
- [i6]David Arthur, Bodo Manthey, Heiko Röglin: k-Means has Polynomial Smoothed Complexity. CoRR abs/0904.1113 (2009)
- 2008
- [j4]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 Mathematics 5(4): 439-457 (2008)
- [j3]Heiner Ackermann, Heiko Röglin, Berthold Vöcking: On the impact of combinatorial structure on congestion games. J. ACM 55(6) (2008)
- [c12]Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking: Uncoordinated two-sided matching markets. ACM Conference on Electronic Commerce 2008: 256-263
- [c11]Andreas Emil Feldmann, Heiko Röglin, Berthold Vöcking: Computing Approximate Nash Equilibria in Network Congestion Games. SIROCCO 2008: 209-220
- [i5]Patrick Briest, Paul W. Goldberg, Heiko Röglin: Approximate Equilibria in Games with Few Players. CoRR abs/0804.4524 (2008)
- [i4]Heiner Ackermann, Heiko Röglin: On the Convergence Time of the Best Response Dynamics in Player-specific Congestion Games. CoRR abs/0805.1130 (2008)
- [i3]Bodo Manthey, Heiko Röglin: Improved Smoothed Analysis of the k-Means Method. CoRR abs/0809.1715 (2008)
- 2007
- [j2]Heiko Röglin, Berthold Vöcking: Smoothed analysis of integer programming. Math. Program. 110(1): 21-56 (2007)
- [j1]Heiner Ackermann, Alantha Newman, Heiko Röglin, Berthold Vöcking: Decision-making based on approximate and smoothed Pareto curves. Theor. Comput. Sci. 378(3): 253-270 (2007)
- [c10]René Beier, Heiko Röglin, Berthold Vöcking: The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization. IPCO 2007: 53-67
- [c9]Matthias Englert, Heiko Röglin, Berthold Vöcking: Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP: extended abstract. SODA 2007: 1295-1304
- [c8]Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking: A Unified Approach to Congestion Games and Two-Sided Markets. WINE 2007: 30-41
- 2006
- [c7]Heiner Ackermann, Heiko Röglin, Berthold Vöcking: On the Impact of Combinatorial Structure on Congestion Games. FOCS 2006: 613-622
- [c6]Matthias Englert, Heiko Röglin, Matthias Westermann: Evaluation of Online Strategies for Reordering Buffers. WEA 2006: 183-194
- [c5]Heiner Ackermann, Heiko Röglin, Berthold Vöcking: Pure Nash Equilibria in Player-Specific and Weighted Congestion Games. WINE 2006: 50-61
- [i2]Heiner Ackermann, Heiko Röglin, Berthold Vöcking: On the Impact of Combinatorial Structure on Congestion Games. Electronic Colloquium on Computational Complexity (ECCC) 13(067) (2006)
- [i1]Matthias Englert, Heiko Röglin, Berthold Vöcking: Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP. Electronic Colloquium on Computational Complexity (ECCC) 13(092) (2006)
- 2005
- [c4]
- [c3]Heiner Ackermann, Alantha Newman, Heiko Röglin, Berthold Vöcking: Decision Making Based on Approximate and Smoothed Pareto Curves. ISAAC 2005: 675-684
- 2004
- [c2]Patrick Briest, Dimo Brockhoff, Bastian Degener, Matthias Englert, Christian Gunia, Oliver Heering, Thomas Jansen, Michael Leifhelm, Kai Plociennik, Heiko Röglin, Andrea Schweer, Dirk Sudholt, Stefan Tannenbaum, Ingo Wegener: Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization. PPSN 2004: 21-30
- [c1]Patrick Briest, Dimo Brockhoff, Bastian Degener, Matthias Englert, Christian Gunia, Oliver Heering, Thomas Jansen, Michael Leifhelm, Kai Plociennik, Heiko Röglin, Andrea Schweer, Dirk Sudholt, Stefan Tannenbaum, Ingo Wegener: The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes. PPSN 2004: 31-40
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-17 21:52 CEST by the dblp team