2009 |
24 | EE | Bodo Manthey,
Heiko Röglin:
Improved smoothed analysis of the k-means method.
SODA 2009: 461-470 |
23 | EE | Matthias Englert,
Heiko Röglin,
Jacob Spönemann,
Berthold Vöcking:
Economical Caching.
STACS 2009: 385-396 |
22 | EE | David Arthur,
Bodo Manthey,
Heiko Röglin:
k-Means has Polynomial Smoothed Complexity
CoRR abs/0904.1113: (2009) |
21 | EE | 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 | EE | 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 | EE | Andreas Emil Feldmann,
Heiko Röglin,
Berthold Vöcking:
Computing Approximate Nash Equilibria in Network Congestion Games.
SIROCCO 2008: 209-220 |
18 | EE | Patrick Briest,
Paul W. Goldberg,
Heiko Röglin:
Approximate Equilibria in Games with Few Players
CoRR abs/0804.4524: (2008) |
17 | EE | 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 | EE | Bodo Manthey,
Heiko Röglin:
Improved Smoothed Analysis of the k-Means Method
CoRR abs/0809.1715: (2008) |
15 | EE | Heiner Ackermann,
Heiko Röglin,
Berthold Vöcking:
On the impact of combinatorial structure on congestion games.
J. ACM 55(6): (2008) |
2007 |
14 | EE | René Beier,
Heiko Röglin,
Berthold Vöcking:
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization.
IPCO 2007: 53-67 |
13 | EE | 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 | EE | 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 | EE | Heiko Röglin,
Berthold Vöcking:
Smoothed analysis of integer programming.
Math. Program. 110(1): 21-56 (2007) |
10 | EE | 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 | EE | Heiner Ackermann,
Heiko Röglin,
Berthold Vöcking:
On the Impact of Combinatorial Structure on Congestion Games.
FOCS 2006: 613-622 |
8 | EE | Matthias Englert,
Heiko Röglin,
Matthias Westermann:
Evaluation of Online Strategies for Reordering Buffers.
WEA 2006: 183-194 |
7 | EE | Heiner Ackermann,
Heiko Röglin,
Berthold Vöcking:
Pure Nash Equilibria in Player-Specific and Weighted Congestion Games.
WINE 2006: 50-61 |
6 | EE | 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 | EE | 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 | EE | Heiko Röglin,
Berthold Vöcking:
Smoothed Analysis of Integer Programming.
IPCO 2005: 276-290 |
3 | EE | 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 | EE | 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 | EE | 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 |