1: Which Distribution Distances are Sublinearly Testable?
2: Computing the Margin of Victory in Preferential Parliamentary Elections
3: Improved Algorithms for Scheduling Unsplittable Flows on Paths
4: Adaptive Hierarchical Clustering Using Ordinal Queries
5: An Efficient Algorithm for Mixed Domination on Generalized Series-Parallel Graphs
6: Distributed Approximation of Maximum Independent Set and Maximum Matching
7: Exact Approaches for the Travelling Thief Problem
8: A Watershed Delineation Algorithm for 2D Flow Direction Grids
9: A note on the size of query trees
10: Excluded $t$-factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-matchings, and Matroids
11: On the Parameterized Complexity of Contraction to Generalization of Trees
12: Approximate solution of length-bounded maximum multicommodity flow with unit edge-lengths
13: Average-case reconstruction for the deletion channel: subpolynomially many traces suffice
14: Efficient hybrid search algorithm on ordered datasets
15: Network Community Detection: A Review and Visual Survey
16: Improved Deterministic Distributed Construction of Spanners
17: The Gram-Schmidt Walk: A Cure for the Banaszczyk Blues
18: Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform
19: Polynomial tuning of multiparametric combinatorial samplers
20: L1-norm Principal-Component Analysis of Complex Data
21: Compact, Provably-Good LPs for Orienteering and Regret-Bounded Vehicle Routing
22: Better Tradeoffs for Exact Distance Oracles in Planar Graphs
23: Exploiting Redundancy, Recurrence and Parallelism: How to Link Millions of Addresses with Ten Lines of Code in Ten Minutes
24: Traffic flow optimization using a quantum annealer
25: Localization of Electrical Flows
26: A Simple PTAS for the Dual Bin Packing Problem and Advice Complexity of Its Online Version
27: Study of Sparsity-Aware Set-Membership Adaptive Algorithms with Adjustable Penalties
28: Linear Convergence of a Frank-Wolfe Type Algorithm over Trace-Norm Balls
29: Phase Transition in the Maximal Influence Problem: When Do We Need Optimization?