MPI-INF Logo

MPI-INF D1 Publications

Search the publication database
.
Return

Your search returned the following 15 documents:

  1. Energy-Efficient Paths in Radio Networks
    Rene Beier, Stefan Funke, Domagoj Matijevic, and Peter Sanders
    Algorithmica 61 (2): 298-319, 2011
  2. The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
    René Beier, Heiko Röglin, and Berthold Vöcking
    In: Integer Programming and Combinatorial Optimization : 12th International IPCO Conference, Ithaca, USA, 2007, 53-67. Note: To Appear

  3. An Experimental Study of Random Knapsack Problems
    René Beier and Berthold Vöcking
    Algorithmica 45 (1): 121-136, 2006

  4. Computing Equilibria for a Service Provider Game with (Im)perfect Information
    René Beier, Artur Czumaj, Piotr Krysta, and Berthold Vöcking
    ACM Transactions on Algorithms 2 (4): 679-706, 2006

  5. Typical Properties of Winners and Losers in Discrete Optimization
    René Beier and Berthold Vöcking
    SIAM Journal on Computing 35 (4): 855-881, 2006

  6. Computing Equilibria for Congestion Games with (Im)perfect Information
    Rene Beier, Piotr Krysta, Artur Czumaj, and Berthold Vöcking
    In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), New Orleans, USA, January, 11-13, 2004, 739-748
  7. Probabilistic Analysis of Discrete Optimization Problems
    Rene Beier
    Doctoral dissertation, Universität des Saarlandes, 2004
  8. Probabilistic Analysis of Knapsack Core Algorithms
    Rene Beier and Berthold Vöcking
    In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), New Orleans, USA, January, 11-13, 2004, 461-470
  9. Random knapsack in expected polynomial time
    René Beier and Berthold Vöcking
    Journal of Computer and System Sciences 69 (3): 306-329, 2004
  10. Typical Properties of Winners and Losers in Discrete Optimization
    Rene Beier and Berthold Vöcking
    In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC-04), Chicago, USA, 2004, 343-352
  11. Random Knapsack in Expected Polynomial Time
    Rene Beier and Berthold Vöcking
    In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC-03), San Diego, USA, June, 9-11, 2003, 232-241
  12. Smoothed Analysis of Three Combinatorial Problems
    Cyril Banderier, Rene Beier, and Kurt Mehlhorn
    In: Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, Bratislava, Slovak Republic, August, 25 - August, 29, 2003, 198-207

  13. Energy Optimal Routing in Radio Networks Using Geometric Data Structures
    Rene Beier, Peter Sanders, and Naveen Sivadasan
    In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, Málaga, Spain, 2002, 366-376
  14. A powerful heuristic for telephone gossiping
    Rene Beier and Jop F. Sibeyn
    In: Proceedings of the 7th International Colloquium on Structural Information and Communication Complexity (SIROCCO-00), L'Aquila, Italy, June 20-22, 2000, 2000, 17-36
  15. Eine Heuristik für das Gossiping-Problem
    Rene Beier
    Master's thesis, Universität des Saarlandes, 2000