René Beier

19 papers A* 5A 1B 3Journal 6Unranked 1
YearRankTypeTitle / Venue / Authors
2023 J jnl
The smoothed number of Pareto-optimal solutions in bicriteria integer optimization.
Math. Program.
René Beier, Heiko Röglin, Clemens Rösner, Berthold Vöcking
2012 — conf
Scalable Generation of Synthetic GPS Traces with Real-Life Data Characteristics.
TPCTC
Konrad Bösche, Thibault Sellam, Holger Pirk, René Beier, Peter Mieth, Stefan Manegold
2011 J jnl
Energy-Efficient Paths in Radio Networks.
Algorithmica
René Beier, Stefan Funke, Domagoj Matijevic, Peter Sanders
2011 — ch.
The Knapsack Problem.
Algorithms Unplugged
René Beier, Berthold Vöcking
2008 — ch.
Das Rucksackproblem.
Taschenbuch der Algorithmen
René Beier, Berthold Vöcking
2007 B conf
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization.
IPCO
René Beier, Heiko Röglin, Berthold Vöcking
2006 J jnl
An Experimental Study of Random Knapsack Problems.
Algorithmica
René Beier, Berthold Vöcking
2006 J jnl
Computing equilibria for a service provider game with (Im)perfect information.
ACM Trans. Algorithms
René Beier, Artur Czumaj, Piotr Krysta, Berthold Vöcking
2006 J jnl
Typical Properties of Winners and Losers in Discrete Optimization.
SIAM J. Comput.
René Beier, Berthold Vöcking
2005 — —
Probabilistic analysis of discrete optimization problems.
René Beier
2004 A conf
An Experimental Study of Random Knapsack Problems.
ESA
René Beier, Berthold Vöcking
2004 A* conf
Computing equilibria for congestion games with (im)perfect information.
SODA
René Beier, Artur Czumaj, Piotr Krysta, Berthold Vöcking
2004 A* conf
Probabilistic analysis of knapsack core algorithms.
SODA
René Beier, Berthold Vöcking
2004 J jnl
Random knapsack in expected polynomial time.
J. Comput. Syst. Sci.
René Beier, Berthold Vöcking
2004 A* conf
Typical properties of winners and losers in discrete optimization.
STOC
René Beier, Berthold Vöcking
2003 A* conf
Random knapsack in expected polynomial time.
STOC
René Beier, Berthold Vöcking
2003 B conf
Smoothed Analysis of Three Combinatorial Problems.
MFCS
Cyril Banderier, René Beier, Kurt Mehlhorn
2002 A* conf
Energy Optimal Routing in Radio Networks Using Geometric Data Structures.
ICALP
René Beier, Peter Sanders, Naveen Sivadasan
2000 B conf
A powerful heuristic for telephone gossiping.
SIROCCO
René Beier, Jop F. Sibeyn