René Beier

According to our database1, René Beier authored at least 15 papers between 2000 and 2012.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2012
Scalable Generation of Synthetic GPS Traces with Real-Life Data Characteristics.
Proceedings of the Selected Topics in Performance Evaluation and Benchmarking, 2012

2011
Energy-Efficient Paths in Radio Networks.
Algorithmica, 2011

The Knapsack Problem.
Proceedings of the Algorithms Unplugged, 2011

2008
Das Rucksackproblem.
Proceedings of the Taschenbuch der Algorithmen, 2008

2007
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization.
Proceedings of the Integer Programming and Combinatorial Optimization, 2007

2006
Computing equilibria for a service provider game with (Im)perfect information.
ACM Trans. Algorithms, 2006

Typical Properties of Winners and Losers in Discrete Optimization.
SIAM J. Comput., 2006

An Experimental Study of Random Knapsack Problems.
Algorithmica, 2006

2005
Probabilistic analysis of discrete optimization problems.
PhD thesis, 2005

2004
Random knapsack in expected polynomial time.
J. Comput. Syst. Sci., 2004

Probabilistic analysis of knapsack core algorithms.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Computing equilibria for congestion games with (im)perfect information.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2003
Smoothed Analysis of Three Combinatorial Problems.
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

2002
Energy Optimal Routing in Radio Networks Using Geometric Data Structures.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2000
A powerful heuristic for telephone gossiping.
Proceedings of the SIROCCO 7, 2000


  Loading...