Algorithms – ESA 2010

18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part I

Editors:

ISBN: 978-3-642-15774-5 (Print) 978-3-642-15775-2 (Online)

Table of contents (49 chapters)

previous Page of 3
  1. Front Matter

    Pages -

  2. Invited Talk

    1. No Access

      Book Chapter

      Pages 1-10

      The Robustness of Level Sets

  3. Session 1a

    1. No Access

      Book Chapter

      Pages 11-22

      Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods

    2. No Access

      Book Chapter

      Pages 23-35

      Non-clairvoyant Speed Scaling for Weighted Flow Time

    3. No Access

      Book Chapter

      Pages 36-47

      A Robust PTAS for Machine Covering and Packing

  4. Session 1b

    1. No Access

      Book Chapter

      Pages 48-59

      Balancing Degree, Diameter and Weight in Euclidean Spanners

    2. No Access

      Book Chapter

      Pages 60-71

      Testing Euclidean Spanners

    3. No Access

      Book Chapter

      Pages 72-83

      Fast Approximation in Subspaces by Doubling Metric Decomposition

    4. No Access

      Book Chapter

      Pages 84-96

      f -Sensitivity Distance Oracles and Routing Schemes

  5. Session 2a

    1. No Access

      Book Chapter

      Pages 97-109

      Fast Minor Testing in Planar Graphs

    2. No Access

      Book Chapter

      Pages 110-121

      On the Number of Spanning Trees a Planar Graph Can Have

    3. No Access

      Book Chapter

      Pages 122-133

      Contractions of Planar Graphs in Polynomial Time

  6. Session 2b

    1. No Access

      Book Chapter

      Pages 134-145

      Communication Complexity of Quasirandom Rumor Spreading

    2. No Access

      Book Chapter

      Pages 146-157

      A Complete Characterization of Group-Strategyproof Mechanisms of Cost-Sharing

    3. No Access

      Book Chapter

      Pages 158-169

      Contribution Games in Social Networks

  7. Session 3a

    1. No Access

      Book Chapter

      Pages 170-181

      Improved Bounds for Online Stochastic Matching

    2. No Access

      Book Chapter

      Pages 182-194

      Online Stochastic Packing Applied to Display Ad Allocation

    3. No Access

      Book Chapter

      Pages 195-206

      Caching Is Hard – Even in the Fault Model

  8. Session 3b

    1. No Access

      Book Chapter

      Pages 207-218

      Superselectors: Efficient Constructions and Applications

    2. No Access

      Book Chapter

      Pages 219-230

      Estimating the Average of a Lipschitz-Continuous Function from One Sample

    3. No Access

      Book Chapter

      Pages 231-242

      Streaming Graph Computations with a Helpful Advisor

previous Page of 3