1 Table of Contents: “...1. Introduction.-2. Divide-and-Conquer -- 3. Dynamic Programming and Shortest Path -- 4. Greedy...”

2 Table of Contents: “... Algorithm for the All Pairs Shortest Path Problem with O(n 2logn) Expected Time -- New Min-Max Theorems...”

3 Table of Contents: “... for Some Graph Problems Parameterized by Modular-Width -- Shortest Longest-Path Graph Orientations -- Sink...”

4 Table of Contents: “... Networks under Rumor Source Uncertainty -- Algorithms for Shortest Path Tour Problem in Large-Scale Road...”

5 Table of Contents: “... of Shortest Paths in the (n, k)-Star Graphs -- Complexity of Determining the Most Vital Elements for the 1...”

6 Table of Contents: “...-Distance Coloring -- An Efficient Oracle for Counting Shortest Paths in Planar Graphs -- Restrained...”

7 Table of Contents: “... for Rumor Detection -- Improving Contraction Hierarchies by Combining with All-Pairs Shortest Paths Problem...”