1: Search-and-Fetch with 2 Robots on a Disk: Wireless and Face-to-Face Communication Models
2: Efficient quantum tomography II
3: Global and fixed-terminal cuts in digraphs
4: Equilibrium Computation in Resource Allocation Games
5: Sparsity Preserving Algorithms for Octagons
6: Gradient Descent Finds the Cubic-Regularized Non-Convex Newton Step
7: Energy-efficient 8-point DCT Approximations: Theory and Hardware Architectures
8: New Frameworks for Offline and Streaming Coreset Constructions
9: Reconfiguring Ordered Bases of a Matroid
10: Non-monotone DR-Submodular Function Maximization
11: Online Page Migration on Ring Networks in Uniform Model
12: Approximation Algorithms for the Maximum Profit Pick-up Problem with Time Windows and Capacity Constraint
13: Proceedings Second Graphs as Models Workshop
14: The limited blessing of low dimensionality: when $1-1/d$ is the best possible exponent for $d$-dimensional geometric problems
15: Adaptive Work-Efficient Connected Components on the GPU
16: A Note on Testing Intersection of Convex Sets in Sublinear Time
17: Plane Gossip: Approximating rumor spread in planar graphs
18: Technology Beats Algorithms (in Exact String Matching)
19: Eldan’s Stochastic Localization and the KLS Conjecture: Isoperimetry, Concentration and Mixing
20: A Randomized Concurrent Algorithm for Disjoint Set Union
21: Matrix multiplication algorithms from group orbits
22: Tighter inapproximability for set cover
23: Design and Evaluation of Alternate Enumeration Techniques for Subset Sum Problem
24: Deterministic Indexing for Packed Strings
25: Pseudodeterministic Constructions in Subexponential Time
26: Symmetry exploitation for Online Machine Covering with Bounded Migration
27: Communication-Avoiding Parallel Algorithms for Solving Triangular Systems of Linear Equations
28: On the Minimum Chordal Completion Polytope
29: Approximate Modularity Revisited
30: Asynchronous approach in the plane: A deterministic polynomial algorithm