Book Volume 9214 2015

Algorithms and Data Structures

14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings

Editors:

ISBN: 978-3-319-21839-7 (Print) 978-3-319-21840-3 (Online)

Table of contents (52 chapters)

previous Page of 3
  1. Front Matter

    Pages I-XIII

  2. No Access

    Chapter

    Pages 1-13

    Contact Graphs of Circular Arcs

  3. No Access

    Chapter

    Pages 14-27

    Contact Representations of Graphs in 3D

  4. No Access

    Chapter

    Pages 28-39

    Minimizing the Aggregate Movements for Interval Coverage

  5. No Access

    Chapter

    Pages 40-53

    Online Bin Packing with Advice of Small Size

  6. No Access

    Chapter

    Pages 54-65

    On the Approximability of Orthogonal Order Preserving Layout Adjustment

  7. No Access

    Chapter

    Pages 66-78

    An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs

  8. No Access

    Chapter

    Pages 79-90

    Generation of Colourings and Distinguishing Colourings of Graphs

  9. No Access

    Chapter

    Pages 91-102

    Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time

  10. No Access

    Chapter

    Pages 103-114

    On Conflict-Free Multi-coloring

  11. No Access

    Chapter

    Pages 115-126

    Semi-dynamic Connectivity in the Plane

  12. No Access

    Chapter

    Pages 127-139

    Interval Selection in the Streaming Model

  13. No Access

    Chapter

    Pages 140-151

    On the Bounded-Hop Range Assignment Problem

  14. No Access

    Chapter

    Pages 152-165

    Greedy Is an Almost Optimal Deque

  15. No Access

    Chapter

    Pages 166-177

    A New Approach for Contact Graph Representations and Its Applications

  16. No Access

    Chapter

    Pages 178-188

    Dealing with 4-Variables by Resolution: An Improved MaxSAT Algorithm

  17. No Access

    Chapter

    Pages 189-199

    Select with Groups of 3 or 4

  18. No Access

    Chapter

    Pages 200-211

    Approximating Nearest Neighbor Distances

  19. No Access

    Chapter

    Pages 212-223

    Linearity Is Strictly More Powerful Than Contiguity for Encoding Graphs

  20. No Access

    Chapter

    Pages 224-235

    On the Complexity of an Unregulated Traffic Crossing

  21. No Access

    Chapter

    Pages 236-248

    Finding Pairwise Intersections Inside a Query Range

previous Page of 3