MPI-INF D1 Publications

Search the publication database

Your search returned the following 7 documents:

  1. Facets for Art Gallery Problems
    Sándor P. Fekete, Stephan Friedrichs, Alexander Kröller, and Christiane Schmidt
    In: Computing and Combinatorics, Hangzhou, China, 2013, 208-220
  2. On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets
    Khaled M. Elbassioni, Kazuhisa Makino, Kurt Mehlhorn, and Fahimeh Ramezani
    In: 19th Annual International Computing and Combinatorics Conference (COCOON-13), Hangzhou, China, 2013, 65-76
  3. On Parameterized Independent Feedback Vertex Set
    Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, and Saket Saurabh
    In: Computing and Combinatorics - 17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings, Dallas, USA, 2011, 98-109
    [PDF: Download: ifvs.pdf]
  4. Max-coloring paths: Tight bounds and extensions
    Telikepalli Kavitha and Julian Mestre
    In: Algorithms and Computation : 20th International Symposium, ISAAC 2009, Hawai, USA, 2009, 87-96
  5. Strong robustness of randomized rumor spreading protocols
    Benjamin Doerr, Anna Huber, and Ariel Levavi
    In: Algorithms and Computation : 20th International Symposium, ISAAC 2009, Hawaii, USA, 2009, 812-821. Note: Full version available from arXiv:1001.3056
  6. Semidefinite programming and its applications to NP problems
    Roman Bacik and Sanjeev Mahajan
    In: Computing and Combinatorics: 1st Annual International Conference (COCOON95), Xi'an, China, August, 24th - 26th, 1995, 566-575
  7. Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs
    Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, and Vladimir Gurvich
    In: Algorithms and computation : 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, 2005, 156-165