1: A Self-Index on Block Trees
2: Parallel Galton Watson Process
3: Intriguingly Simple and Efficient Time-Dependent Routing in Road Networks
4: 'Etude de Probl`emes d’Optimisation Combinatoire `a Multiples Composantes Interd'ependantes
5: Competitive Equilibria for Non-quasilinear Bidders in Combinatorial Auctions
6: Think Eternally: Improved Algorithms for the Temp Secretary Problem and Extensions
7: Advanced Probabilistic Couplings for Differential Privacy
8: Optimal Evacuation Flows on Dynamic Paths with General Edge Capacities
9: Robust Learning of Fixed-Structure Bayesian Networks
10: Generalized Preconditioning and Network Flow Problems
11: On the importance of graph search algorithms for DRGEP-based mechanism reduction methods
12: Tight Algorithms for Vertex Cover with Hard Capacities on Multigraphs and Hypergraphs
13: Matroid Online Bipartite Matching and Vertex Cover
14: Fully Dynamic Spanners with Worst-Case Update Time
15: Faster Coreset Construction for Projective Clustering via Low-Rank Approximation
16: Constant factor Approximation Algorithms for Uniform Hard Capacitated Facility Location Problems: Natural LP is not too bad
17: Matrix Balancing in Lp Norms: A New Analysis of Osborne’s Iteration
18: A width parameter useful for chordal and co-comparability graphs
19: Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries
20: A Reduction for Optimizing Lattice Submodular Functions with Diminishing Returns
21: Biconnectivity, $st$-numbering and other applications of DFS using $O(n)$ bits
22: Iterative Partial Rounding for Vertex Cover with Hard Capacities
23: Using Sequence Ensembles for Seeding Alignments of MinION Sequencing Data