1: Metric Perturbation Resilience
2: Doubly Balanced Connected Graph Partitioning
3: HyperLogLog Hyper Extended: Sketches for Concave Sublinear Frequency Statistics
4: Gerbil: A Fast and Memory-Efficient $k$-mer Counter with GPU-Support
5: Fast Longest Common Extensions in Small Space
6: Approximation Schemes for Geometric Coverage Problems
7: Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via Operator Scaling
8: Edge Coloring with Minimum Reload/Changeover Costs
9: Hereditary Graph Classes: When the Complexities of Colouring and Clique Cover Coincide
10: Connectivity Oracles for Graphs Subject to Vertex Failures
11: A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees
12: Incremental $2$-Edge-Connectivity in Directed Graphs
13: Approximating Multicut and the Demand Graph
14: The Costs and Benefits of Sharing: Sequential Individual Rationality and Sequential Fairness
15: Polynomial Time Algorithm for $2$-Stable Clustering Instances
16: A Hierarchy of Lower Bounds for Sublinear Additive Spanners
17: Low-Congestion Shortcuts without Embedding
18: Unrelated Machine Scheduling of Jobs with Uniform Smith Ratios
19: A Scalable Algorithm for Tracking an Unknown Number of Targets Using Multiple Sensors
20: A Selectable Sloppy Heap
21: Complexity of Token Swapping and its Variants
22: Finding Detours is Fixed-parameter Tractable
23: Computing the k Nearest-Neighbors for all Vertices via Dijkstra
24: First Efficient Convergence for Streaming k-PCA: a Global, Gap-Free, and Near-Optimal Rate
25: Approximation and Parameterized Complexity of Minimax Approval Voting
26: A note on “Approximation schemes for a subclass of subset selection problems”, and a faster FPTAS for the Minimum Knapsack Problem
27: On maximizing a monotone k-submodular function subject to a matroid constraint
28: Minmax Tree Facility Location and Sink Evacuation with Dynamic Confluent Flows
29: Suffix arrays with a twist
30: Counting matchings with k unmatched vertices in planar graphs
31: Efficient Algorithms for Constructing Very Sparse Spanners and Emulators
32: Improvable Knapsack Problems
33: A New Lightweight Algorithm to compute the BWT and the LCP array of a Set of Strings
34: An Efficient Representation for Filtrations of Simplicial Complexes
35: Kernel functions based on triplet comparisons