Table of Contents

• Connectivity Labeling Schemes for Edge and Vertex Faults via Expander HierarchiesYaowei Long, Seth Pettie, Thatchaphol Saranurak. 1-47 [doi]
• A Dichotomy Hierarchy for Linear Time Subgraph Counting in Bounded Degeneracy GraphsDaniel Paul-Pena, C. Seshadhri 0001. 48-87 [doi]
• n )Hsien-Chih Chang, Vincent Cohen-Addad, Jonathan Conroy, Hung Le 0001, Marcin Pilipczuk, Michal Pilipczuk. 88-123 [doi]
• Deterministic Edge Connectivity and Max Flow using Subquadratic Cut QueriesAditya Anand 0001, Thatchaphol Saranurak, Yunfan Wang. 124-142 [doi]
• Massively Parallel Minimum Spanning Tree in General Metric SpacesAmir Azarmehr, Soheil Behnezhad, Rajesh Jayaram, Jakub Lacki, Vahab Mirrokni, Peilin Zhong. 143-174 [doi]
• k-Center in GraphsCe Jin 0001, Yael Kirkpatrick, Virginia Vassilevska Williams, Nicole Wein. 175-211 [doi]
• k-Center Clustering with Optimal RecourseSebastian Forster, Antonis Skarlatos. 212-254 [doi]
• Clustering to Minimize Cluster-Aware Norm ObjectivesMartin G. Herold, Evangelos Kipouridis, Joachim Spoerhase. 255-287 [doi]
• Clustering Mixtures of Bounded Covariance Distributions Under Optimal SeparationIlias Diakonikolas, Daniel M. Kane, Jasper C. H. Lee, Thanasis Pittas. 288-322 [doi]
• Breaking the Two Approximation Barrier for Various Consensus Clustering ProblemsDebarati Das 0001, Amit Kumar. 323-372 [doi]
• Relative-error monotonicity testingXi Chen 0001, Anindya De, Yizhi Huang, Yuhao Li 0002, Shivam Nadimpalli, Rocco A. Servedio, Tianqi Yang. 373-402 [doi]
• Nearly Tight Bounds on Testing of Metric PropertiesYiqiao Bao, Sampath Kannan, Erik Waingarten. 403-445 [doi]
• Lower Bounds for Convexity TestingXi Chen 0001, Anindya De, Shivam Nadimpalli, Rocco A. Servedio, Erik Waingarten. 446-488 [doi]
• Tight Sampling Bounds for Eigenvalue ApproximationWilliam Swartworth, David P. Woodruff. 489-516 [doi]
• Near-Optimal-Time Quantum Algorithms for Approximate Pattern MatchingTomasz Kociumaka, Jakob Nogler, Philip Wellnitz. 517-534 [doi]
• A Subexponential Time Algorithm for Makespan Scheduling of Unit Jobs with Precedence ConstraintsJesper Nederlof, Céline M. F. Swennenhuis, Karol Wegrzycki. 535-552 [doi]
• Approximating Unrelated Machine Weighted Completion Time Using Iterative Rounding and Computer Assisted ProofsShi Li 0001. 553-571 [doi]
• Lift-and-Project Integrality Gaps for Santa ClausÉtienne Bamas. 572-615 [doi]
• The Submodular Santa Claus ProblemÉtienne Bamas, Sarah Morell, Lars Rohwedder. 616-640 [doi]
• ∈ )-Approximation Algorithm for Demand Strip PackingFranziska Eberle, Felix Hommelsheim, Malin Rau, Stefan Walzer. 641-699 [doi]
• Tree-Packing Revisited: Faster Fully Dynamic Min-Cut and ArboricityTijn de Vos, Aleksander B. G. Christiansen. 700-749 [doi]
• Fully Dynamic Approximate Minimum Cut in Subpolynomial Time per OperationAntoine El-Hayek, Monika Henzinger, Jason Li 0006. 750-784 [doi]
• Fully Dynamic Algorithms for Graph Spanners via Low-Diameter Router DecompositionJulia Chuzhoy, Merav Parter. 785-823 [doi]
• f Time BarrierAnton Bukov, Shay Solomon, Tianyi Zhang. 824-863 [doi]
• Settling the Pass Complexity of Approximate Matchings in Dynamic Graph StreamsSepehr Assadi, Soheil Behnezhad, Christian Konrad 0001, Kheeran K. Naidu, Janani Sundaresan. 864-904 [doi]
• Quartic quantum speedups for planted inferenceAlexander Schmidhuber, Ryan O'Donnell, Robin Kothari, Ryan Babbush. 905-913 [doi]
• Triply efficient shadow tomographyRobbie King, David Gosset, Robin Kothari, Ryan Babbush. 914-946 [doi]
• On Estimating the Trace of Quantum State PowersYupan Liu, Qisheng Wang. 947-993 [doi]
• A Quantum Speed-Up for Approximating the Top Eigenvectors of a MatrixYanlin Chen 0001, András Gilyén, Ronald de Wolf. 994-1036 [doi]
• Polynomial-Time Classical Simulation of Noisy IQP Circuits with Constant DepthJoel Rajakumar, James D. Watson, Yi-Kai Liu 0001. 1037-1056 [doi]
• Lipschitz Continuous Algorithms for Covering ProblemsSoh Kumabe, Yuichi Yoshida. 1057-1093 [doi]
• Approximately Counting Knapsack Solutions in Subquadratic TimeWeiming Feng 0001, Ce Jin 0001. 1094-1135 [doi]
• Balancing Notions of Equity: Trade-offs Between Fair Portfolio Sizes and Achievable GuaranteesSwati Gupta 0001, Jai Moondra, Mohit Singh. 1136-1165 [doi]
• Approximating Traveling Salesman Problems Using a Bridge LemmaMartin Böhm 0001, Zachary Friggstad, Tobias Mömke, Joachim Spoerhase. 1166-1177 [doi]
• Min-CSPs on Complete InstancesAditya Anand 0001, Euiwoong Lee, Amatya Sharma. 1178-1201 [doi]
• Constraint Satisfaction Problems with AdviceSuprovat Ghoshal, Konstantin Makarychev, Yury Markarychev. 1202-1221 [doi]
• New Prophet Inequalities via Poissonization and ShardingElfarouk Harb. 1222-1269 [doi]
• ℓ Items is EasyMathieu Molina, Nicolas Gast, Patrick Loiseau, Vianney Perchet. 1270-1307 [doi]
• New Combinatorial Insights for Monotone ApportionmentJavier Cembrano, José Correa 0001, Ulrike Schmidt-Kraepelin, Alexandros Tsigonias-Dimitriadis, Victor Verdugo. 1308-1328 [doi]
• Designing Automated Market Makers for Combinatorial Securities: A Geometric ViewpointPrommy Sultana Hossain, Xintong Wang, Fang-Yi Yu. 1329-1365 [doi]
• An Elementary Predictor Obtaining Distance to CalibrationEshwar Ram Arunachaleswaran, Natalie Collina, Aaron Roth 0001, Mirah Shi. 1366-1370 [doi]
• Prophet Secretary and Matching: the Significance of the Largest ItemZiyun Chen, Zhiyi Huang 0002, Dongchen Li, Zhihao Gavin Tang. 1371-1401 [doi]
• Fixed-Parameter Tractability of Hedge CutFedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Saket Saurabh 0001. 1402-1411 [doi]
• Crossing Number in Slightly Superexponential Time (Extended Abstract)Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Roohani Sharma, Jie Xue 0003, Meirav Zehavi. 1412-1424 [doi]
• Packing Short CyclesMatthias Bentert, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, William Lochet, Fahad Panolan, M. S. Ramanujan 0001, Saket Saurabh 0001, Kirill Simonov. 1425-1463 [doi]
• Unbreakable Decomposition in Close-to-Linear TimeAditya Anand 0001, Euiwoong Lee, Jason Li 0006, Yaowei Long, Thatchaphol Saranurak. 1464-1493 [doi]
• The Primal Pathwidth SETHMichael Lampis. 1494-1564 [doi]
• d-Hitting Set with Hard CapacitiesDaniel Lokshtanov, Abhishek Sahu, Saket Saurabh 0001, Vaishali Surianarayanan, Jie Xue 0003. 1565-1592 [doi]
• Deterministic Online Bipartite Edge ColoringJoakim Blikstad, Ola Svensson, Radu Vintan, David Wajc. 1593-1606 [doi]
• Eulerian Graph Sparsification by Effective Resistance DecompositionArun Jambulapati, Sushant Sachdeva, Aaron Sidford, Kevin Tian, Yibin Zhao 0003. 1607-1650 [doi]
• A Cut-Matching Game for Constant-Hop ExpandersBernhard Haeupler, Jonas Hübotter, Mohsen Ghaffari 0001. 1651-1678 [doi]
• Quasilinear-time eccentricities computation, and more, on median graphsPierre Bergé, Guillaume Ducoffe , Michel Habib. 1679-1704 [doi]
• Parallel and Distributed Expander Decomposition: Simple, Fast, and Near-OptimalDaoyuan Chen, Simon Meierhans, Maximilian Probst Gutenberg, Thatchaphol Saranurak. 1705-1719 [doi]
• A Multi-Dimensional Online Contention Resolution Scheme for Revenue MaximizationShuchi Chawla 0001, Dimitris Christou, Trung Dang, Zhiyi Huang, Gregory Kehne, Rojin Rezvan. 1720-1757 [doi]
• Hiring for An Uncertain Task: Joint Design of Information and ContractsMatteo Castiglioni, Junjie Chen. 1758-1794 [doi]
• A Reduction from Multi-Parameter to Single-Parameter Bayesian Contract DesignMatteo Castiglioni, Junjie Chen, Minming Li, Haifeng Xu, Song Zuo. 1795-1836 [doi]
• Majorized Bayesian Persuasion and Fair SelectionSiddhartha Banerjee, Kamesh Munagala, Yiheng Shen 0001, Kangning Wang 0001. 1837-1856 [doi]
• Multi-Agent Combinatorial ContractsPaul Dütting, Tomer Ezra, Michal Feldman, Thomas Kesselheim. 1857-1891 [doi]
• Linear equations with monomial constraints and decision problems in abelian-by-cyclic groupsRuiwen Dong 0001. 1892-1908 [doi]
• An Efficient Uniqueness Theorem for Overcomplete Tensor DecompositionPascal Koiran. 1909-1932 [doi]
• Improving the Leading Constant of Matrix MultiplicationJosh Alman, Hantao Yu. 1933-1971 [doi]
• Faster Linear Systems and Matrix Norm Approximation via Multi-level Sketched PreconditioningMichal Derezinski, Christopher Musco, Jiaming Yang. 1972-2004 [doi]
• More Asymmetry Yields Faster Matrix MultiplicationJosh Alman, Ran Duan, Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu, Renfei Zhou. 2005-2039 [doi]
• Improved List Size for Folded Reed-Solomon CodesShashank Srivastava. 2040-2050 [doi]
• Quasi-Monte Carlo Beyond Hardy-KrauseNikhil Bansal 0001, Haotian Jiang. 2051-2075 [doi]
• Tight Streaming Lower Bounds for Deterministic Approximate CountingYichuan Wang. 2076-2094 [doi]
• A Polylogarithmic Approximation for Directed Steiner Forest in Planar DigraphsChandra Chekuri, Rhea Jain. 2095-2110 [doi]
• Congestion-Approximators from the Bottom UpJason Li 0006, Satish Rao, Di Wang 0005. 2111-2131 [doi]
• (Almost) Ruling Out SETH Lower Bounds for All-Pairs Max-FlowOhad Trabeisi. 2132-2156 [doi]
• Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in GraphsFeodor F. Dragan, Guillaume Ducoffe , Michel Habib, Laurent Viennot. 2157-2193 [doi]
• Flip Dynamics for Sampling Colorings: Improving (11/6 - ε) Using A Simple MetricCharlie Carlson, Eric Vigoda. 2194-2212 [doi]
• Testing Approximate Stationarity Concepts for Piecewise Affine FunctionsLai Tian, Anthony Man-Cho So. 2213-2224 [doi]
• Forall-exist statements in pseudopolynomial timeEleonore Bach, Friedrich Eisenbrand, Thomas Rothvoss, Robert Weismantel. 2225-2233 [doi]
• Complexity of polytope diameters via perfect matchingsChristian Nöbel, Raphael Steiner. 2234-2251 [doi]
• The Change-of-Measure Method, Block Lewis Weights, and Approximating Matrix Block NormsNaren Sarayu Manoj, Max Ovsiankin. 2252-2300 [doi]
• Integer programs with nearly totally unimodular matrices: the cographic caseManuel Aprile, Samuel Fiorini, Gwenaël Joret, Stefan Kober, Miehal T. Seweryn, Stefan Weltge, Yelena Yuditsky. 2301-2312 [doi]
• Flipping Non-Crossing Spanning TreesHåvard Bakke Bjerkevik, Linda Kleist, Torsten Ueckerdt, Birgit Vogtenhuber. 2313-2325 [doi]
• PTASes for Euclidean TSP with Unit Disk and Unit Square NeighborhoodsSayan Bandyapadhyay, Katie Clinch, William Lochet, Daniel Lokshtanov, Saket Saurabh 0001, Jie Xue 0003. 2326-2356 [doi]
• Fast Static and Dynamic Approximation Algorithms for Geometric Optimization Problems: Piercing, Independent Set, Vertex Cover, and MatchingSujoy Bhore, Timothy M. Chan. 2357-2386 [doi]
• Strict Self-Assembly of Discrete Self-Similar Fractals in the abstract Tile Assembly ModelFlorent Becker, Daniel Hader, Matthew J. Patitz. 2387-2466 [doi]
• Path and Intersections: Characterization of Quasi-metrics in Directed Okamura-Seymour InstancesYu Chen 0039, Zihan Tan. 2467-2490 [doi]
• On the Uniqueness of Bayesian Coarse Correlated Equilibria in Standard First-Price and All-Pay AuctionsMete Seref Ahunbay, Martin Bichler. 2491-2537 [doi]
• Approximating Competitive Equilibrium by Nash WelfareJugal Garg, Yixin Tao, László A. Végh. 2538-2559 [doi]
• Tolls for Dynamic Equilibrium FlowsLukas Graf 0001, Tobias Harks, Julian Schwarz. 2560-2606 [doi]
• Platforms for Efficient and Incentive-Aware CollaborationNika Haghtalab, Mingda Qiao, Kunhe Yang. 2607-2628 [doi]
• Clock Auctions Augmented with Unreliable AdviceVasilis Gkatzelis, Daniel Schoepflin 0001, Xizhi Tan. 2629-2655 [doi]
• Near-optimal hierarchical matrix approximation from matrix-vector productsTyler Chen, Feyza Duman Keles, Diana Halikias, Cameron Musco, Christopher Musco, David Persson. 2656-2692 [doi]
• Improved Spectral Density Estimation via Explicit and Implicit DeflationRajarshi Bhattacharjee, Rajesh Jayaram, Cameron Musco, Christopher Musco, Archan Ray. 2693-2754 [doi]
• On the Decidability of Presburger Arithmetic Expanded with PowersToghrul Karimov, Florian Luca, Joris Nieuwveld, Joël Ouaknine, James Worrell 0001. 2755-2778 [doi]
• Solving Polynomial Equations Over Finite FieldsHolger Dell, Anselm Haak, Melvin Kallmayer, Leo Wennmann. 2779-2803 [doi]
• Fast Deterministic Chromatic Number under the Asymptotic Rank ConjectureAndreas Björklund, Radu Curticapean, Thore Husfeldt, Petteri Kaski, Kevin Pratt. 2804-2818 [doi]
• Private Mean Estimation with Person-Level Differential PrivacySushant Agarwal, Gautam Kamath 0001, Mahbod Majid, Argyris Mouzakis, Rose Silver, Jonathan R. Ullman. 2819-2880 [doi]
• Local Lipschitz Filters for Bounded-Range Functions with Applications to Arbitrary Real-Valued FunctionsJane Lange, Ephraim Linder, Sofya Raskhodnikova, Arsen Vasilyan. 2881-2907 [doi]
• Almost Tight Bounds for Differentially Private Densest SubgraphMichael Dinitz, Satyen Kale, Silvio Lattanzi, Sergei Vassilvitskii. 2908-2950 [doi]
• Improved Differentially Private Continual Observation Using Group AlgebraMonika Henzinger, Jalaj Upadhyay. 2951-2970 [doi]
• Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemerédi GraphsSepehr Assadi, Sanjeev Khanna, Peter Kiss. 2971-2990 [doi]
• Matching Composition and Efficient Weight Reduction in Dynamic MatchingAaron Bernstein, Jiale Chen 0003, Aditi Dudeja, Zachary Langley, Aaron Sidford, Ta-Wei Tu. 2991-3028 [doi]
• New Philosopher Inequalities for Online Bayesian Matching, via Pivotal SamplingMark Braverman, Mahsa Derakhshan, Tristan Pollner, Amin Saberi, David Wajc. 3029-3068 [doi]
• Entropy Regularization and Faster Decremental Matching in General GraphsJiale Chen 0003, Aaron Sidford, Ta-Wei Tu. 3069-3115 [doi]
• Online Dependent Rounding Schemes for Bipartite Matchings, withJoseph (Seffi) Naor, Aravind Srinivasan, David Wajc. 3116-3154 [doi]
• ε-scatter dimension via metric sparsityRomain Bourneuf, Marcin Pilipczuk. 3155-3171 [doi]
• The Johnson-Lindenstrauss Lemma for Clustering and Subspace Approximation: From Coresets to Dimension ReductionMoses Charikar, Erik Waingarten. 3172-3209 [doi]
• 1: Tree Ising Models via Truncated MetricsMoses Charikar, Spencer Compton, Chirag Pabbaraju. 3210-3266 [doi]
• Highway Dimension: a Metric ViewAndreas Emil Feldmann, Arnold Filtser. 3267-3276 [doi]
• Outlier-robust Mean Estimation near the Breakdown Point via Sum-of-SquaresHongjie Chen 0004, Deepak Narayanan Sridharan, David Steurer. 3277-3309 [doi]
• An analogue of Reed's conjecture for digraphsKen-ichi Kawarabayashi, Lucas Picasarri-Arrieta. 3310-3324 [doi]
• Weak coloring numbers of minor-closed graph classesJedrzej Hodor, Hoang La, Piotr Micek, Clément Rambaud. 3325-3334 [doi]
• Unique-neighbor Expanders with Better Expansion for Polynomial-sized SetsYeyuan Chen. 3335-3362 [doi]
• A coarse Erdős-Pósa theoremJungho Ahn, J. Pascal Gollin, Tony Huynh, O-joung Kwon. 3363-3381 [doi]
• Planar Graphs in Blowups of FansVida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood. 3382-3391 [doi]
• Streaming Algorithms via Local Algorithms for Maximum Directed CutRaghuvansh R. Saxena, Noah G. Singer, Madhu Sudan 0001, Santhoshini Velusamy. 3392-3408 [doi]
• Universal Perfect Samplers for Incremental StreamsSeth Pettie, Dingyu Wang. 3409-3422 [doi]
• Streaming and Communication Complexity of Load-Balancing via Matching ContractorsSepehr Assadi, Aaron Bernstein, Zachary Langley, Lap Chi Lau, Robert Wang 0004. 3423-3449 [doi]
• Understanding Memory-Regret Trade-Off for Streaming Stochastic Multi-Armed BanditsYuchen He 0006, ZiChun Ye, Chihao Zhang 0001. 3450-3485 [doi]
• Near-Optimal Relative Error Streaming Quantile Estimation via Elastic CompactorsElena Gribelyuk, Pachara Sawettamalya, Hongxun Wu, Huacheng Yu. 3486-3529 [doi]
• A Fast Algorithm for Computing Zigzag RepresentativesTamal K. Dey, Tao Hou 0002, Dmitriy Morozov. 3530-3546 [doi]
• Minimum Convex Hull and Maximum Overlap of Two Convex PolytopesMook Kwon Jung, Seokyun Kang, Hee-Kap Ahn. 3547-3561 [doi]
• Partitioning a Polygon Into Small PiecesMikkel Abrahamsen, Nichlas Langhoff Rasmussen. 3562-3589 [doi]
• Computing the second and third systoles of a combinatorial surfaceMatthijs Ebbens, Francis Lazarus. 3590-3610 [doi]
• An Efficient Regularity Lemma for Semi-Algebraic HypergraphsNatan Rubin. 3611-3636 [doi]
• From Graph Properties to Graph Parameters: Tight Bounds for Counting on Small SubgraphsSimon Döring, Dániel Marx, Philip Wellnitz. 3637-3676 [doi]
• Counting Small Induced Subgraphs: Hardness via Fourier AnalysisRadu Curticapean, Daniel Neuen. 3677-3695 [doi]
• Maximum Span Hypothesis: A Potentially Weaker Assumption than Gap-ETH for Parameterized ComplexityKarthik C. S. 0001, Subhash Khot. 3696-3727 [doi]
• Parameterizing the quantification of CMSO: model checking on minor-closed graph classesIgnasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos. 3728-3742 [doi]
• Losing Treewidth In The Presence Of WeightsMichal Wlodarczyk 0001. 3743-3761 [doi]
• Finding irrelevant vertices in linear time on bounded-genus graphsPetr A. Golovach, Stavros G. Kolliopoulos, Giannos Stamoulis, Dimitrios M. Thilikos. 3762-3774 [doi]
• Competitive strategies to use "warm start" algorithms with predictionsAvrim Blum, Vaidehi Srinivas. 3775-3801 [doi]
• Online Scheduling via Gradient Descent for Weighted Flow Time MinimizationQingyun Chen, Sungjin Im, Aditya Petety. 3802-3841 [doi]
• Stronger adversaries grow cheaper forests: online node-weighted Steiner problemsSander Borst, Marek Eliás 0001, Moritz Venzin. 3842-3864 [doi]
• Putting Off the Catching Up: Online Joint Replenishment Problem with Holding and Backlog CostsBenjamin Moseley, Aidin Niaparast, R. Ravi 0001. 3865-3883 [doi]
• Unweighted Layered Graph Traversal: Passing a Crown via Entropy MaximizationXingjian Bai, Christian Coester, Romain Cosson. 3884-3900 [doi]
• The Power of Proportional Fairness for Non-Clairvoyant Scheduling under Polyhedral ConstraintsSven Jäger 0001, Alexander Lindermayr, Nicole Megow. 3901-3930 [doi]
• d-ary Cuckoo Hashing at High Load Factors by Bubbling UpWilliam Kuszmaul, Michael Mitzenmacher. 3931-3952 [doi]
• Fast and Simple Sorting Using Partial InformationBernhard Haeupler, Richard Hladík, John Iacono, Václav Rozhon, Robert E. Tarjan, Jakub Tetek. 3953-3973 [doi]
• Tight Bounds and Phase Transitions for Incremental and Dynamic RetrievalWilliam Kuszmaul, Aaron Putterman, Tingqiang Xu, Hangrui Zhou, Renfei Zhou. 3974-3997 [doi]
• A Cell Probe Lower Bound for the Predecessor Search Problem in PRAMPeyman Afshani, Nodari Sitchinava. 3998-4008 [doi]
• k Document Retrieval in Compressed SpaceGonzalo Navarro 0001, Yakov Nekrich. 4009-4030 [doi]
• k mismatchesJonas Ellert, Pawel Gawrychowski, Adam Górkiewicz, Tatiana Starikovskaya. 4031-4060 [doi]
• Parks and Recreation: Color Fault-Tolerant Spanners Made LocalMerav Parter, Asaf Petruschka, Shay Sapir, Elad Tzalik. 4061-4094 [doi]
• Asynchronous 3-Majority Dynamics with Many OpinionsColin Cooper, Frederik Mallmann-Trenn, Tomasz Radzik, Nobutaka Shimizu, Takeharu Shiraga. 4095-4131 [doi]
• Sublinear-Round Broadcast without Trusted SetupAndreea B. Alexandru, Julian Loss, Charalampos Papamanthou, Giorgos Tsimos, Benedikt Wagner. 4132-4171 [doi]
• Fully-Distributed Byzantine Agreement in Sparse NetworksJohn Augustine, Fabien Dufoulon, Gopal Pandurangan. 4172-4197 [doi]
• On the Locality of Hall's TheoremSebastian Brandt 0002, Yannic Maus, Ananth Narayanan, Florian Schager, Jara Uitto. 4198-4226 [doi]
• Partial Synchrony for Free: New Upper Bounds for Byzantine AgreementPierre Civit, Muhammad Ayaz Dzulfikar, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, Manuel Vidigueira, Igor Zablotchi. 4227-4291 [doi]
• Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree CoversSujoy Bhore, Balázs Keszegh, Andrey Kupavskii, Hung Le 0001, Alexandre Louvet, Dömötör Pálvölgyi, Csaba D. Tóth. 4292-4326 [doi]
• A Lower Bound for Light Spanners in General GraphsGreg Bodwin, Jeremy Flics. 4327-4337 [doi]
• Subquadratic algorithms in minor-free digraphs: (weighted) distance oracles, decrementai reachability, and moreAdam Karczmarz, Da-Wei Zheng. 4338-4351 [doi]
• Having Hope in Missing Spanners: New Distance Preservers and Light HopsetsShimon Kogan, Merav Parter. 4352-4374 [doi]
• Improved Online Reachability PreserversGreg Bodwin, Tuong Le. 4375-4404 [doi]
• New Separations and Reductions for Directed Hopsets and PreserversGary Hoppenworth, Yinzhan Xu, Zixuan Xu. 4405-4443 [doi]
• Tree Independence Number IV. Even-hole-free graphsMaria Chudnovsky, Peter Gartland, Sepehr Hajebi, Daniel Lokshtanov, Sophie Spirkl. 4444-4461 [doi]
• A Refutation of the Pach-Tardos Conjecture for 0-1 MatricesSeth Pettie, Gábor Tardos. 4462-4483 [doi]
• Recognizing Sumsets is NP-CompleteAmir Abboud, Nick Fischer, Ron Safier, Nathan Wallheimer. 4484-4506 [doi]
• A topological proof of the Hell-Nešetřil dichotomySebastian Meyer, Jakub Oprsal. 4507-4519 [doi]
• Sumsets, 3SUM, Subset Sum: Now for Real!Nick Fischer. 4520-4546 [doi]
• New Applications of 3SUM-Counting in Fine-Grained Complexity and Pattern MatchingNick Fischer, Ce Jin 0001, Yinzhan Xu. 4547-4595 [doi]
• Beating Bellman's Algorithm for Subset SumKarl Bringmann, Nick Fischer, Vasileios Nakos. 4596-4612 [doi]
• Average-Case Hardness of Parity Problems: Orthogonal Vectors, k-SUM and MoreMina Dalirrooyfard, Andrea Lincoln, Barna Saha, Virginia Vassilevska Williams. 4613-4643 [doi]
• Exact Thresholds for Noisy Non-Adaptive Group TestingJunren Chen, Jonathan Scarlett. 4644-4706 [doi]
• Inapproximability of Maximum Diameter Clustering for Few ClustersHenry L. Fleischmann, Kyrylo Karlov, Karthik C. S. 0001, Ashwin Padaki, Stepan Zharkov. 4707-4731 [doi]
• Coresets for Constrained Clustering: General Assignment Constraints and Improved Size BoundsLingxiao Huang, Jian Li 0015, Pinyan Lu, Xuan Wu 0002. 4732-4782 [doi]
• A Tight VC-Dimension Analysis of Clustering Coresets with ApplicationsVincent Cohen-Addad, Andrew Draganov, Matteo Russo 0002, David Saulpic, Chris Schwiegelshohn. 4783-4808 [doi]
• Efficient Approximation Algorithm for Computing Wasserstein Barycenter under Euclidean MetricPankaj K. Agarwal, Sharath Raghvendra, Pouyan Shirzadian, Keegan Yao. 4809-4826 [doi]
• Gains-from-Trade in Bilateral Trade with a BrokerIlya Hajiaghayi, MohammadTaghi Hajiaghayi, Gary Peng, Suho Shin. 4827-4860 [doi]
• Faster Vizing and Near-Vizing Edge Coloring AlgorithmsSepehr Assadi. 4861-4898 [doi]
• A Sublinear-Time Algorithm for Nearly-Perfect Matchings in Regular Non-Bipartite GraphsVarsha Dani, Thomas P. Hayes. 4899-4913 [doi]
• Even Faster (Δ + 1)-Edge Coloring via Shorter Multi-Step Vizing ChainsSayan Bhattacharya, Martín Costa, Shay Solomon, Tianyi Zhang. 4914-4947 [doi]
• Randomized Greedy Online Edge Coloring Succeeds for Dense and Randomly-Ordered GraphsAditi Dudeja, Rashmika Goswami, Michael Saks 0001. 4948-4982 [doi]
• Fully Dynamic (Δ + 1)-Coloring Against Adaptive AdversariesSoheil Behnezhad, Rajmohan Rajaraman, Omer Wasim. 4983-5026 [doi]
• Relating Interleaving and Fréchet Distances via Ordered Merge TreesThijs Beurskens, Tim Ophelders, Bettina Speckmann, Kevin Verbeek. 5027-5050 [doi]
• Facet-HamiltonicityHugo A. Akitaya, Jean Cardinal, Stefan Felsner, Linda Kleist, Robert Lauff. 5051-5064 [doi]
• Differentiable Approximations for Distance QueriesAhmed Abdelkader, David M. Mount. 5065-5099 [doi]
• Fréchet Distance in Subquadratic TimeSiu-Wing Cheng, Haoqiang Huang. 5100-5113 [doi]
• A Discrete Analog of Tutte's Barycentric Embeddings on SurfacesÉric Colin de Verdière, Vincent Despré, Loïc Dubois 0001. 5114-5146 [doi]
• Fine-Grained Optimality of Partially Dynamic Shortest Paths and MoreBarna Saha, Virginia Vassilevska Williams, Yinzhan Xu, Christopher Ye 0001. 5147-5190 [doi]
• All-Hops Shortest PathsVirginia Vassilevska Williams, Zoe Xi, Yinzhan Xu, Uri Zwick. 5191-5206 [doi]
• n-Pairs Shortest Paths and All-Nodes Shortest CyclesShiri Chechik, Itay Hoch, Gur Lifshitz. 5207-5238 [doi]
• Faster single-source shortest paths with negative real weights via proper hop distanceYufan Huang, Peter Jin, Kent Quanrud. 5239-5244 [doi]
• Improved Shortest Path Restoration Lemmas for Multiple Edge Failures: Trade-offs Between Fault-tolerance and SubpathsGreg Bodwin, Lily Wang. 5245-5262 [doi]
• Faster Approximation Algorithms for Restricted Shortest Paths in Directed GraphsVikrant Ashvinkumar, Aaron Bernstein, Adam Karczmarz. 5263-5277 [doi]
• 3 membership queriesYunbum Kook, Matthew S. Zhang. 5278-5306 [doi]
• Potential Hessian Ascent: The Sherrington-Kirkpatrick ModelDavid Jekel, Juspreet Singh Sandhu, Jonathan Shi. 5307-5387 [doi]
• Spectral Independence Beyond Total Influence on Trees and Related GraphsXiaoyu Chen, Xiongxin Yang, Yitong Yin, Xinyuan Zhang. 5388-5417 [doi]
• Optimal Mixing for Randomly Sampling Edge Colorings on Trees Down to the Max DegreeCharlie Carlson, Xiaoyu Chen, Weiming Feng 0001, Eric Vigoda. 5418-5433 [doi]
• Mean-field Potts and random-cluster dynamics from high-entropy initializationsAntonio Blanca, Reza Gheissari, Xusheng Zhang. 5434-5467 [doi]
• FPTAS for Holant Problems with Log-Concave SignaturesKun He, Zhidan Li, Guoliang Qiu 0001, Chihao Zhang 0001. 5468-5503 [doi]
• Low Degree Local Correction Over the Boolean CubePrashanth Amireddy, Amik Raj Behera, Manaswi Paraashar, Srikanth Srinivasan 0001, Madhu Sudan 0001. 5504-5511 [doi]
• Quantum Locally Recoverable CodesLouis Golowich, Venkatesan Guruswami. 5512-5522 [doi]
• Locally Testable Tree CodesTamer Moud, Alon Rosen, Ron Rothblum. 5523-5559 [doi]
• Improved Explicit Near-Optimal Codes in the High-Noise RegimesXin Li, Songtao Mao. 5560-5581 [doi]
• k-wise Independent Permutations from Random Reversible Circuits via log-Sobolev InequalitiesLucas Gretta, William He, Angelos Pelecanos. 5582-5598 [doi]
• Hermitian Diagonalization in Linear PrecisionRikhav Shah. 5599-5615 [doi]