1 Table of Contents: “... technique and its application to path selection in trees -- Offset-polygon annulus placement problems...”

2 Table of Contents: “...A fast derandomization scheme and its applications -- Unstructured path problems and the making...”

3 Table of Contents: “..., Pathwidth, and Persistence -- Chordless Paths Through Three Vertices -- Computing Small Search Numbers...”

4 Table of Contents: “... largest-area convex polygon -- Finding All Shortest Path Edge Sequences on a convex polyhedron -- Linear...”

5 Table of Contents: “... for Forests Augmentation Ensuring Two Disjoint Paths of Bounded Length -- A Dynamic Implicit Adjacency...”

6 Table of Contents: “... -- Improved parallel depth-first search in undirected planar graphs -- On approximating the longest path in a...”

7 Table of Contents: “... Graphs -- The Zigzag Path of a Pseudo-Triangulation -- Alternating Paths along Orthogonal Segments --...”

8 Table of Contents: “... in the 3-dimensional space -- Routing on trees via matchings -- A ranking algorithm for Hamilton paths...”

9 Table of Contents: “... and distributed algorithms for the all pairs quickest path problem -- An efficient approximation algorithm...”

10 Table of Contents: “... in Graphs -- Approximate Shortest Paths Guided by a Small Index -- Session 11A -- Initializing Sensor...”

11 Table of Contents: “... -- On the Minimum Eccentricity Shortest Path Problem -- Convex polygons in geometric triangulations -- Straight-line...”

12 Table of Contents: “... in Terms of Formula Length -- Shortest Path Problems on a Polyhedral Surface -- Approximation Algorithms...”

13 Table of Contents: “... Neighbor Searching -- I/O-Efficient Shortest PathQueries in Geometric Spanners -- Session 8B -- Higher...”