MPI-INF Logo

MPI-INF D1 Publications

Search the publication database
.
Return

Your search returned the following 5 documents:

  1. On the Bollobas-Eidrigde conjecture for bipartite graphs
    Bela Csaba
    Combinatorics, Probability and Computing 16 (1): 1-31, 2007
  2. A randomized on-line algorithm for the k-server problem on the line
    Bela Csaba and S. Lodha
    Random Structures and Algorithms 29 (1): 82-104, 2006
  3. Proof of a conjecture of Bollobas and Eldridge for graphs of maximum degree three
    Bela Csaba
    Combinatorica 23 (1): 35-72, 2003
  4. A randomized on-line algorithm for the k-server problem on a line
    Bela Csaba and Sachin Lodha
    DIMACS-Center for Discrete Mathematics & Theoretical Computer Science, Piscataway, DIMACS TechReport 2001-34, Technical Report
  5. Approximability of Dense and Sparse Instances of Minimum 2-Connectivity, TSP and Path Problems
    Bela Csaba, Piotr Krysta, and Marek Karpinski
    In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-02), San Francisco, CA, USA, 2002, 74-83