1: Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems
2: Minimum Spanning Tree on Spatio-Temporal Networks
3: Cleaning Interval Graphs
4: Hitting and commute times in large graphs are often misleading
5: Fault-Tolerant Facility Location: a randomized dependent LP-rounding algorithm
6: Min st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time
7: Network conduciveness with application to the graph-coloring and independent-set optimization transitions