1: Complexity of the FIFO Stack-Up Problem
2: Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask)
3: Navigating Central Path with Electrical Flows: from Flows to Matchings, and Back
4: Approximate the k-Set Packing Problem by Local Improvements
5: Pipage Rounding, Pessimistic Estimators and Matrix Concentration
6: Improved Submatrix Maximum Queries in Monge Matrices
7: Combinatorial decomposition approaches for efficient counting and random generation FPTASes
8: Finding the Minimum-Weight k-Path
9: Fault Tolerant Clustering Revisited
10: Point Line Cover: The Easy Kernel is Essentially Tight
11: Better Approximation Bounds for the Joint Replenishment Problem
12: Greedy Online Bipartite Matching on Random Graphs
13: NECO - A scalable algorithm for NEtwork COntrol
14: Ranking on Arbitrary Graphs: Rematch via Continuous LP with Monotone and Boundary Condition Constraints
15: The technique of in-place associative sorting
16: An Efficient Multiplication Algorithm Using Nikhilam Method
17: Packing a Knapsack of Unknown Capacity
18: A Constant Factor Approximation Algorithm for Fault-Tolerant k-Median
19: Flow-Based Algorithms for Local Graph Clustering
20: Dynamic Data Structure for Tree-Depth Decomposition
21: Cake Cutting Algorithms for Piecewise Constant and Piecewise Uniform Valuations
22: Fast Exact Search in Hamming Space with Multi-Index Hashing
23: QuickXsort: Efficient Sorting with n log n - 1.399n +o(n) Comparisons on Average
24: Finding small patterns in permutations in linear time
25: Optimal competitiveness for Symmetric Rectilinear Steiner Arborescence and related problems
26: Statistical Active Learning Algorithms for Noise Tolerance and Differential Privacy
27: Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods
28: Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas
29: A Polynomial-time Approximation Scheme for Fault-tolerant Distributed Storage
30: Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period
31: Parallel Graph Decompositions Using Random Shifts
32: Statistically-secure ORAM with $\tilde{O}(\log^2 n)$ Overhead
33: Prophet Inequalities with Limited Information