| 2023 | A 10/7-Approximation for Discrete Bamboo Garden Trimming and Continuous Trimming on Star Graphs. Felix Höhne, Rob van Stee |
| 2023 | A Constant-Factor Approximation for Quasi-Bipartite Directed Steiner Tree on Minor-Free Graphs. Zachary Friggstad, Ramin Mousavi |
| 2023 | A Deterministic Construction of a Large Distance Code from the Wozencraft Ensemble. Venkatesan Guruswami, Shilun Li |
| 2023 | Algorithms for 2-Connected Network Design and Flexible Steiner Trees with a Constant Number of Terminals. Ishan Bansal, Joe Cheriyan, Logan Grout, Sharat Ibrahimpur |
| 2023 | An AFPTAS for Bin Packing with Partition Matroid via a New Method for LP Rounding. Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai |
| 2023 | An Approximation Algorithm for the Exact Matching Problem in Bipartite Graphs. Anita Dürr, Nicolas El Maalouly, Lasse Wulf |
| 2023 | An Embarrassingly Parallel Optimal-Space Cardinality Estimation Algorithm. Emin Karayel |
| 2023 | Approximating Pandora's Box with Correlations. Shuchi Chawla, Evangelia Gergatsouli, Jeremy McMahan, Christos Tzamos |
| 2023 | Approximating Red-Blue Set Cover and Minimum Monotone Satisfying Assignment. Eden Chlamtác, Yury Makarychev, Ali Vakilian |
| 2023 | Approximating Submodular k-Partition via Principal Partition Sequence. Karthekeyan Chandrasekaran, Weihang Wang |
| 2023 | Approximation Algorithms and Lower Bounds for Graph Burning. Matej Lieskovský, Jirí Sgall, Andreas Emil Feldmann |
| 2023 | Approximation Algorithms for Directed Weighted Spanners. Elena Grigorescu, Nithish Kumar, Young-San Lin |
| 2023 | Approximation Algorithms for Maximum Weighted Throughput on Unrelated Machines. George Karakostas, Stavros G. Kolliopoulos |
| 2023 | Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, Atlanta, Georgia, USA, September 11-13, 2023 Nicole Megow, Adam D. Smith |
| 2023 | Bias Reduction for Sum Estimation. Talya Eden, Jakob Bæk Tejs Houen, Shyam Narayanan, Will Rosenbaum, Jakub Tetek |
| 2023 | Bicriteria Approximation Algorithms for Priority Matroid Median. Tanvi Bajpai, Chandra Chekuri |
| 2023 | Classical Simulation of One-Query Quantum Distinguishers. Andrej Bogdanov, Tsun Ming Cheung, Krishnamoorthy Dinesh, John C. S. Lui |
| 2023 | Directed Poincaré Inequalities and L¹ Monotonicity Testing of Lipschitz Functions. Renato Ferreira Pinto Jr. |
| 2023 | Efficient Algorithms and Hardness Results for the Weighted k-Server Problem. Anupam Gupta, Amit Kumar, Debmalya Panigrahi |
| 2023 | Efficient Interactive Proofs for Non-Deterministic Bounded Space. Joshua Cook, Ron D. Rothblum |
| 2023 | Evaluating Stability in Massive Social Networks: Efficient Streaming Algorithms for Structural Balance. Vikrant Ashvinkumar, Sepehr Assadi, Chengyuan Deng, Jie Gao, Chen Wang |
| 2023 | Experimental Design for Any p-Norm. Lap Chi Lau, Robert Wang, Hong Zhou |
| 2023 | Extracting Mergers and Projections of Partitions. Swastik Kopparty, Vishvajeet N |
| 2023 | Facility Location in the Sublinear Geometric Model. Morteza Monemizadeh |
| 2023 | Fast Decoding of Explicit Almost Optimal ε-Balanced q-Ary Codes And Fast Approximation of Expanding k-CSPs. Fernando Granha Jeronimo |
| 2023 | Fine Grained Analysis of High Dimensional Random Walks. Roy Gotlib, Tali Kaufman |
| 2023 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2023 | Giant Components in Random Temporal Graphs. Ruben Becker, Arnaud Casteigts, Pierluigi Crescenzi, Bojana Kodric, Malte Renken, Michael Raskin, Viktor Zamaraev |
| 2023 | Hardness of the (Approximate) Shortest Vector Problem: A Simple Proof via Reed-Solomon Codes. Huck Bennett, Chris Peikert |
| 2023 | How to Make Your Approximation Algorithm Private: A Black-Box Differentially-Private Transformation for Tunable Approximation Algorithms of Functions with Low Sensitivity. Jeremiah Blocki, Elena Grigorescu, Tamalika Mukherjee, Samson Zhou |
| 2023 | Improved Diversity Maximization Algorithms for Matching and Pseudoforest. Sepideh Mahabadi, Shyam Narayanan |
| 2023 | Improved Local Computation Algorithms for Constructing Spanners. Rubi Arviv, Lily Chung, Reut Levi, Edward Pyne |
| 2023 | Independent Sets in Elimination Graphs with a Submodular Objective. Chandra Chekuri, Kent Quanrud |
| 2023 | Interactive Error Correcting Codes: New Constructions and Impossibility Bounds. Meghal Gupta, Rachel Yun Zhang |
| 2023 | Low-Degree Testing over Grids. Prashanth Amireddy, Srikanth Srinivasan, Madhu Sudan |
| 2023 | NP-Hardness of Almost Coloring Almost 3-Colorable Graphs. Yahli Hecht, Dor Minzer, Muli Safra |
| 2023 | Oblivious Algorithms for the Max-kAND Problem. Noah G. Singer |
| 2023 | On Complexity of 1-Center in Various Metrics. Amir Abboud, MohammadHossein Bateni, Vincent Cohen-Addad, Karthik C. S., Saeed Seddighin |
| 2023 | On Connectivity in Random Graph Models with Limited Dependencies. Johannes Lengler, Anders Martinsson, Kalina Petrova, Patrick Schnider, Raphael Steiner, Simon Weber, Emo Welzl |
| 2023 | On Constructing Spanners from Random Gaussian Projections. Sepehr Assadi, Michael Kapralov, Huacheng Yu |
| 2023 | On Minimizing Generalized Makespan on Unrelated Machines. Nikhil Ayyadevara, Nikhil Bansal, Milind Prabhu |
| 2023 | On Optimization and Counting of Non-Broken Bases of Matroids. Dorna Abdolazimi, Kasper Lindberg, Shayan Oveis Gharan |
| 2023 | On the Complexity of Triangle Counting Using Emptiness Queries. Arijit Bishnu, Arijit Ghosh, Gopinath Mishra |
| 2023 | On the Composition of Randomized Query Complexity and Approximate Degree. Sourav Chakraborty, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, Swagato Sanyal, Nitin Saurabh |
| 2023 | On the Power of Regular and Permutation Branching Programs. Chin Ho Lee, Edward Pyne, Salil P. Vadhan |
| 2023 | Online Matching with Set and Concave Delays. Lindsey Deryckere, Seeun William Umboh |
| 2023 | Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary Trees. Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda |
| 2023 | Perfect Sampling for Hard Spheres from Strong Spatial Mixing. Konrad Anand, Andreas Göbel, Marcus Pappik, Will Perkins |
| 2023 | Private Data Stream Analysis for Universal Symmetric Norm Estimation. Vladimir Braverman, Joel Manning, Zhiwei Steven Wu, Samson Zhou |
| 2023 | Probabilistic Metric Embedding via Metric Labeling. Kamesh Munagala, Govind S. Sankar, Erin Taylor |
| 2023 | Range Avoidance for Constant Depth Circuits: Hardness and Algorithms. Karthik Gajulapalli, Alexander Golovnev, Satyajeet Nagargoje, Sidhant Saraogi |
| 2023 | Rapid Mixing of Global Markov Chains via Spectral Independence: The Unbounded Degree Case. Antonio Blanca, Xusheng Zhang |
| 2023 | Robustness for Space-Bounded Statistical Zero Knowledge. Eric Allender, Jacob Gray, Saachi Mutreja, Harsha Tirumala, Pengxiang Wang |
| 2023 | Round and Bipartize for Vertex Cover Approximation. Danish Kashaev, Guido Schäfer |
| 2023 | Sampling and Certifying Symmetric Functions. Yuval Filmus, Itai Leigh, Artur Riazanov, Dmitry Sokolov |
| 2023 | Sampling from the Random Cluster Model on Random Regular Graphs at All Temperatures via Glauber Dynamics. Andreas Galanis, Leslie Ann Goldberg, Paulina Smolarova |
| 2023 | Scalable Auction Algorithms for Bipartite Maximum Matching Problems. Quanquan C. Liu, Yiduo Ke, Samir Khuller |
| 2023 | Stable Approximation Algorithms for Dominating Set and Independent Set. Mark de Berg, Arpan Sadhukhan, Frits C. R. Spieksma |
| 2023 | Submodular Norms with Applications To Online Facility Location and Stochastic Probing. Kalen Patton, Matteo Russo, Sahil Singla |
| 2023 | Subset Sum in Time 2 Xi Chen, Yaonan Jin, Tim Randolph, Rocco A. Servedio |
| 2023 | Superpolynomial Lower Bounds for Learning Monotone Classes. Nader H. Bshouty |
| 2023 | Synergy Between Circuit Obfuscation and Circuit Minimization. Russell Impagliazzo, Valentine Kabanets, Ilya Volkovich |
| 2023 | Testing Connectedness of Images. Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova, Dragos Ristache |
| 2023 | Testing Versus Estimation of Graph Properties, Revisited. Lior Gishboliner, Nick Kushnir, Asaf Shapira |
| 2023 | The (Im)possibility of Simple Search-To-Decision Reductions for Approximation Problems. Alexander Golovnev, Siyao Guo, Spencer Peters, Noah Stephens-Davidowitz |
| 2023 | The Full Rank Condition for Sparse Random Matrices. Amin Coja-Oghlan, Jane Gao, Max Hahn-Klimroth, Joon Lee, Noëla Müller, Maurice Rolvien |
| 2023 | Tighter Approximation for the Uniform Cost-Distance Steiner Tree Problem. Josefine Foos, Stephan Held, Yannik Kyle Dustin Spitzley |
| 2023 | Tighter MA/1 Circuit Lower Bounds from Verifier Efficient PCPs for PSPACE. Joshua Cook, Dana Moshkovitz |