1: Differentially Private k-Means with Constant Multiplicative Error
2: A 2/3-Approximation Algorithm for Vertex-weighted Matching in Bipartite Graphs
3: Attenuate Locally, Win Globally: An Attenuation-based Framework for Online Stochastic Matching with Timeouts
4: A Primal-Dual Online Deterministic Algorithm for Matching with Delays
5: Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs
6: Maximizing Profit with Convex Costs in the Random-order Model
7: Nearly Linear Time Deterministic Algorithms for Submodular Maximization Under Knapsack Constraint and Beyond
8: How Bad is the Freedom to Flood-It?
9: Succinct Oblivious RAM
10: Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines
11: Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades
12: Entropy bounds for grammar compression
13: Eigenvector Computation and Community Detection in Asynchronous Gossip Models
14: Towards Learning Sparsely Used Dictionaries with Arbitrary Supports
15: Individual Sensitivity Preprocessing for Data Privacy
16: Maximum Integer Flows in Directed Planar Graphs with Multiple Sources and Sinks and Vertex Capacities
17: Longest Common Substring Made Fully Dynamic
18: A Tight 4/3 Approximation for Capacitated Vehicle Routing in Trees
19: Fast and Efficient Distributed Computation of Hamiltonian Cycles in Random Graphs
20: Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations
21: Learning Software Constraints via Installation Attempts
22: Improved Algorithms for Fully Dynamic Maximal Independent Set
23: Improved Local Search Based Approximation Algorithm for Hard Uniform Capacitated k-Median Problem
24: Tighter Connections Between Formula-SAT and Shaving Logs
25: Reconfiguration of graph minors
26: A quasi linear-time b-Matching algorithm on distance-hereditary graphs and bounded split-width graphs
27: The use of a pruned modular decomposition for Maximum Matching algorithms on some graph classes
28: Stable-Matching Voronoi Diagrams: Combinatorial Complexity and Algorithms
29: Extensor-Coding
30: Improved Algorithms for Adaptive Compressed Sensing
31: Power of $d$ Choices with Simple Tabulation
32: An Faster Network Motif Detection Tool
33: On the Structure of Unique Shortest Paths in Graphs
34: Analysis of a Canonical Labeling Algorithm for the Alignment of Correlated Erd\H{o}s-R'enyi Graphs
35: Random Fourier Features for Kernel Ridge Regression: Approximation Bounds and Statistical Guarantees
36: On Estimating Edit Distance: Alignment, Dimension Reduction, and Embeddings
37: Quantum Algorithm for Dynamic Programming Approach for DAGs. Applications for Zhegalkin Polynomial Evaluation and Some Problems on DAGs
38: Link and code: Fast indexing with graphs and compact regression codes
39: QuickMergesort: Practically Efficient Constant-Factor Optimal Sorting
40: Efficient and adaptive parameterized algorithms on modular decompositions
41: Edit Distance between Unrooted Trees in Cubic Time
42: Intersecting edge distinguishing colorings of hypergraphs
43: Quantum Algorithms for Connectivity and Related Problems
44: Alternative parameterizations of Metric Dimension
45: Buffered Count-Min Sketch on SSD: Theory and Experiments
46: Low Rank Approximation in the Presence of Outliers
47: QDR-Tree: An Efficient Index Scheme for Complex Spatial Keyword Query
48: A Riemannian Corollary of Helly’s Theorem
49: Heavy Hitters over Interval Queries
50: New algorithms for Steiner tree reoptimization