Book Volume 8037 2013

Algorithms and Data Structures

13th International Symposium, WADS 2013, London, ON, Canada, August 12-14, 2013. Proceedings

Editors:

ISBN: 978-3-642-40103-9 (Print) 978-3-642-40104-6 (Online)

Table of contents (46 chapters)

previous Page of 3
  1. Front Matter

    Pages -

  2. No Access

    Chapter and Conference Paper

    Pages 1-12

    On Maximum Weight Objects Decomposable into Based Rectilinear Convex Objects

  3. No Access

    Chapter and Conference Paper

    Pages 13-24

    Bundling Three Convex Polygons to Minimize Area or Perimeter

  4. No Access

    Chapter and Conference Paper

    Pages 25-36

    Smart-Grid Electricity Allocation via Strip Packing with Slicing

  5. No Access

    Chapter and Conference Paper

    Pages 37-48

    On (Dynamic) Range Minimum Queries in External Memory

  6. No Access

    Chapter and Conference Paper

    Pages 49-60

    Distance-Sensitive Planar Point Location

  7. No Access

    Chapter and Conference Paper

    Pages 61-72

    Time-Space Tradeoffs for All-Nearest-Larger-Neighbors Problems

  8. No Access

    Chapter and Conference Paper

    Pages 73-84

    Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles

  9. No Access

    Chapter and Conference Paper

    Pages 85-96

    Socially Stable Matchings in the Hospitals/Residents Problem

  10. No Access

    Chapter and Conference Paper

    Pages 97-108

    Parameterized Complexity of 1-Planarity

  11. No Access

    Chapter and Conference Paper

    Pages 109-120

    On the Stretch Factor of the Theta-4 Graph

  12. No Access

    Chapter and Conference Paper

    Pages 121-132

    Better Space Bounds for Parameterized Range Majority and Minority

  13. No Access

    Chapter and Conference Paper

    Pages 133-145

    Online Control Message Aggregation in Chain Networks

  14. No Access

    Chapter and Conference Paper

    Pages 146-157

    Fingerprints in Compressed Strings

  15. No Access

    Chapter and Conference Paper

    Pages 158-169

    Beacon-Based Algorithms for Geometric Routing

  16. No Access

    Chapter and Conference Paper

    Pages 170-181

    Interval Selection with Machine-Dependent Intervals

  17. No Access

    Chapter and Conference Paper

    Pages 182-194

    On the Spanning Ratio of Theta-Graphs

  18. No Access

    Chapter and Conference Paper

    Pages 195-206

    Relative Interval Analysis of Paging Algorithms on Access Graphs

  19. No Access

    Chapter and Conference Paper

    Pages 207-218

    On Explaining Integer Vectors by Few Homogenous Segments

  20. No Access

    Chapter and Conference Paper

    Pages 219-230

    Trajectory Grouping Structure

  21. No Access

    Chapter and Conference Paper

    Pages 231-231

    The Art of Shaving Logs

previous Page of 3