Heiko Röglin

	2009
28		Maria-Florina Balcan, Heiko Röglin, Shang-Hua Teng: Agnostic Clustering. ALT 2009: 384-398
27		Bodo Manthey, Heiko Röglin: Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences. ISAAC 2009: 1024-1033
26		Bodo Manthey, Heiko Röglin: Improved smoothed analysis of the k-means method. SODA 2009: 461-470
25		Matthias Englert, Heiko Röglin, Jacob Spönemann, Berthold Vöcking: Economical Caching. STACS 2009: 385-396
24		Martin Hoefer, Vahab S. Mirrokni, Heiko Röglin, Shang-Hua Teng: Competitive Routing over Time. WINE 2009: 18-29
23		David Arthur, Bodo Manthey, Heiko Röglin: k-Means has Polynomial Smoothed Complexity CoRR abs/0904.1113: (2009)
22		Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking: Uncoordinated two-sided matching markets. SIGecom Exchanges 8(1): (2009)
21		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)
	2008
20		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
19		Andreas Emil Feldmann, Heiko Röglin, Berthold Vöcking: Computing Approximate Nash Equilibria in Network Congestion Games. SIROCCO 2008: 209-220
18		Patrick Briest, Paul W. Goldberg, Heiko Röglin: Approximate Equilibria in Games with Few Players CoRR abs/0804.4524: (2008)
17		Heiner Ackermann, Heiko Röglin: On the Convergence Time of the Best Response Dynamics in Player-specific Congestion Games CoRR abs/0805.1130: (2008)
16		Bodo Manthey, Heiko Röglin: Improved Smoothed Analysis of the k-Means Method CoRR abs/0809.1715: (2008)
15		Heiner Ackermann, Heiko Röglin, Berthold Vöcking: On the impact of combinatorial structure on congestion games. J. ACM 55(6): (2008)
	2007
14		René Beier, Heiko Röglin, Berthold Vöcking: The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization. IPCO 2007: 53-67
13		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
12		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
11		Heiko Röglin, Berthold Vöcking: Smoothed analysis of integer programming. Math. Program. 110(1): 21-56 (2007)
10		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)
	2006
9		Heiner Ackermann, Heiko Röglin, Berthold Vöcking: On the Impact of Combinatorial Structure on Congestion Games. FOCS 2006: 613-622
8		Matthias Englert, Heiko Röglin, Matthias Westermann: Evaluation of Online Strategies for Reordering Buffers. WEA 2006: 183-194
7		Heiner Ackermann, Heiko Röglin, Berthold Vöcking: Pure Nash Equilibria in Player-Specific and Weighted Congestion Games. WINE 2006: 50-61
6		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)
5		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
4		Heiko Röglin, Berthold Vöcking: Smoothed Analysis of Integer Programming. IPCO 2005: 276-290
3		Heiner Ackermann, Alantha Newman, Heiko Röglin, Berthold Vöcking: Decision Making Based on Approximate and Smoothed Pareto Curves. ISAAC 2005: 675-684
	2004
2		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
1		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

1	Heiner Ackermann	[3] [6] [7] [9] [10] [12] [15] [17] [20] [21] [22]
2	David Arthur	[23]
3	Maria-Florina Balcan (Maria-Florina Popa)	[28]
4	René Beier	[14]
5	Patrick Briest	[1] [2] [18]
6	Dimo Brockhoff	[1] [2]
7	Bastian Degener	[1] [2]
8	Matthias Englert	[1] [2] [5] [8] [13] [25]
9	Andreas Emil Feldmann	[19]
10	Paul W. Goldberg	[12] [18] [20] [22]
11	Christian Gunia	[1] [2]
12	Oliver Heering	[1] [2]
13	Martin Hoefer	[24]
14	Thomas Jansen	[1] [2]
15	Michael Leifhelm	[1] [2]
16	Bodo Manthey (Bodo Siebert)	[16] [23] [26] [27]
17	Vahab S. Mirrokni (Seyed Vahab Mirrokni)	[12] [20] [22] [24]
18	Alantha Newman	[3] [10]
19	Kai Plociennik	[1] [2]
20	Andrea Schweer	[1] [2]
21	Jacob Spönemann	[25]
22	Dirk Sudholt	[1] [2]
23	Stefan Tannenbaum	[1] [2]
24	Shang-Hua Teng	[24] [28]
25	Berthold Vöcking	[3] [4] [5] [6] [7] [9] [10] [11] [12] [13] [14] [15] [19] [20] [21] [22] [25]
26	Ingo Wegener	[1] [2]
27	Matthias Westermann	[8]

Colors in the list of coauthors