Publications :: Search

Show author

On this page you see the details of the selected author.

Author information
First name:	René
Last name:	Beier
DBLP:	22/5581
Rating:	(not rated yet)
Bookmark:

Below you find the publications which have been written by this author.

Show item 1 to 14 of 14  

Select a publication
Show	Title	Venue	Rating	Date
	René Beier, Berthold Vöcking. Das Rucksackproblem.	Taschenbuch der Algorithmen 2008	(0)	2008
	René Beier, Heiko Röglin, Berthold Vöcking. The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization.	Integer Programming and Combinatorial Optimization, 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings 2007	(0)	2007
	René Beier, Berthold Vöcking. An Experimental Study of Random Knapsack Problems.	Algorithmica 2006, Volume 45	(0)	2006
	René Beier, Berthold Vöcking. Typical Properties of Winners and Losers in Discrete Optimization.	SIAM J. Comput. 2006, Volume 35	(0)	2006
	René Beier, Artur Czumaj, Piotr Krysta, Berthold Vöcking. Computing equilibria for a service provider game with (Im)perfect information.	ACM Transactions on Algorithms 2006, Volume 2	(0)	2006
	René Beier, Berthold Vöcking. An Experimental Study of Random Knapsack Problems.	Algorithms - ESA 2004, 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings 2004	(0)	2004
	René Beier, Artur Czumaj, Piotr Krysta, Berthold Vöcking. Computing equilibria for congestion games with (im)perfect information.	Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004 2004	(0)	2004
	René Beier, Berthold Vöcking. Probabilistic analysis of knapsack core algorithms.	Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004 2004	(0)	2004
	René Beier, Berthold Vöcking. Typical properties of winners and losers in discrete optimization.	Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004 2004	(0)	2004
	René Beier, Berthold Vöcking. Random knapsack in expected polynomial time.	J. Comput. Syst. Sci. 2004, Volume 69	(0)	2004
	Cyril Banderier, René Beier, Kurt Mehlhorn. Smoothed Analysis of Three Combinatorial Problems.	Mathematical Foundations of Computer Science 2003, 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings 2003	(0)	2003
	René Beier, Berthold Vöcking. Random knapsack in expected polynomial time.	Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA 2003	(0)	2003
	René Beier, Peter Sanders, Naveen Sivadasan. Energy Optimal Routing in Radio Networks Using Geometric Data Structures.	Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings 2002	(0)	2002
	René Beier, Jop F. Sibeyn. A powerful heuristic for telephone gossiping.	SIROCCO 7, Proceedings of the 7th International Colloquium on Structural Information and Communication Complexity, Laquila, Italy, June 20-22, 2000 2000	(0)	2000

Your query returned 14 matches in the database.