MPI-INF Logo

MPI-INF D1 Publications

Search the publication database
.
Return

Your search returned the following 6 documents:

  1. Coloring random graphs online without creating monochromatic subgraphs
    Torsten Mütze, Thomas Rast, and Reto Spöhel
    In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), San Francisco, CA, 2011, 145-158
  2. Distributed Selfish Load Balancing on Networks
    Petra Berenbrink, Martin Hoefer, and Thomas Sauerwald
    In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), San Francisco, CA, 2011, 1487-1497
  3. On the Degree Sequence of Random Planar Graphs
    Konstantinos Panagiotou and Angelika Steger
    In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), San Francisco, CA, 2011, 1198-1210
  4. Randomized Diffusion for Indivisible Loads
    Petra Berenbrink, Colin Cooper, Tom Friedetzky, Tobias Friedrich, and Thomas Sauerwald
    In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), San Francisco, CA, 2011, 429-439
  5. Rumor Spreading and Vertex Expansion on Regular Graphs
    Thomas Sauerwald and Alexandre Stauffer
    In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), San Francisco, CA, 2011, 462-475
  6. The Multiple-orientability Thresholds for Random Hypergraphs
    Nikolaos Fountoulakis, Megha Khosla, and Konstantinos Panagiotou
    In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), San Francisco, CA, 2011, 1222-1236