Table of Contents

• Lower bounds for the universal TSP on the planeCosmas Kravaris. 1-9 [doi]
• Tight Differentially Private PCA via Matrix CoherenceTommaso d'Orsi, Gleb Novikov. 10-51 [doi]
• Improved Approximation for Ranking on General GraphsMahsa Derakhshan, Mohammad Roghani, Mohammad Saneian, Tao Yu 0014. 52-84 [doi]
• Online Connectivity AugmentationMohit Garg 0003, Aditya Subramanian 0001. 85-104 [doi]
• Stochastic Embedding of Digraphs into DAGsArnold Filtser. 105-119 [doi]
• Low-Sensitivity Matching via Sampling from Gibbs DistributionsYuichi Yoshida, Zihan Zhang. 120-149 [doi]
• From Incremental Transitive Cover to Strongly Polynomial Maximum FlowDaniel Dadush, James B. Orlin, Aaron Sidford, László A. Végh. 150-163 [doi]
• Centered colorings in minor-closed graph classesJedrzej Hodor, Hoang La, Piotr Micek, Clément Rambaud. 164-184 [doi]
• On the Computation of Schrijver's KernelsVincent Delecroix, Oscar Fontaine, Francis Lazarus. 185-216 [doi]
• From Unweighted to Weighted Dynamic Matching in Non-Bipartite Graphs: A Low-Loss ReductionAaron Bernstein, Jiale Chen 0003. 217-246 [doi]
• Determinization of Min-Plus Weighted Automata is DecidableShaull Almagor, Guy Arbel, Sarai Sheinvald. 247-257 [doi]
• t Cuts with Fewer Cut QueriesYonggang Jiang, Danupon Nanongkai, Pachara Sawettamalya. 258-296 [doi]
• Near-Optimal Centerpoints in Polynomial Time in the Ambient DimensionKunal Dutta, Karol Pisula. 297-313 [doi]
• An Unconditional Lower Bound for the Active-Set Method in Convex Quadratic MaximizationEleon Bach, Yann Disser, Sophie Huiberts, Nils Mosis. 314-327 [doi]
• Interaction Between Skew-representability, Tensor Products, Extension Properties, and Rank InequalitiesKristóf Bérczi, Boglárka Gehér, András Imolay, László Lovász 0001, Carles Padró, Tamás Schwarcz. 328-354 [doi]
• Finite Pinwheel Scheduling: the k-Visits ProblemSotiris Kanellopoulos, Christos Pergaminelis, Maria Kokkou, Euripides Markou, Aris Pagourtzis. 355-371 [doi]
• Cell-Probe Lower Bounds via Semi-Random CSP Refutation: Simplified and the Odd-Locality CaseVenkatesan Guruswami, Xin Lyu 0003, Weiqiang Yuan 0002. 372-387 [doi]
• A Classification of Long-Refinement Graphs for Colour RefinementSandra Kiefer, T. Devini de Mel. 388-407 [doi]
• Computational Complexity in Property TestingRenato Ferreira Pinto Jr., Diptaksho Palit, Sofya Raskhodnikova. 408-440 [doi]
• Feature Selection and Junta Testing are Statistically EquivalentLorenzo Beretta 0001, Nathaniel Harms, Caleb Koch 0001. 441-469 [doi]
• Halfspaces are hard to test with relative errorXi Chen 0001, Anindya De, Yizhi Huang, Shivam Nadimpalli, Rocco A. Servedio, Tianqi Yang. 470-492 [doi]
• Computational barriers for permutation-based problems, and cumulants of weakly dependent random variablesBertrand Even, Christophe Giraud 0002, Nicolas Verzelen. 493-562 [doi]
• Short circuit walks in fixed dimensionAlexander E. Black, Christian Nöbel, Raphael Steiner. 563-573 [doi]
• Space-efficient population protocols for exact majority on general graphsJoel Rybicki, Jakob Solnerzik, Olivier Stietel, Robin Vacus. 574-612 [doi]
• Deterministic and Exact Fully-dynamic Minimum Cut of Superpolylogarithmic Size in Subpolynomial TimeAntoine El-Hayek, Monika Henzinger, Jason Li 0006. 613-663 [doi]
• Combinatorial Selection with Costly InformationShuchi Chawla 0001, Dimitrios Christou, Amit Harlev, Ziv Scully. 664-717 [doi]
• Coloring 3-Colorable Graphs with Low Threshold RankJun-Ting Hsieh. 718-726 [doi]
• Near-Optimal Min-Sum Multi-Robot Motion Planning in a Planar Polygonal EnvironmentPankaj K. Agarwal, Benjamin Holmgren, Alex Steiger. 727-741 [doi]
• An optimal algorithm for average distance in typical regular graphsAlexandros Eskenazis, Manor Mendel, Assaf Naor. 742-757 [doi]
• A Broader View on Clustering under Cluster-Aware Norm ObjectivesMartin G. Herold, Evangelos Kipouridis, Joachim Spoerhase. 758-793 [doi]
• Language Generation in the Limit: Noise, Loss, and FeedbackYannan Bai, Debmalya Panigrahi, Ian Zhang 0003. 794-816 [doi]
• Unbounded Error Correcting CodesKlim Efremenko, Or Zamir. 817-832 [doi]
• Generating pivot Gray codes for spanning trees of complete graphs in constant amortized timeBowie Liu, Dennis Wong, Chan-Tong Lam, Sio Kei Im. 833-870 [doi]
• Excluding a Line Minor via Design Matrices and Column Number Bounds for the Circuit Imbalance MeasureDaniel Dadush, Friedrich Eisenbrand, Rom Pinchasi, Thomas Rothvoss, Neta Singer. 871-879 [doi]
• Algorithmic Improvements to List Decoding of Folded Reed-Solomon CodesVikrant Ashvinkumar, Mursalin Habib 0001, Shashank Srivastava. 880-898 [doi]
• Distributed Interactive Proofs for Planarity with Log-Star CommunicationYuval Gil, Merav Parter. 899-924 [doi]
• Approaching Optimality for Solving Dense Linear Systems with Low-Rank StructureMichal Derezinski, Aaron Sidford. 925-938 [doi]
• Faster Estimation of the Average Degree of a Graph Using Random Edges and Structural QueriesLorenzo Beretta 0001, Deeparnab Chakrabarty, C. Seshadhri 0001. 939-971 [doi]
• On sampling two spin models using the local connective constantCharilaos Efthymiou 0001. 972-983 [doi]
• p when p > 2Assaf Naor, Kevin Ren. 984-995 [doi]
• Local Gibbs sampling beyond local uniformityHongyang Liu, Chunyang Wang 0003, Yitong Yin. 996-1025 [doi]
• Does block size matter in randomized block Krylov low-rank approximation?Tyler Chen, Ethan N. Epperly, Raphael A. Meyer, Christopher Musco, Akash Rao. 1026-1046 [doi]
• Deterministic Dynamic Edge ColouringAleksander B. G. Christiansen. 1047-1096 [doi]
• History-Independent Load BalancingMichael A. Bender, William Kuszmaul, Elaine Shi, Rose Silver. 1097-1127 [doi]
• Dynamic Hierarchical j-Tree Decomposition and Its ApplicationsGramoz Goranci, Monika Henzinger, Peter Kiss, Ali Momeni 0003, Gernot Zöcklein. 1128-1180 [doi]
• Tree Embedding in High Dimensions: Dynamic and Massively ParallelGramoz Goranci, Shaofeng H.-C. Jiang, Peter Kiss, Qihao Kong, Yi Qian, Eva Szilagyi. 1181-1213 [doi]
• An Optimal Online Algorithm for Robust Flow Time SchedulingAnupam Gupta 0001, Amit Kumar 0001, Debmalya Panigrahi, Zhaozi Wang. 1214-1238 [doi]
• Learning Packing and Covering from SamplesAnupam Gupta 0001, Marco Molinaro 0001. 1239-1267 [doi]
• Distributed Quantum Advantage in Locally Checkable Labeling ProblemsAlkida Balliu, Filippo Casagrande, Francesco D'Amore 0001, Massimo Equi, Barbara Keller, Henrik Lievonen, Dennis Olivetti, Gustav Schmid, Jukka Suomela. 1268-1308 [doi]
• Polynomial-Time Classical Simulation of Noisy Quantum Circuits with Naturally Fault-Tolerant GatesJon Nelson, Joel Rajakumar, Dominik Hangleiter, Michael J. Gullans. 1309-1331 [doi]
• Bounding the asymptotic quantum value of all multipartite compiled non-local gamesMatilde Baroni, Dominik Leichtle, Sinisa Jankovic, Ivan Supic. 1332-1382 [doi]
• Quantum Advantage via Solving Multivariate PolynomialsPierre Briaud, Itai Dinur, Riddhi Ghosal, Aayush Jain, Paul Lou, Amit Sahai. 1383-1423 [doi]
• Quantum Hamiltonian CertificationMinbo Gao, Zhengfeng Ji, Qisheng Wang, Wenjun Yu, Qi Zhao. 1424-1467 [doi]
• A Better-Than-5/4-Approximation for Two-Edge ConnectivityFelix Hommelsheim, Alexander Lindermayr, Zhenwei Liu. 1468-1520 [doi]
• Augmenting Packing Dynamic Programs to Handle (Many) Additional Budget ConstraintsAlexander Armbruster, Fabrizio Grandoni 0001, Antoine Tinguely, Andreas Wiese. 1521-1535 [doi]
• A Better-Than-2 Approximation for the Directed Tree Augmentation ProblemMeike Neuwohner, Olha Silina, Michael Zlatin. 1536-1569 [doi]
• Unsplittable Flow Cut Gap in Undirected GraphsDavid Alemán Espinosa, Nikhil Kumar 0001, Joseph Poremba, F. Bruce Shepherd. 1570-1605 [doi]
• Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and HardnessSanjeev Khanna, Ashwin Padaki, Erik Waingarten. 1606-1630 [doi]
• Efficiently Constructing Sparse Navigable GraphsAlex Conway 0001, Laxman Dhulipala, Martin Farach-Colton, Rob Johnson 0001, Ben Landrum, Christopher Musco, Yarin Shechter, Torsten Suel, Richard Wen. 1631-1665 [doi]
• Contextual Search in Principal-Agent Games: The Curse of DegeneracyYiding Feng 0001, Mengfan Ma, Bo Peng, Zongqi Wan. 1666-1723 [doi]
• Compatibility of Fairness and Nash Welfare under Subadditive ValuationsSiddharth Barman, Mashbat Suzuki. 1724-1746 [doi]
• Approximately Dominating Sets in ElectionsMoses Charikar, Prasanna Ramakrishnan, Kangning Wang 0001. 1747-1760 [doi]
• Likelihood of the Existence of Average Justified RepresentationQishen Han, Biaoshuai Tao, Lirong Xia, Chengkai Zhang, Houyu Zhou. 1761-1794 [doi]
• Optimal Type-Dependent Liquid Welfare Guarantees for Autobidding Agents with BudgetsRiccardo Colini-Baldeschi, Sophie Klumper, Twan Kroll, Stefano Leonardi 0001, Guido Schäfer, Artem Tsikiridis. 1795-1823 [doi]
• Tight Lower Bounds for Central String Queries in Compressed SpaceDominik Kempa, Tomasz Kociumaka. 1824-1840 [doi]
• Explaining the Inherent Tradeoffs for Suffix Array Functionality: Equivalences between String Problems and Prefix Range QueriesDominik Kempa, Tomasz Kociumaka. 1841-1858 [doi]
• 2/3)Itai Boneh, Shay Golan 0001, Matan Kraus. 1859-1872 [doi]
• Space-Efficient k-Mismatch Text IndexesTomasz Kociumaka, Jakub Radoszewski. 1873-1902 [doi]
• Optimal Random Access and Conditional Lower Bounds for 2D Compressed StringsRajat De, Dominik Kempa. 1903-1915 [doi]
• k-SUM Hardness Implies Treewidth-SETHMichael Lampis. 1916-1944 [doi]
• Circuits and Backdoors: Five Shades of the SETHMichael Lampis. 1945-2001 [doi]
• The Parameterised Complexity of Counting Small Sub-HypergraphsMarco Bressan 0002, Julian Brinkmann, Holger Dell, Marc Roth, Philip Wellnitz. 2002-2014 [doi]
• Augmenting to 4-vertex connectivity is fixed-parameter tractableJohannes Carmesin, M. S. Ramanujan 0001. 2015-2042 [doi]
• Finding sparse induced subgraphs on graphs of bounded induced matching treewidthHans L. Bodlaender, Fedor V. Fomin, Tuukka Korhonen. 2043-2068 [doi]
• A Logic-based Algorithmic Meta-Theorem for Treedepth: Single Exponential FPT Time and Polynomial SpaceBenjamin Bergougnoux, Vera Chekan, Giannos Stamoulis. 2069-2098 [doi]
• Prophet Inequality from Samples: Is the More the Merrier?Tomer Ezra. 2099-2112 [doi]
• Contract Design Beyond Hidden-ActionsTomer Ezra, Stefano Leonardi 0001, Matteo Russo 0002. 2113-2133 [doi]
• The Communication Complexity of Combinatorial Auctions with Additional Succinct BiddersFrederick V. Qiu, S. Matthew Weinberg, Qianfan Zhang 0002. 2134-2162 [doi]
• The Power of Matching for Online Fractional Hedonic GamesMartin Bullinger, René Romen, Alexander Schlenga. 2163-2194 [doi]
• Hallucinating Flows for Optimal MechanismsMarios Mertzanidis, Athina Terzoglou. 2195-2238 [doi]
• Improved Maximin Share Guarantee for Additive ValuationsEhsan Heidari, Alireza Kaviani, Masoud Seddighin, AmirMohammad Shahrezaei. 2239-2290 [doi]
• The Directed Disjoint Paths Problem with CongestionMatthias Bentert, Dario Cavallaro, Amelie Heindl, Ken-ichi Kawarabayashi, Stephan Kreutzer, Johannes Schröder. 2291-2315 [doi]
• Disjoint Paths in Expanders in Deterministic Almost-Linear Time via Hypergraph Perfect MatchingMatija Bucic, Zhongtian He, Shang-En Huang, Thatchaphol Saranurak. 2316-2336 [doi]
• Balanced Spanning Tree Distributions Have Separation FairnessHarry Chen, Kamesh Munagala, Govind S. Sankar. 2337-2402 [doi]
• A CSP approach to Graph Sandwich ProblemsManuel Bodirsky, Santiago Guzmán-Pro. 2403-2418 [doi]
• Faster negative length shortest paths by bootstrapping hop reducersYufan Huang, Peter Jin, Kent Quanrud. 2419-2429 [doi]
• Perfect Matchings in Random Sparsifications of Dense HypergraphsJie Han, Jingwen Zhao. 2430-2454 [doi]
• A Classical Quadratic Speedup for Planted k xorMeghal Gupta, William He, Ryan O'Donnell, Noah G. Singer. 2455-2472 [doi]
• Efficient Online Random Sampling via Randomness RecyclingThomas L. Draper, Feras A. Saad. 2473-2511 [doi]
• Explicit Min-wise Hash Families with Optimal SizeXue Chen, Shengtang Huang, Xin Li 0006. 2512-2539 [doi]
• On Distributed Colouring of Hyperbolic Random GraphsYannic Maus, Janosch Ruff. 2540-2553 [doi]
• Improving Algorithmic Efficiency using Cryptography: Trapdoored Matrices and ApplicationsVinod Vaikuntanathan, Or Zamir. 2554-2574 [doi]
• Comparison Theorems for the Mixing Times of Systematic and Random Scan DynamicsJason Gaitonde, Elchanan Mossel. 2575-2587 [doi]
• Approximating Matroid Basis Testing for Partition Matroids using Budget-In-ExpectationLisa Hellerstein, Benedikt M. Plank, Kevin Schewior. 2588-2616 [doi]
• Smooth Trade-off for Tensor PCA via Sharp Bounds for Kikuchi MatricesPravesh K. Kothari, Jeff Xu. 2617-2632 [doi]
• Peeling Rotten Potatoes for a Faster Approximation of Convex CoverOmrit Filtser, Tzalik Maimon, Ofir Yomtovyan. 2633-2643 [doi]
• Breaching the 2-Approximation Barrier for Euclidean Capacitated Vehicle RoutingZachary Friggstad, Fabrizio Grandoni 0001, Ramin Mousavi. 2644-2668 [doi]
• Approximate Light Spanners in Planar GraphsHung Le 0001, Shay Solomon, Cuong Than, Csaba D. Tóth, Tianyi Zhang 0008. 2669-2701 [doi]
• Online Joint Replenishment Problem with Arbitrary Holding and Backlog CostsYossi Azar, Shahar Lewkowicz. 2702-2725 [doi]
• Improved Online Algorithms for Inventory Management Problems with Holding and Delay Costs: Riding the Wave Makes Things Simpler, Stronger, & More GeneralDavid B. Shmoys, Varun Suriyanarayana, Seeun William Umboh. 2726-2742 [doi]
• Detecting Correlation Efficiently in Very Supercritical Stochastic Block Models: Breaking the Otter's Threshold BarrierGuanyi Chen, Jian Ding, Shuyang Gong, Zhangsong Li. 2743-2759 [doi]
• New Oracles and Labeling Schemes for Vertex Cut QueriesYonggang Jiang, Merav Parter, Asaf Petruschka. 2760-2791 [doi]
• Expander Pruning with Polylogarithmic Worst-Case Recourse and Update TimeSimon Meierhans, Maximilian Probst Gutenberg, Thatchaphol Saranurak. 2792-2823 [doi]
• Faster Negative-Weight Shortest Paths and Directed Low-Diameter DecompositionsJason Li 0006, Connor Mowry, Satish Rao. 2824-2845 [doi]
• An Optimal Density Bound for Discretized Point PatrollingAhan Mishra. 2846-2875 [doi]
• Temporal Exploration of Random Spanning Tree ModelsSamuel Baguley, Andreas Göbel 0001, Nicolas Klodt, George Skretas, John Sylvester 0001, Viktor Zamaraev. 2876-2887 [doi]
• Helly-Type Theorems for Splitting Point SetsLidor Portal, Natan Rubin. 2888-2902 [doi]
• On a Clique Game and the Erdős-Hajnal Problem on High-Chromatic High-Girth SubgraphsSeth Pettie, Gábor Tardos, Bartosz Walczak. 2903-2927 [doi]
• Time-Biased Random Walks and Robustness of ExpandersSam Olesker-Taylor, Thomas Sauerwald, John Sylvester 0001. 2928-2941 [doi]
• A Tutte-type canonical decomposition of 3- and 4-connected graphsJan Kurkofka, Tim Planken. 2942-3021 [doi]
• On the edge expansion of random polytopesAsaf Ferber, Michael Krivelevich, Marcelo Sales, Wojciech Samotij. 3022-3035 [doi]
• 2-Discrepancy Minimization with Additive DeviationsKunal Dutta. 3036-3056 [doi]
• Spectral clustering in birthday paradox timeMichael Kapralov, Ekaterina Kochetkova, Weronika Wrzos-Kaminska. 3057-3071 [doi]
• Testing forbidden order-pattern properties on hypergridsHarish Chandramouleeswaran, Ilan Newman, Tomer Pelleg, Nithin Varma 0001. 3072-3100 [doi]
• Streaming and Massively Parallel Algorithms for Euclidean Max-CutNicolas Menand, Erik Waingarten. 3101-3161 [doi]
• One Attack to Rule Them All: Tight Quadratic Bounds for Adaptive Queries on Cardinality SketchesEdith Cohen, Jelani Nelson, Tamás Sarlós, Mihir Singhal, Uri Stemmer. 3162-3200 [doi]
• Sublinear Time Low-Rank Approximation of Hankel MatricesMichael Kapralov, Cameron Musco, Kshiteej Sheth. 3201-3248 [doi]
• Online Learning with Limited Information in the Sliding Window ModelVladimir Braverman, Sumegha Garg, Chen Wang 0027, David P. Woodruff, Samson Zhou. 3249-3297 [doi]
• A Post-Quantum Lower Bound for the Distributed Lovasz Local LemmaSebastian Brandt 0002, Tim Göttlicher. 3298-3312 [doi]
• Beating full state tomography for unentangled spectrum estimationAngelos Pelecanos, Xinyu Tan, Ewin Tang, John Wright 0004. 3313-3363 [doi]
• On the Quantum Chromatic GapLorenzo Ciardo. 3364-3377 [doi]
• Quantum State Preparation with Optimal T-CountDavid Gosset, Robin Kothari, Kewen Wu 0005. 3378-3406 [doi]
• Rapid mixing for Gibbs states within a logical sector: a dynamical view of self-correcting quantum memoriesThiago Bergamaschi, Reza Gheissari, Yunchao Liu. 3407-3422 [doi]
• Weighted Pseudorandom Generators for Read-Once Branching Programs via Weighted Pseudorandom ReductionsKuan Cheng, Ruiyang Wu 0002. 3423-3458 [doi]
• Tree covers of size 2 for the Euclidean planeArtur Bikeev, Andrey Kupavskii, Maxim Turevskii. 3459-3471 [doi]
• Covering the Euclidean Plane by a Pair of TreesHung Le 0001, Lazar Milenkovic, Shay Solomon, Tianyi Zhang 0008. 3472-3497 [doi]
• A (2 + ε)-approximation algorithm for the general scheduling problem in quasipolynomial timeAlexander Armbruster, Lars Rohwedder, Andreas Wiese. 3498-3510 [doi]
• (α, β)-Spanners and Hybrid Spanners with Nearly Tight BoundsShiri Chechik, Gur Lifshitz. 3511-3535 [doi]
• Shortcuts and Transitive-Closure Spanners ApproximationParinya Chalermsook, Yonggang Jiang, Sagnik Mukhopadhyay, Danupon Nanongkai. 3536-3561 [doi]
• A Truly Subcubic Combinatorial Algorithm for Induced 4-Cycle DetectionAmir Abboud, Shyan Akmal, Nick Fischer. 3562-3599 [doi]
• Derandomizing Pseudopolynomial Algorithms for Subset SumTimothy M. Chan. 3600-3610 [doi]
• Long Arithmetic Progressions in Sparse Subset Sums: A Computational PerspectiveLin Chen 0009, Yuchen Mao 0001, Guochuan Zhang. 3611-3638 [doi]
• Improved Additive Approximation Algorithms for APSPCe Jin 0001, Yael Kirkpatrick, Michal Stawarz, Virginia Vassilevska Williams. 3639-3651 [doi]
• Near-linear time subhypergraph counting in bounded degeneracy hypergraphsDaniel Paul-Pena, C. Seshadhri 0001. 3652-3687 [doi]
• A well-separated pair decomposition for low density graphsJoachim Gudmundsson, Sampson Wong. 3688-3723 [doi]
• Dynamic 3D Convex Hulls Revisited and ApplicationsHaitao Wang 0001. 3724-3744 [doi]
• Computing the Heaviest Disk and Related ProblemsPankaj K. Agarwal, Esther Ezra, Micha Sharir. 3745-3759 [doi]
• Succinct Dynamic Rank/Select: Bypassing the Tree-Structure BottleneckWilliam Kuszmaul, Jingxun Liang, Renfei Zhou. 3760-3804 [doi]
• A Simple and Fast Reduction from Gomory-Hu Trees to Polylog MaxflowsMaximilian Probst Gutenberg, Rasmus Kyng, Weixuan Yuan, Wuwei Yuan. 3805-3819 [doi]
• PageRank Centrality in Directed Graphs with Bounded In-DegreeMikkel Thorup, Hanzhi Wang 0001, Zhewei Wei, Mingji Yang 0001. 3820-3840 [doi]
• Selfish, Local and Online Scheduling via Vector FittingDanish Kashaev. 3841-3871 [doi]
• Combinatorial Philosopher InequalitiesEnze Sun 0001, Zhihao Gavin Tang, Yifan Wang. 3872-3904 [doi]
• Hardness of Approximation for Shortest Path with Vector CostsCharlie Carlson, Yury Makarychev, Ron Mosenzon. 3905-3935 [doi]
• A Deterministic Polylogarithmic Competitive Algorithm for Matching with DelaysMarc Dufay, Roger Wattenhofer. 3936-3964 [doi]
• New Algorithms and Hardness Results for Robust Satisfiability of (Promise) CSPsJoshua Brakensiek, Lorenzo Ciardo, Venkatesan Guruswami, Aaron Potechin, Stanislav Zivný. 3965-3977 [doi]
• Burling Graphs in Graphs with Large Chromatic NumberTara Abrishami, Marcin Brianski, James Davies, Xiying Du, Jana Masaríková, Pawel Rzazewski, Bartosz Walczak. 3978-3998 [doi]
• History-Independent Maximal Matchings can be Surprisingly Efficient, and Lead to Better Worst-Case GuaranteesRathish Das, William Kuszmaul. 3999-4022 [doi]
• Faster algorithms for packing forests in graphs and related problemsPavel A. Arkhipov, Vladimir Kolmogorov. 4023-4042 [doi]
• Sensitivity Lower Bounds for Approximation AlgorithmsNoah Fleming, Yuichi Yoshida. 4043-4076 [doi]
• 7/4) Cut QueriesYotam Kenneth-Mordoch, Robert Krauthgamer. 4077-4095 [doi]
• On Independent Spanning Trees in Random GraphsNemanja Draganic, Keith Frankston, Michael Krivelevich, Alexey Pokrovskiy, Liana Yepremyan. 4096-4104 [doi]
• Optimal mass estimation in the conditional sampling modelTomer Adar, Eldar Fischer, Amit Levi. 4105-4174 [doi]
• Dichotomy for orderings?Gábor Kun, Jaroslav Nesetril. 4175-4187 [doi]
• Weighted k-Server Admits an Exponentially Competitive AlgorithmAdithya Bijoy, Ankit Mondal, Ashish Chiplunkar. 4188-4208 [doi]
• Balls and Bins and the Infinite Process with Random DeletionsPetra Berenbrink, Tom Friedetzky, Peter Kling, Lars Nagel 0001. 4209-4223 [doi]
• (Almost) Perfect Discrete Iterative Load BalancingPetra Berenbrink, Robert Elsässer, Tom Friedetzky, Hamed Hosseinpour, Dominik Kaaser, Peter Kling, Thomas Sauerwald. 4224-4237 [doi]
• Phase transition of the Sinkhorn-Knopp algorithmKun He 0011. 4238-4284 [doi]
• Near-Optimal Four-Cycle Counting in Graph StreamsSebastian Lüderssen, Stefan Neumann 0003, Pan Peng 0001. 4285-4326 [doi]
• Spectral Clustering with Side InformationHendrik Fichtenberger, Michael Kapralov, Ekaterina Kochetkova, Silvio Lattanzi, Davide Mazzali, Weronika Wrzos-Kaminska. 4327-4341 [doi]
• p Sampling in Distributed Data Streams with Applications to Adversarial RobustnessHonghao Lin, Zhao Song 0002, David P. Woodruff, Shenghao Xie 0001, Samson Zhou. 4342-4409 [doi]
• Distribution Testing in the Presence of Arbitrarily Dominant Noise with Verification QueriesHadley Black, Christopher Ye 0001. 4410-4480 [doi]
• Faster Distributed Δ-Coloring via a Reduction to MISYann Bourreau, Sebastian Brandt 0002, Alexandre Nolin. 4481-4500 [doi]
• Optimal Subspace Embeddings: Resolving Nelson-Nguyen Conjecture Up to Sub-Polylogarithmic FactorsShabarish Chenakkod, Michal Derezinski, Xiaoyu Dong. 4501-4559 [doi]
• A parameterized linear formulation of the integer hullFriedrich Eisenbrand, Thomas Rothvoss. 4560-4571 [doi]
• Planar Disjoint Shortest Paths is Fixed-Parameter TractableMichal Pilipczuk, Giannos Stamoulis, Michal Wlodarczyk 0001. 4572-4583 [doi]
• ℋ-Planarity and Parametric Extensions: when Modulators Act GloballyFedor V. Fomin, Petr A. Golovach, Laure Morelle, Dimitrios M. Thilikos. 4584-4601 [doi]
• A quasi-polynomial bound for the minimal excluded minors for a surfaceSarah Houdaigoui, Ken-ichi Kawarabayashi. 4602-4627 [doi]
• Tight Parameterized (In)tractability of Layered Crossing Minimization: Subexponential Algorithms and KernelizationFedor V. Fomin, Petr A. Golovach, Tanmay Inamdar 0002, Saket Saurabh 0001, Meirav Zehavi. 4628-4643 [doi]
• Catching Rats in H-minor-free GraphsMaximilian Gorsky, Giannos Stamoulis, Dimitrios M. Thilikos, Sebastian Wiederrecht. 4644-4659 [doi]
• Persuasive CalibrationYiding Feng 0001, Wei Tang. 4660-4691 [doi]
• Nearly Tight Sample Complexity for Matroid Online Contention ResolutionMoran Feldman, Ola Svensson, Rico Zenklusen. 4692-4711 [doi]
• Collaborative Prediction: Tractable Information Aggregation via AgreementNatalie Collina, Ira Globus-Harris, Surbhi Goel, Varun Gupta 0006, Aaron Roth 0001, Mirah Shi. 4712-4798 [doi]
• Networked Information Aggregation via Machine LearningMichael Kearns, Aaron Roth 0001, Emily Ryu. 4799-4845 [doi]
• Online Proportional ApportionmentJavier Cembrano, José Correa 0001, Svenja M. Griesbach, Victor Verdugo. 4846-4860 [doi]
• A Few Good ChoicesHaoyu Song, Thành Nguyen, Young-San Lin. 4861-4874 [doi]
• On Lines Crossing Pairwise Intersecting Convex Sets in Three DimensionsNatan Rubin. 4875-4893 [doi]
• Rapid Mixing of Glauber Dynamics for Monotone Systems via Entropic IndependenceWeiming Feng 0001, Minji Yang. 4894-4929 [doi]
• The Erdős-Pósa property for circle graphs as vertex-minorsRutger Campbell, Jochen Pascal Gollin, Meike Hatzel, O-joung Kwon, Rose McCarty, Sang-il Oum, Sebastian Wiederrecht. 4930-4952 [doi]
• Traversing regions of supersolvable hyperplane arrangements and their lattice quotientsSofia Brenner, Jean Cardinal, Thomas McConville, Arturo Merino, Torsten Mütze. 4953-4968 [doi]
• Nearly Optimal Bounds for Stochastic Online SortingYang Hu 0001. 4969-4995 [doi]
• Universal Connection Schedules for Reconfigurable NetworkingShaleen Baral, Robert Kleinberg, Sylvan Martin, Henry Rogers, Tegan Wilson, Ruogu Zhang. 4996-5026 [doi]
• Sublinear-Time Lower Bounds for Approximating Matching Size using Non-Adaptive QueriesVihan Shah. 5027-5065 [doi]
• On the Universality of Round Elimination Fixed PointsAlkida Balliu, Sebastian Brandt 0002, Ole Gabsdil, Dennis Olivetti, Jukka Suomela. 5066-5092 [doi]
• Better Bounds for Semi-Streaming Single-Source Shortest PathsSepehr Assadi, Gary Hoppenworth, Janani Sundaresan. 5093-5116 [doi]
• Downward self-reducibility in the total function polynomial hierarchyKarthik Gajulapalli, Surendra Ghentiyala, Zeyong Li, Sidhant Saraogi. 5117-5150 [doi]
• You (Almost) Can't Beat Brute Force for 3-Matroid IntersectionIlan Doron Arad, Ariel Kulik, Hadas Shachnai. 5151-5171 [doi]
• Plane vs. Plane Low Degree TestAmey Bhangale, Silas Richelson. 5172-5198 [doi]
• Entrywise Approximation for Matrix Inversion and Linear SystemsMehrdad Ghadiri, Hoai An Nguyen, Junzhao Yang. 5199-5210 [doi]
• Algebraic Closure of Matrix Sets Recognized by 1-VASSRida Ait El Manssour, Mahsa Naraghi, Mahsa Shirmohammadi, James Worrell 0001. 5211-5240 [doi]
• The Division Barrier: Optimal Bounds and Structural Limits in Toom-Cook InterpolationRoy Nissim, Oded Schwartz, Yuval Spiizer. 5241-5254 [doi]
• On the Complexity of the Skolem Problem at Low OrdersPiotr Bacik, Joël Ouaknine, James Worrell 0001. 5255-5269 [doi]
• Optimization Modulo Integer Linear-Exponential ProgramsS. Hitarth, Alessio Mansutti, Guruprerana Shabadi. 5270-5343 [doi]
• Spanning Tree Embeddings Are Not Much Harder than Hierarchical PartitionsWillem Fletcher, D. Ellis Hershkowitz. 5344-5373 [doi]
• Approximating Asymmetric A Priori TSP beyond the Adaptivity GapManuel Christalla, Luise Puhlmann, Vera Traub. 5374-5439 [doi]
• Additive Approximation Schemes for Low-Dimensional EmbeddingsPrashanti Anderson, Ainesh Bakshi, Samuel B. Hopkins 0001. 5440-5488 [doi]
• An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the k-Means ProblemVincent Cohen-Addad, Fabian Kuhn, Zahra Parsaeian. 5489-5533 [doi]
• MAX BISECTION might be harder to approximate than MAX CUTJoshua Brakensiek, Neng Huang 0001, Aaron Potechin, Uri Zwick. 5534-5557 [doi]
• Vizing's Theorem in Deterministic Almost-Linear TimeSepehr Assadi, Soheil Behnezhad, Sayan Bhattacharya, Martín Costa, Shay Solomon, Tianyi Zhang 0008. 5558-5585 [doi]
• Faster Algorithms for Global Minimum Vertex-Cut in Directed GraphsJulia Chuzhoy, Ron Mosenzon, Ohad Trabelsi. 5586-5623 [doi]
• Algorithms and Lower Bounds for the Maximum Overlap of Two Polygons Under TranslationMikkel Abrahamsen, Sujoy Bhore, Maike Buchin, Jacobus Conradi, Ce Jin 0001, André Nusser, Carolin Rehs. 5624-5640 [doi]
• Online Orthogonal Vectors RevisitedKarthik Gajulapalli, Alexander Golovnev, Samuel King, Sidhant Saraogi. 5641-5668 [doi]
• Separations between Oblivious and Adaptive Adversaries for Natural Dynamic Graph ProblemsAaron Bernstein, Sayan Bhattacharya, Nick Fischer, Peter Kiss, Thatchaphol Saranurak. 5669-5687 [doi]
• Differentially Private Algorithms for Graph Cuts: A Shifting Mechanism Approach and MoreRishi Chandra, Michael Dinitz, Chenglin Fan, Zongrui Zou. 5688-5728 [doi]
• Sample-efficient Replicable Median in Polynomial TimeKiarash Banihashem, MohammadHossein Bateni, Hossein Esfandiari, Samira Goudarzi, MohammadTaghi Hajiaghayi. 5729-5770 [doi]
• On the Structure of Replicable Hypothesis TestersAnders Aamand, Maryam Aliakbarpour, Justin Y. Chen, Shyam Narayanan, Sandeep Silwal. 5771-5823 [doi]
• Differentially Private Quasi-Concave Optimization: Bypassing the Lower Bound and Application to Geometric ProblemsKobbi Nissim, Eliad Tsfadia, Chao Yan. 5824-5842 [doi]
• Matroids are EquitableHannaneh Akrami, Roshan Raj, László A. Végh. 5843-5860 [doi]
• A Near-Complete Resolution of the Exponential-Time Complexity of k-opt for the Traveling Salesman ProblemSophia Heimann, Hung P. Hoang 0001, Stefan Hougardy. 5861-5885 [doi]
• Optimal Rounding for Two-Stage Bipartite MatchingTristan Pollner, Amin Saberi, Anders Wikum. 5886-5913 [doi]
• Approximate Counting of Permutation PatternsOmri Ben-Eliezer, Slobodan Mitrovic, Pranjal Srivastava. 5914-5940 [doi]
• Sublinear Metric Steiner Forest via Maximal Independent SetSepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski, Ali Vakilian. 5941-5959 [doi]
• Local Search for Clustering in Almost-linear TimeShaofeng H.-C. Jiang, Yaonan Jin, Jianing Lou, Pinyan Lu. 5960-5977 [doi]
• #CFG and #DNNF admit FPRASKuldeep S. Meel, Alexis de Colnet. 5978-6010 [doi]
• Strongly Polynomial Parallel Work-Depth Tradeoffs for Directed SSSPAdam Karczmarz, Wojciech Nadara, Marek Sokolowski 0001. 6011-6028 [doi]
• Sparsifying Cayley Graphs on Every GroupJun-Ting Hsieh, Daniel Z. Lee, Sidhanth Mohanty, Aaron Putterman, Rachel Yun Zhang. 6029-6041 [doi]
• Sparsifying Sums of Positive Semidefinite MatricesArpon Basu, Pravesh K. Kothari, Yang P. Liu, Raghu Meka. 6042-6064 [doi]
• Coloring Graphs with Few Colors in the Streaming ModelSepehr Assadi, Janani Sundaresan, Helia Yazdanyar. 6065-6132 [doi]
• Three-edge-coloring (Tait coloring) cubic graphs and nowhere-zero 4-flow for graphs on the torusYuta Inoue, Ken-ichi Kawarabayashi, Atsuyuki Miyashita, Bojan Mohar, Tomohiro Sonobe. 6133-6165 [doi]
• Recognizing Leaf Powers and Pairwise Compatibility Graphs is NP-CompleteMax Dupré la Tour, Manuel Lafond, Ndiamé Ndiaye. 6166-6183 [doi]
• Dynamic Connectivity with Expected Polylogarithmic Worst-Case Update TimeSimon Meierhans, Maximilian Probst Gutenberg. 6184-6198 [doi]
• Evasive sets, twisted varieties, and container-clique treesJeck Lim, Jiaxi Nie, Ji Zeng. 6199-6211 [doi]
• Listing faces of polytopesNastaran Behrooznia, Sofia Brenner, Arturo Merino, Torsten Mütze, Christian Rieck, Francesco Verciani. 6212-6222 [doi]
• Extended VC-dimension, and Radon and Tverberg type theorems for unions of convex setsNoga Alon, Shakhar Smorodinsky. 6223-6232 [doi]
• A near-optimal quadratic Goldreich-Levin algorithm (extended abstract)Jop Briët, Davi Castro-Silva. 6233-6239 [doi]
• Braiding VineyardsErin W. Chambers, Christopher Fillmore, Elizabeth Stephenson, Mathijs Wintraecken. 6240-6263 [doi]
• Rumour Spreading Depends on the Latent Geometry and Degree Distribution in Social Network ModelsMarc Kaufmann, Kostas Lakis, Johannes Lengler, Raghu Raman Ravi, Ulysse Schaller, Konstantin Sturm. 6264-6307 [doi]
• Problems from Optimization and Computational Algebra Equivalent to Hilbert's NullstellensatzMarkus Bläser, Sagnik Dutta, Gorav Jindal. 6308-6331 [doi]
• On the Usefulness of PromisesPer Austrin, Johan Håstad, Björn Martinsson. 6332-6378 [doi]
• On Deterministically Finding an Element of High Order Modulo a CompositeZiv Oznovich, Ben lee Volk. 6379-6391 [doi]
• Numerical Linear Algebra in Linear SpaceYiping Liu, Hoai An Nguyen, Junzhao Yang. 6392-6435 [doi]
• Lower Bounds for CSP Hierarchies Through Ideal ReductionJonas Conneryd, Yassine Ghannane, Shuo Pang 0002. 6436-6463 [doi]
• When Contracts Get Complex: Information-Theoretic BarriersPaul Dütting, Michal Feldman, Yoav Gal Tzur, Aviad Rubinstein. 6464-6493 [doi]
• Better Regret Rates in Bilateral Trade via Sublinear Budget ViolationAnna Lunghi, Matteo Castiglioni, Alberto Marchesi 0001. 6494-6536 [doi]
• Contract Design for Sequential ActionsTomer Ezra, Michal Feldman, Maya Schlesinger. 6537-6570 [doi]
• Robust Equilibria in Shared Resource Allocation via Strengthening Border's TheoremDavid X. Lin, Siddhartha Banerjee, Giannis Fikioris, Éva Tardos. 6571-6612 [doi]
• Fair Division Beyond Monotone Valuations with Applications to Equitable Graph PartitioningSiddharth Barman, Paritosh Verma. 6613-6641 [doi]
• Nearly Tight Bounds for the Online Sorting ProblemYossi Azar, Debmalya Panigrahi, Or Vardi. 6642-6658 [doi]
• Online 3-Taxi on General MetricsChristian Coester, Tze-Yang Poon. 6659-6673 [doi]
• Learning in an Echo Chamber: Online Learning with Replay AdversaryDaniil Dmitriev, Harald Eskelund Franck, Carolin Heinzler, Amartya Sanyal. 6674-6695 [doi]
• Online Conformal Prediction with Efficiency GuaranteesVaidehi Srinivas. 6696-6726 [doi]
• Online Resource Allocation with Concave, Diminishing-Returns ObjectivesKalen Patton. 6727-6741 [doi]
• Existence of Fair and Efficient Allocation of Indivisible ChoresRyoga Mahara. 6742-6766 [doi]
• Is nasty noise actually harder than malicious noise?Guy Blanc, Yizhi Huang, Tal Malkin, Rocco A. Servedio. 6767-6787 [doi]