Your search returned the following 10 documents:

10. Bringing Order to Special Cases of Klee’s Measure Problem
    Karl Bringmann
    In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS-13), Klosterneuburg, Austria, 2013, 207-218
    
9. How to Pack Your Items When You Have to Buy Your Knapsack
   Antonios Antoniadis, Chien-Chung Huang, Sebastian Ott, and José Verschae
   In: Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, 2013, 62-73
   
8. Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems
   Karl Bringmann, Christian Engels, Bodo Manthey, and B. V. Raghavendra Rao
   In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS-13), Klosterneuburg, Austria, 2013, 219-230
   
7. Asymptotically Optimal Randomized Rumor Spreading
   Benjamin Doerr and Mahmoud Fouz
   In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, Zürich, Switzerland, 2011, 502-513
   
6. Distance Oracles for Vertex-Labeled Graphs
   Danny Hermelin, Avivit Levy, Oren Weimann, and Raphael Yuster
   In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, Zurich, Switzerland, 2011, 490-501
   
5. Domination When the Stars Are Out
   Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, and Gerhard J. Woeginger
   In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, Zurich, Switzerland, 2011, 462-473
   
4. Meeting deadlines: How much speed suffices?
   S. Anand, Naveen Garg, and Nicole Megow
   In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011. - Pt. I, Zurich, Switzerland, 2011, 232-243
   
3. On Tree-Constrained Matchings and Generalizations
   Stefan Canzar, Khaled Elbassioni, Gunnar W. Klau, and Julian Mestre
   In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, Zurich, Switzerland, 2011, 98-109
   
2. Online Graph Exploration: New Results on Old and New Algorithms
   Nicole Megow, Kurt Mehlhorn, and Pascal Schweitzer
   In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, Zurich, Switzerland, 2011, 478-489
   
1. Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes
   Endre Boros, Khaled Elbassioni, Mahmoud Fouz, Vladimir Gurvich, Kazuhisa Makino, and Bodo Manthey
   In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, Zurich, Switzerland, 2011, 147-158