Abstract is missing.
- Semi-Streaming Algorithms for Submodular Function Maximization Under b-Matching ConstraintChien-Chung Huang, François Sellier. [doi]
- Min-Sum Clustering (With Outliers)Sandip Banerjee, Rafail Ostrovsky, Yuval Rabani. [doi]
- Improved Product-Based High-Dimensional ExpandersLouis Golowich. [doi]
- On the Structure of Learnability Beyond P/PolyNinad Rajgopal, Rahul Santhanam. [doi]
- Front Matter, Table of Contents, Preface, Conference Organization [doi]
- A Constant-Factor Approximation for Weighted Bond CoverEun Jung Kim 0002, Euiwoong Lee, Dimitrios M. Thilikos. [doi]
- L1 Regression with Lewis Weights SubsamplingAditya Parulekar, Advait Parulekar, Eric Price. [doi]
- Decision Tree Heuristics Can Fail, Even in the Smoothed SettingGuy Blanc, Jane Lange, Mingda Qiao, Li-Yang Tan. [doi]
- Truly Asymptotic Lower Bounds for Online Vector Bin PackingJános Balogh, Ilan Reuven Cohen, Leah Epstein, Asaf Levin. [doi]
- Parallel Repetition for the GHZ Game: A Simpler ProofUma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan. [doi]
- On the Probabilistic Degree of an n-Variate Boolean FunctionSrikanth Srinivasan 0001, S. Venkitesh. [doi]
- Revenue Maximization in Transportation NetworksKshipra Bhawalkar, Kostas Kollias, Manish Purohit. [doi]
- Matching Drivers to Riders: A Two-Stage Robust ApproachOmar El Housni, Vineet Goyal, Oussama Hanguir, Clifford Stein 0001. [doi]
- General Knapsack Problems in a Dynamic SettingYaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz. [doi]
- Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree ProblemsChandra Chekuri, Kent Quanrud, Manuel R. Torres. [doi]
- Fine-Grained Completeness for Optimization in PKarl Bringmann, Alejandro Cassis, Nick Fischer, Marvin Künnemann. [doi]
- Candidate Tree Codes via Pascal Determinant CubesInbar Ben Yaacov, Gil Cohen, Anand Kumar Narayanan. [doi]
- Improved Bounds for Coloring Locally Sparse HypergraphsFotis Iliopoulos. [doi]
- Testing Hamiltonicity (And Other Problems) in Minor-Free GraphsReut Levi, Nadav Shoshan. [doi]
- Distance Estimation Between Unknown Matrices Using Sublinear Projections on Hamming CubeArijit Bishnu, Arijit Ghosh, Gopinath Mishra. [doi]
- Deterministic Approximate Counting of Polynomial Threshold Functions via a Derandomized Regularity LemmaRocco A. Servedio, Li-Yang Tan. [doi]
- Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear TimeAmartya Shankha Biswas, Talya Eden, Ronitt Rubinfeld. [doi]
- Ideal-Theoretic Explanation of Capacity-Achieving DecodingSiddharth Bhandari, Prahladh Harsha, Mrinal Kumar 0001, Madhu Sudan. [doi]
- Lower Bounds for XOR of ForrelationsUma Girish, Ran Raz, Wei Zhan. [doi]
- From Coupling to Spectral Independence and Blackbox Comparison with the Down-Up WalkKuikui Liu. [doi]
- Interplay Between Graph Isomorphism and Earth Mover's Distance in the Query and Communication WorldsSourav Chakraborty 0001, Arijit Ghosh, Gopinath Mishra, Sayantan Sen. [doi]
- On the Robust Communication Complexity of Bipartite MatchingSepehr Assadi, Soheil Behnezhad. [doi]
- Visible Rank and Codes with LocalityOmar Alrabiah, Venkatesan Guruswami. [doi]
- On Two-Pass Streaming Algorithms for Maximum Bipartite MatchingChristian Konrad, Kheeran K. Naidu. [doi]
- The Critical Mean-Field Chayes-Machta DynamicsAntonio Blanca, Alistair Sinclair, Xusheng Zhang. [doi]
- Smoothed Analysis of the Condition Number Under Low-Rank PerturbationsRikhav Shah, Sandeep Silwal. [doi]
- Fast Mixing via Polymers for Random Graphs with Unbounded DegreeAndreas Galanis, Leslie Ann Goldberg, James Stewart. [doi]
- Singularity of Random Integer Matrices with Large EntriesSankeerth Rao Karingula, Shachar Lovett. [doi]
- Query Complexity of Global Minimum CutArijit Bishnu, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar. [doi]
- The Swendsen-Wang Dynamics on TreesAntonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda. [doi]
- Memory-Sample Lower Bounds for Learning Parity with NoiseSumegha Garg, Pravesh K. Kothari, Pengda Liu, Ran Raz. [doi]
- Improved Hitting Set for Orbit of ROABPsVishwas Bhargava, Sumanta Ghosh. [doi]
- Approximation Algorithms for Demand Strip PackingWaldo Gálvez, Fabrizio Grandoni 0001, Afrouz Jabal Ameli, Kamyar Khodamoradi. [doi]
- Connected k-Partition of k-Connected Graphs and c-Claw-Free GraphsRalf Borndörfer, Katrin Casel, Davis Issac, Aikaterini Niklanovits, Stephan Schwartz, Ziena Zeif. [doi]
- Hitting Sets for Orbits of Circuit Classes and Polynomial FamiliesChandan Saha 0001, Bhargav Thankey. [doi]
- On the Hardness of Average-Case k-SUMZvika Brakerski, Noah Stephens-Davidowitz, Vinod Vaikuntanathan. [doi]
- Online Directed Spanners and Steiner ForestsElena Grigorescu, Young-San Lin, Kent Quanrud. [doi]
- An Optimal Algorithm for Triangle Counting in the StreamRajesh Jayaram, John Kallaugher. [doi]
- On Approximate Envy-Freeness for Indivisible Chores and Mixed ResourcesUmang Bhaskar, A. R. Sricharan, Rohit Vaish. [doi]
- Bag-Of-Tasks Scheduling on Related MachinesAnupam Gupta 0001, Amit Kumar 0001, Sahil Singla 0001. [doi]
- 2-Polynomials and ApplicationsJaroslaw Blasiok, Peter Ivanov, Yaonan Jin, Chin Ho Lee, Rocco A. Servedio, Emanuele Viola. [doi]
- Matroid Intersection: A Pseudo-Deterministic Parallel Reduction from Search to Weighted-DecisionSumanta Ghosh, Rohit Gurjar. [doi]
- A New Notion of Commutativity for the Algorithmic Lovász Local LemmaDavid G. Harris, Fotis Iliopoulos, Vladimir Kolmogorov. [doi]
- An Estimator for Matching Size in Low Arboricity Graphs with Two ApplicationsHossein Jowhari. [doi]
- Pseudorandom Generators for Read-Once Monotone Branching ProgramsDean Doron, Raghu Meka, Omer Reingold, Avishay Tal, Salil P. Vadhan. [doi]
- Better Pseudodistributions and Derandomization for Space-Bounded ComputationWilliam M. Hoza. [doi]
- Hitting Weighted Even Cycles in Planar GraphsAlexander Göke, Jochen Könemann, Matthias Mnich, Hao Sun. [doi]
- Tight Approximation Algorithms For Geometric Bin Packing with Skewed ItemsArindam Khan 0001, Eklavya Sharma. [doi]
- On the Power of Choice for k-Colorability of Random GraphsVarsha Dani, Diksha Gupta, Thomas P. Hayes. [doi]
- Upper and Lower Bounds for Complete Linkage in General Metric SpacesAnna Arutyunova, Anna Großwendt, Heiko Röglin, Melanie Schmidt 0001, Julian Wargalla. [doi]
- Approximating Two-Stage Stochastic Supplier ProblemsBrian Brubach, Nathaniel Grammel, David G. Harris, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti. [doi]
- The Product of Gaussian Matrices Is Close to GaussianYi Li 0002, David P. Woodruff. [doi]
- Streaming Approximation Resistance of Every Ordering CSPNoah Singer, Madhu Sudan, Santhoshini Velusamy. [doi]
- Sampling Multiple Edges EfficientlyTalya Eden, Saleet Mossel, Ronitt Rubinfeld. [doi]
- Secretary Matching Meets Probing with CommitmentAllan Borodin, Calum MacRury, Akash Rakheja. [doi]
- Hardness of Approximation for Euclidean k-MedianAnup Bhattacharya, Dishant Goyal, Ragesh Jaiswal. [doi]
- Optimal Algorithms for Online b-Matching with Variable Vertex CapacitiesSusanne Albers, Sebastian Schubert. [doi]
- Peak Demand Minimization via Sliced Strip PackingMax A. Deppert, Klaus Jansen, Arindam Khan 0001, Malin Rau, Malte Tutas. [doi]