MPI-INF Logo

MPI-INF D1 Publications

Search the publication database
.
Return

Your search returned the following 6 documents:

  1. Nikolaos Fountoulakis and Konstantinos Panagiotou
    Rumor spreading on random regular graphs and expanders
    In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 13th Internationa lWorkshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, Barcelona, Spain, 2010, 560-573
  2. MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, and Julian Mestre
    The Checkpoint Problem
    In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 13th International Workshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, Barcelona, Spain, 2010, 219-231
  3. Jens Maue, Peter Sanders, and Domagoj Matijevic
    Goal Directed Shortest Path Queries Using Precomputed Cluster Distances
    In: Experimental Algorithms, 5th International Workshop, WEA 2006, Cala Galdana, Menorca, Spain, 2006, 316-327
  4. C. P. Schnorr and C. R. Subramanian
    Almost optimal (on the average) algorithms for boolean matrix product witnesses, computing the diameter
    In: Proceedings of the 2nd International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM-98), Barcelona, Spain, October 1998, 1998, 218-231
  5. Jordan Gergov
    Approximation Algorithms for Dynamic Storage Allocation
    In: Algorithms - ESA '96: 4th Annual European Symposium, Barcelona, September, 25-27, 1996, 52-61
  6. Srinivasa Rao Arikati, Danny Z. Chen, L. Paul Chew, Gautam Das, Michiel Smid, and Christos Zaroliagis
    Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane
    In: Algorithms - ESA '96: 4th Annual European Symposium, Barcelona, September, 25th-27th, 1996, 514-528