1: Constrained Orthogonal Segment Stabbing
2: Categorical Feature Compression via Submodular Optimization
3: Simpler and Better Algorithms for Minimum-Norm Load Balancing
4: Online Bin Covering with Advice
5: Permutation Code Equivalence is not Harder than Graph Isomorphism when Hulls are Trivial
6: FastContext: an efficient and scalable implementation of the ConText algorithm
7: Using Non-Linear Difference Equations to Study Quicksort Algorithms
8: Inventory Routing Problem with Facility Location
9: Separate Chaining Meets Compact Hashing
10: Parameterized Complexity of Conflict-free Graph Coloring
11: Independent Set Reconfiguration Parameterized by Modular-Width
12: Fast hashing with Strong Concentration Bounds
13: Reconfiguring Undirected Paths
14: Graph Coloring via Degeneracy in Streaming and Other Space-Conscious Models
15: Deterministic Leader Election in Programmable Matter
16: Online Circle Packing
17: Tight Approximation Bounds for Maximum Multi-Coverage
18: Efficient approximation schemes for uniform-cost clustering problems in planar graphs
19: Static Pricing: Universal Guarantees for Reusable Resources
20: Scalable and Jointly Differentially Private Packing
21: Near Optimal Jointly Private Packing Algorithms via Dual Multiplicative Weight Update
22: Budget-Feasible Mechanism Design for Non-Monotone Submodular Objectives: Offline and Online
23: Log Diameter Rounds Algorithms for $2$-Vertex and $2$-Edge Connectivity
24: Submodular Streaming in All its Glory: Tight Approximation, Minimum Memory and Low Adaptive Complexity
25: Benchmark Instances and Branch-and-Cut Algorithm for the Hashiwokakero Puzzle
26: Positive-Instance Driven Dynamic Programming for Graph Searching
27: Fake news and rumors: a trigger for proliferation or fading away
28: Fully Dynamic Single-Source Reachability in Practice: An Experimental Study
29: RLE edit distance in near optimal time
30: Learning Some Popular Gaussian Graphical Models without Condition Number Bounds
31: Breaking the Bellman-Ford Shortest-Path Bound
32: Exploring Differential Obliviousness
33: Pandora’s Problem with Nonobligatory Inspection
34: New reduction rules for the tree bisection and reconnection distance
35: New Notions and Constructions of Sparsification for Graphs and Hypergraphs
36: DynComm R Package – Dynamic Community Detection for Evolving Networks
37: Testable Properties in General Graphs and Random Order Streaming
38: Faster polytope rounding, sampling, and volume computation via a sublinear “Ball Walk”
39: MapReduce Meets Fine-Grained Complexity: MapReduce Algorithms for APSP, Matrix Multiplication, 3-SUM, and Beyond
40: FPT Algorithms for Conflict-free Coloring of Graphs and Chromatic Terrain Guarding
41: Non-clairvoyant Precedence Constrained Scheduling
42: Efficient Second-Order Shape-Constrained Function Fitting
43: Elastic-Degenerate String Matching via Fast Matrix Multiplication
44: Design Space Exploration as Quantified Satisfaction
45: Optimal Convergence Rate of Hamiltonian Monte Carlo for Strongly Logconcave Distributions
46: Parallel Cut Pursuit For Minimization of the Graph Total Variation
47: Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles
48: PRSim: Sublinear Time SimRank Computation on Large Power-Law Graphs
49: Separations and Equivalences between Turnstile Streaming and Linear Sketching
50: Adversarially Robust Submodular Maximization under Knapsack Constraints
51: Gaussian Differential Privacy
52: Equal-Subset-Sum Faster Than the Meet-in-the-Middle
53: Robust two-stage combinatorial optimization problems under convex uncertainty
54: Self-Adjusting Linear Networks
55: Order-Preserving Pattern Matching Indeterminate Strings
56: Distributed Construction of Light Networks
57: External Memory Planar Point Location with Fast Updates