default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRené Beier
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j6]René Beier, Heiko Röglin
, Clemens Rösner, Berthold Vöcking:
The smoothed number of Pareto-optimal solutions in bicriteria integer optimization. Math. Program. 200(1): 319-355 (2023)
2010 – 2019
- 2012
- [c10]Konrad Bösche, Thibault Sellam, Holger Pirk, René Beier, Peter Mieth, Stefan Manegold:
Scalable Generation of Synthetic GPS Traces with Real-Life Data Characteristics. TPCTC 2012: 140-155 - 2011
- [j5]René Beier, Stefan Funke, Domagoj Matijevic, Peter Sanders:
Energy-Efficient Paths in Radio Networks. Algorithmica 61(2): 298-319 (2011) - [p2]René Beier, Berthold Vöcking:
The Knapsack Problem. Algorithms Unplugged 2011: 375-381
2000 – 2009
- 2008
- [p1]René Beier, Berthold Vöcking:
Das Rucksackproblem. Taschenbuch der Algorithmen 2008: 405-411 - 2007
- [c9]René Beier, Heiko Röglin, Berthold Vöcking:
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization. IPCO 2007: 53-67 - 2006
- [j4]René Beier, Berthold Vöcking:
An Experimental Study of Random Knapsack Problems. Algorithmica 45(1): 121-136 (2006) - [j3]René Beier, Berthold Vöcking:
Typical Properties of Winners and Losers in Discrete Optimization. SIAM J. Comput. 35(4): 855-881 (2006) - [j2]René Beier, Artur Czumaj, Piotr Krysta, Berthold Vöcking:
Computing equilibria for a service provider game with (Im)perfect information. ACM Trans. Algorithms 2(4): 679-706 (2006) - 2005
- [b1]René Beier:
Probabilistic analysis of discrete optimization problems. Saarland University, 2005 - 2004
- [j1]René Beier, Berthold Vöcking:
Random knapsack in expected polynomial time. J. Comput. Syst. Sci. 69(3): 306-329 (2004) - [c8]René Beier, Berthold Vöcking:
An Experimental Study of Random Knapsack Problems. ESA 2004: 616-627 - [c7]René Beier, Berthold Vöcking:
Probabilistic analysis of knapsack core algorithms. SODA 2004: 468-477 - [c6]René Beier, Artur Czumaj, Piotr Krysta, Berthold Vöcking:
Computing equilibria for congestion games with (im)perfect information. SODA 2004: 746-755 - [c5]René Beier, Berthold Vöcking:
Typical properties of winners and losers in discrete optimization. STOC 2004: 343-352 - 2003
- [c4]Cyril Banderier, René Beier, Kurt Mehlhorn:
Smoothed Analysis of Three Combinatorial Problems. MFCS 2003: 198-207 - [c3]René Beier, Berthold Vöcking:
Random knapsack in expected polynomial time. STOC 2003: 232-241 - 2002
- [c2]René Beier, Peter Sanders, Naveen Sivadasan:
Energy Optimal Routing in Radio Networks Using Geometric Data Structures. ICALP 2002: 366-376 - 2000
- [c1]René Beier, Jop F. Sibeyn:
A powerful heuristic for telephone gossiping. SIROCCO 2000: 17-35
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
