| 2008 |
|---|
| 14 | EE | René Beier,
Berthold Vöcking:
Das Rucksackproblem.
Taschenbuch der Algorithmen 2008: 405-411 |
| 2007 |
|---|
| 13 | EE | René Beier,
Heiko Röglin,
Berthold Vöcking:
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization.
IPCO 2007: 53-67 |
| 2006 |
|---|
| 12 | EE | René Beier,
Artur Czumaj,
Piotr Krysta,
Berthold Vöcking:
Computing equilibria for a service provider game with (Im)perfect information.
ACM Transactions on Algorithms 2(4): 679-706 (2006) |
| 11 | EE | René Beier,
Berthold Vöcking:
An Experimental Study of Random Knapsack Problems.
Algorithmica 45(1): 121-136 (2006) |
| 10 | EE | René Beier,
Berthold Vöcking:
Typical Properties of Winners and Losers in Discrete Optimization.
SIAM J. Comput. 35(4): 855-881 (2006) |
| 2004 |
|---|
| 9 | EE | René Beier,
Berthold Vöcking:
An Experimental Study of Random Knapsack Problems.
ESA 2004: 616-627 |
| 8 | EE | René Beier,
Berthold Vöcking:
Probabilistic analysis of knapsack core algorithms.
SODA 2004: 468-477 |
| 7 | EE | René Beier,
Artur Czumaj,
Piotr Krysta,
Berthold Vöcking:
Computing equilibria for congestion games with (im)perfect information.
SODA 2004: 746-755 |
| 6 | EE | René Beier,
Berthold Vöcking:
Typical properties of winners and losers in discrete optimization.
STOC 2004: 343-352 |
| 5 | EE | René Beier,
Berthold Vöcking:
Random knapsack in expected polynomial time.
J. Comput. Syst. Sci. 69(3): 306-329 (2004) |
| 2003 |
|---|
| 4 | EE | Cyril Banderier,
René Beier,
Kurt Mehlhorn:
Smoothed Analysis of Three Combinatorial Problems.
MFCS 2003: 198-207 |
| 3 | EE | René Beier,
Berthold Vöcking:
Random knapsack in expected polynomial time.
STOC 2003: 232-241 |
| 2002 |
|---|
| 2 | EE | René Beier,
Peter Sanders,
Naveen Sivadasan:
Energy Optimal Routing in Radio Networks Using Geometric Data Structures.
ICALP 2002: 366-376 |
| 2000 |
|---|
| 1 | | René Beier,
Jop F. Sibeyn:
A powerful heuristic for telephone gossiping.
SIROCCO 2000: 17-35 |
