1: A 4/3-approximation for TSP on cubic 3-edge-connected graphs
2: Greedy Random Walk
3: Fault-Tolerant Spanners: Better and Simpler
4: The VC-Dimension of Queries and Selectivity Estimation Through Sampling
5: The complexity of flood-filling games on graphs
6: Dynamic Monopolies in Colored Tori
7: Random Walk on Directed Dynamic Graphs