- Manuel Fernandez, David Woodruff and Taisuke Yasuda. The Query Complexity of Mastermind with lp Distances
- Chi-Ning Chou, Zhixian Lei and Preetum Nakkiran. Tracking the l2 Norm with Constant Update Time
- Benjamin Moseley and Maxim Sviridenko. Submodular Optimization with Contention Resolution Extensions
- D Ellis Hershkowitz, R. Ravi and Sahil Singla. Prepare for the Expected Worst: Algorithms for Reconfigurable Resources Under Uncertainty
- Venkatesan Guruswami and Runzhou Tao. Streaming Hardness of Unique Games
- Arnold Filtser. On Strong Diameter Padded Decompositions
- Alon Eden, Uriel Feige and Michal Feldman. Max-Min Greedy Matching
- Gary Miller, Noel Walkington and Alex Wang. Hardy-Muckenhoupt Bounds for Laplacian Eigenvalues
- Devanathan Thiruvenkatachari, Euiwoong Lee, Subhash Khot and Prahladh Harsha. Improved Hardness for 3LIN via Linear Label Cover
- Ilan Reuven Cohen, Alon Eden, Amos Fiat and Łukasz Jeż. Dynamic Pricing of Servers on Trees
- Eden Chlamtac, Michael Dinitz and Thomas Robinson. Approximating the Norms of Graph Spanners
- Dhruv Rohatgi. Conditional Hardness of Earth Mover Distance
- Reyna Hulett. Single-Elimination Brackets Fail to Approximate Copeland Winner
- Timothy Carpenter, Ario Salmasi and Anastasios Sidiropoulos. Routing Symmetric Demands in Directed Minor-Free Graphs with Constant Congestion
- Venkatesan Guruswami and Sai Sandeep. Rainbow coloring hardness via low sensitivity polymorphisms
- Eric Allender, Martin Farach-Colton and Meng-Tsung Tsai. Syntactic Separation of Subset Satisfiability Problems
- Dimitris Fotakis, Jannik Matuschke and Orestis Papadigenopoulos. Malleable scheduling beyond identical machines
- Ioana Bercea, Martin Groß, Samir Khuller, Aounon Kumar, Clemens Rösner, Daniel R. Schmidt and Melanie Schmidt. On the cost of essentially fair clusterings
- Neeraj Kumar, Stavros Sintos and Subhash Suri. The Maximum Exposure Problem
- Sagar Kale. Small Space Stream Summary for Matroid Center
- Alexander Birx, Yann Disser and Kevin Schewior. Improved Bounds for Open Online Dial-a-Ride on the Line
- Susanne Albers, Arindam Khan and Leon Ladewig. Improved Online Algorithms for Knapsack and GAP in the Random Order Model
- Kent Quanrud. Fast and Deterministic Approximations for k-Cut
- Per Austrin and Aleksa Stankovic. Global cardinality constraints make approximating some Max-2-CSPs harder
- Rajan Udwani and Andreas Schulz. Robust Appointment Scheduling with Heterogeneous Costs
- Alexander Golovnev, Alexander Kulikov, Alexander Logunov, Ivan Mikhailin and Maksim Nikolaev. Collapsing Superstring Conjecture
- Vladimir Braverman, Harry Lang, Enayat Ullah, and Samson Zhou. Improved Algorithms for Time Decay Streams
- Suprovat Ghoshal, Anand Louis and Rahul Raychaudhury. Approximation Algorithms for Partially Colorable Graphs
- Rajesh Jayaram and David P. Woodruff. Towards Optimal Moment Estimation in Streaming and Distributed Models
- Umang Bhaskar and Gunjan Kumar. The Complexity of Partial Function Extension for Coverage Functions
- Sevag Gharibian and Ojas Parekh. Almost optimal classical approximation algorithms for a quantum generalization of Max-Cut
- Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Joseph S. B. Mitchell and Nabil Mustafa. Maximizing Covered Area in a Euclidean Plane with Connectivity Constraint
- Devvrit, Ravishankar Krishnaswamy and Nived Rajaraman. Robust Correlation Clustering
APPROX CONFERENCE 