A powerful heuristic for telephone gossiping. - René Beier; Jop F. Sibeyn (SIROCCO, 2000)

Energy Optimal Routing in Radio Networks Using Geometric Data Structures. - René Beier; Peter Sanders 001; Naveen Sivadasan (ICALP, 2002)

Smoothed Analysis of Three Combinatorial Problems. - Cyril Banderier; René Beier; Kurt Mehlhorn (MFCS, 2003)

Computing equilibria for congestion games with (im)perfect information. - René Beier; Artur Czumaj; Piotr Krysta; Berthold Vöcking (SODA, 2004)

Probabilistic analysis of knapsack core algorithms. - René Beier; Berthold Vöcking (SODA, 2004)

Random knapsack in expected polynomial time. - René Beier; Berthold Vöcking (J. Comput. Syst. Sci., 2004)

Probabilistic analysis of discrete optimization problems. - René Beier (2005)

An Experimental Study of Random Knapsack Problems. - René Beier; Berthold Vöcking (Algorithmica, 2006)

Typical Properties of Winners and Losers in Discrete Optimization. - René Beier; Berthold Vöcking (SIAM J. Comput., 2006)

Computing equilibria for a service provider game with (Im)perfect information. - René Beier; Artur Czumaj; Piotr Krysta; Berthold Vöcking (ACM Trans. Algorithms, 2006)

The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization. - René Beier; Heiko Röglin; Berthold Vöcking (IPCO, 2007)

Das Rucksackproblem. - René Beier; Berthold Vöcking (Taschenbuch der Algorithmen, 2008)

The Knapsack Problem. - René Beier; Berthold Vöcking (Algorithms Unplugged, 2011)

Energy-Efficient Paths in Radio Networks. - René Beier; Stefan Funke; Domagoj Matijevic; Peter Sanders 001 (Algorithmica, 2011)

Scalable Generation of Synthetic GPS Traces with Real-Life Data Characteristics. - Konrad Bösche; Thibault Sellam; Holger Pirk; René Beier; Peter Mieth; Stefan Manegold (TPCTC, 2012)

The smoothed number of Pareto-optimal solutions in bicriteria integer optimization. - René Beier; Heiko Röglin; Clemens Rösner; Berthold Vöcking (Math. Program., 2023)