1: Data Requirement for Phylogenetic Inference from Multiple Loci: A New Distance Method
2: Testing Forest-Isomorphism in the Adjacency List Model
3: Randomized Sketches of Convex Programs with Sharp Guarantees
4: Lower bounds for on-line graph colorings
5: Fast Dynamic Graph Algorithms for Parameterized Problems
6: Tight Bounds for Restricted Grid Scheduling
7: The Power of Two Choices in Distributed Voting
8: Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set
9: On the metric s-t path Traveling Salesman Problem
10: An Efficient Algorithm for Enumerating Chordless Cycles and Chordless Paths
11: Testing Temporal Connectivity in Sparse Dynamic Graphs
12: An Optimal Offline Algorithm for List Update
13: Light Spanners