MPI-INF Logo

MPI-INF D1 Publications

Search the publication database
.
Return

Your search returned the following 3 documents:

  1. Maximal Biconnected Subgraphs of Random Planar Graphs
    Konstantinos Panagiotou and Angelika Steger
    In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), New York, NY, USA, 2009, 432-440
  2. On the approximability of the maximum feasible subsystem problem with 0/1-coefficients
    Khaled Elbassioni, Rajiv Raman, Saurabh Ray, and Rene Sitters
    In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), New York, NY, USA, 2009, 1210-1219, paper no. 12.B.
  3. Pairing Heaps with O(log log n) decrease Cost
    Amr Elmasry
    In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), New York, USA, 2009, 471-476
    [PDF: Download: paper.pdf]