Algorithm Theory – SWAT 2012

13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012. Proceedings

Editors:

ISBN: 978-3-642-31154-3 (Print) 978-3-642-31155-0 (Online)

Table of contents (34 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. No Access

    Book Chapter

    Pages 1-12

    α-Visibility

  3. No Access

    Book Chapter

    Pages 13-23

    Partial Matching between Surfaces Using Fréchet Distance

  4. No Access

    Book Chapter

    Pages 24-35

    A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares

  5. No Access

    Book Chapter

    Pages 36-47

    Watchman Routes for Lines and Segments

  6. No Access

    Book Chapter

    Pages 48-58

    Kinetic Pie Delaunay Graph and Its Applications

  7. No Access

    Book Chapter

    Pages 59-70

    Higher Order City Voronoi Diagrams

  8. No Access

    Book Chapter

    Pages 71-82

    On Minimum Sum of Radii and Diameters Clustering

  9. No Access

    Book Chapter

    Pages 83-94

    A Simple Framework for the Generalized Nearest Neighbor Problem

  10. No Access

    Book Chapter

    Pages 95-106

    Deterministic Parameterized Connected Vertex Cover

  11. No Access

    Book Chapter

    Pages 107-118

    Faster Parameterized Algorithms for Deletion to Split Graphs

  12. No Access

    Book Chapter

    Pages 119-130

    A Single-Exponential FPT Algorithm for the K 4-Minor Cover Problem

  13. No Access

    Book Chapter

    Pages 131-141

    An O(n 3 loglogn/log2 n) Time Algorithm for All Pairs Shortest Paths

  14. No Access

    Book Chapter

    Pages 142-152

    Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths

  15. No Access

    Book Chapter

    Pages 153-164

    Induced Disjoint Paths in AT-Free Graphs

  16. No Access

    Book Chapter

    Pages 165-176

    Effective Computation of Immersion Obstructions for Unions of Graph Classes

  17. No Access

    Book Chapter

    Pages 177-188

    Algorithms on Minimizing the Maximum Sensor Movement for Barrier Coverage of a Linear Domain

  18. No Access

    Book Chapter

    Pages 189-200

    Annotating Simplices with a Homology Basis and Its Applications

  19. No Access

    Book Chapter

    Pages 201-212

    Do Directional Antennas Facilitate in Reducing Interferences?

  20. No Access

    Book Chapter

    Pages 213-224

    Minimum Convex Partitions and Maximum Empty Polytopes

  21. No Access

    Book Chapter

    Pages 225-236

    A Probabilistic Analysis of Christofides’ Algorithm

previous Page of 2