1: The fast intersection transform with applications to counting paths
2: Simpler Analyses of Local Search Algorithms for Facility Location
3: Polynomial kernels for 3-leaf power graph modification problems
4: Sorting by Placement and Shift
5: Single source shortest paths in $H$-minor free graphs
6: A Local Clustering Algorithm for Massive Graphs and its Application to Nearly-Linear Time Graph Partitioning
7: Inferring Company Structure from Limited Available Information
8: Locating Restricted Facilities on Binary Maps
9: Dynamic tree algorithms