1: A note on linear fractional set packing problem
2: Using Contracted Solution Graphs for Solving Reconfiguration Problems
3: Parallel algorithms and concentration bounds for the Lovasz Local Lemma via witness DAGs
4: Dynamic graph connectivity with improved worst case update time and sublinear space
5: Bin Packing with Linear Usage Costs
6: Minimum Weight Perfect Matching via Blossom Belief Propagation
7: Dynamic concurrent van Emde Boas array
8: Fast k-NN search
9: Fast Parallel Fixed-Parameter Algorithms via Color Coding
10: Finding Perfect Matchings in Bipartite Hypergraphs
11: Practical Concurrent Priority Queues
12: Integer Programming Models and Parameterized Algorithms for Controlling Palletizers
13: Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism
14: Deterministic Sparse Suffix Sorting in the Restore Model
15: Adaptive Sequential Optimization with Applications to Machine Learning
16: Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT
17: Multi-Objective Weighted Sampling
18: Minimax Regret 1-Median Problem in Dynamic Path Networks
19: Connectivity Preserving Iterative Compaction and Finding 2 Disjoint Rooted Paths in Linear Time
20: Uncovering the Small Community Structure in Large Networks: A Local Spectral Approach
21: A (1+epsilon)-Approximation for Makespan Scheduling with Precedence Constraints using LP Hierarchies
22: A note on the dynamic dominant resource fairness mechanism
23: Inserting Multiple Edges into a Planar Graph
24: Probably certifiably correct k-means clustering
25: Overlapping Community Detection via Local Spectral Clustering
26: Amplification and Derandomization Without Slowdown
27: Fast Algorithms for Finding Pattern Avoiders and Counting Pattern Occurrences in Permutations
28: External Memory Three-Sided Range Reporting and Top-$k$ Queries with Sublogarithmic Updates
29: Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement