MPI-INF Logo

MPI-INF D1 Publications

Search the publication database
.
Return

Your search returned the following 4 documents:

  1. Deterministic Polynomial-Time Algorithms for Designing Short DNA Words
    Ming-Yang Kao, Henry C. M. Leung, He Sun, and Yong Zhang
    In: Theory and Applications of Models of Computation : 7th Annual Conference, TAMC 2010, Prague, Czech Republic, 2010, 308-319
  2. Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs
    Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, and Evi Papaioannou
    In: 29th Symposium on Mathematical Foundations of Computer Science MFCS 2004, Prague, Czech Republic, 2007, 119-136
  3. Approximating Earliest Arrival Flows with Flow-Dependent Transit Times
    Nadine Baumann and Ekkehard Köhler
    In: Mathematical foundations of computer science 2004 : 29th International Symposium, MFCS 2004, Prague, Czech Republic, 2004, 599-610
  4. Generating Paths and Cuts in Multi-pole (Di)graphs
    Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, and Kazuhisa Makino
    In: Mathematical foundations of computer science 2004 : 29th International Symposium, MFCS 2004, Prague, Czech Republic, 2004, 298-309
    [PDF: Download: MFCS04.pdf]