1: KaHIP v3.00 – Karlsruhe High Quality Partitioning – User Guide
2: Suffix Trays and Suffix Trists: Structures for Faster Text Indexing
3: Efficient Quantum Algorithms for Analyzing Large Sparse Electrical Networks
4: Simple DFS on the Complement of a Graph and on Partially Complemented Digraphs
5: Implementing and reasoning about hash-consed data structures in Coq
6: Simple Multi-Party Set Reconciliation
7: Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints
8: Curvature and Optimal Algorithms for Learning and Minimizing Submodular Functions
9: Betweenness Centrality – Incremental and Faster
10: Analyzing the Optimal Neighborhood: Algorithms for Budgeted and Partial Connected Dominating Set Problems
11: Families with infants: a general approach to solve hard partition problems
12: Parameterized Approximation Schemes using Graph Widths
13: The Noisy Power Method: A Meta Algorithm with Applications
14: Breaking the PPSZ Barrier for Unique 3-SAT
15: Toward a unified theory of sparse dimensionality reduction in Euclidean space
16: Efficiently Computing Edit Distance to Dyck Language
17: Minimum Bisection is fixed parameter tractable
18: Primal Beats Dual on Online Packing LPs in the Random-Order Model
19: Asymptotically Truthful Equilibrium Selection in Large Congestion Games
20: Private Matchings and Allocations
21: Gossip vs. Markov Chains, and Randomness-Efficient Rumor Spreading
22: The More, the Merrier: the Blessing of Dimensionality for Learning Large Gaussian Mixtures
23: Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs
24: Losing Weight by Gaining Edges
25: Simple Tabulation, Fast Expanders, Double Tabulation, and High Independence
26: Recent Advances in Graph Partitioning
27: Algorithmic regularity for polynomials and applications
28: An Efficient Parallel Solver for SDD Linear Systems