Table of Contents

• Prior-Independent Auctions for Heterogeneous BiddersGuru Guruganesh, Aranyak Mehta, Di Wang 0005, Kangning Wang. 1-18 [doi]
• Impossibilities for Obviously Strategy-Proof MechanismsShiri Ron. 19-40 [doi]
• Revenue Maximization for Buyers with Costly ParticipationYannai A. Gonczarowski, Nicole Immorlica, Yingkai Li, Brendan Lucier. 41-73 [doi]
• Breaking the 3/4 Barrier for Approximate Maximin ShareHannaneh Akrami, Jugal Garg. 74-91 [doi]
• Combinatorial Contracts Beyond Gross SubstitutesPaul Dütting, Michal Feldman, Yoav Gal Tzur. 92-108 [doi]
• On Supermodular Contracts and Dense SubgraphsRamiro Deo-Campo Vuong, Shaddin Dughmi, Neel Patel, Aditya Prasad. 109-132 [doi]
• Sorting Pattern-Avoiding Permutations via 0-1 Matrices Forbidding Product PatternsParinya Chalermsook, Seth Pettie, Sorrachai Yingchareonthawornchai. 133-149 [doi]
• Vertical Decomposition in 3D and 4D with Applications to Line Nearest-Neighbor Searching in 3DPankaj K. Agarwal, Esther Ezra, Micha Sharir. 150-170 [doi]
• Dynamic Dictionary with Subconstant Wasted Bits per KeyTianxiao Li, Jingxun Liang, Huacheng Yu, Renfei Zhou. 171-207 [doi]
• Dynamic Dynamic Time WarpingKarl Bringmann, Nick Fischer, Ivor van der Hoog, Evangelos Kipouridis, Tomasz Kociumaka, Eva Rotenberg. 208-242 [doi]
• Dynamically Maintaining the Persistent Homology of Time SeriesSebastiano Cultrera di Montesano, Herbert Edelsbrunner, Monika Henzinger, Lara Ost. 243-295 [doi]
• Fully dynamic approximation schemes on planar and apex-minor-free graphsTuukka Korhonen, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski 0001. 296-313 [doi]
• Optimally Repurposing Existing Algorithms to Obtain Exponential-Time ApproximationsBaris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma. 314-345 [doi]
• Shortest Disjoint Paths on a GridMathieu Mari, Anish Mukherjee 0001, Piotr Sankowski. 346-365 [doi]
• Tree Containment Above Minimum Degree is FPTFedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov. 366-376 [doi]
• Determinantal SievingEduard Eiben, Tomohiro Koana, Magnus Wahlström. 377-423 [doi]
• Minimization is Harder in the Prophet WorldVasilis Livanos, Ruta Mehta. 424-461 [doi]
• Bandit Algorithms for Prophet Inequality and Pandora's BoxKhashayar Gatmiry, Thomas Kesselheim, Sahil Singla 0001, Yifan Wang. 462-500 [doi]
• Rationality-Robust Information Design: Bayesian Persuasion under Quantal ResponseYiding Feng, Chien-Ju Ho, Wei Tang. 501-546 [doi]
• Equilibrium Dynamics in Market Games with Exchangeable and Divisible ResourcesJosé Correa 0001, Tobias Harks, Anja Schedel, José Verschae. 547-568 [doi]
• Simple Delegated ChoiceAli Khodabakhsh 0002, Emmanouil Pountourakis, Samuel Taggart. 569-590 [doi]
• Fast Algorithms for Directed Graph Partitioning Using Flows and Reweighted EigenvaluesLap Chi Lau, Kam Chuen Tung, Robert Wang 0004. 591-624 [doi]
• ɛ-approximation algorithm for maximum independent set of connected subgraphs in a planar graphJana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki. 625-638 [doi]
• Single-Source Unsplittable Flows in Planar GraphsVera Traub, Laura Vargas Koch, Rico Zenklusen. 639-668 [doi]
• 2-Approximation for Prize-Collecting Steiner ForestAli Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Mohammad Mahdavi. 669-693 [doi]
• Ω~(√log|T|) Lower Bound for Steiner Point RemovalYu Chen 0039, Zihan Tan. 694-698 [doi]
• Euclidean Bottleneck Steiner Tree is Fixed-Parameter TractableSayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh 0001, Jie Xue 0003. 699-711 [doi]
• Meta-theorems for Parameterized Streaming Algorithms‡Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, M. S. Ramanujan 0001, Saket Saurabh 0001, Meirav Zehavi. 712-739 [doi]
• Parameterized algorithms for block-structured integer programs with large entriesJana Cslovjecsek, Martin Koutecký, Alexandra Lassota, Michal Pilipczuk, Adam Polak 0001. 740-751 [doi]
• Factoring Pattern-Free Permutations into Separable onesEdouard Bonnet, Romain Bourneuf, Colin Geniet, Stéphan Thomassé. 752-779 [doi]
• Representative set statements for delta-matroids and the Mader delta-matroidMagnus Wahlström. 780-810 [doi]
• On the Unreasonable Effectiveness of Single Vector Krylov Methods for Low-Rank ApproximationRaphael A. Meyer, Cameron Musco, Christopher Musco. 811-845 [doi]
• Detecting Hidden Communities by Power Iterations with Connections to Vanilla Spectral AlgorithmsChandra Sekhar Mukherjee, Jiapeng Zhang. 846-879 [doi]
• Matrix Perturbation: Davis-Kahan in the Infinity NormAbhinav Bhardwaj, Van Vu. 880-934 [doi]
• 0-Low Rank Approximation: Solving Dense CSPs over RealsVincent Cohen-Addad, Chenglin Fan, Suprovat Ghoshal, Euiwoong Lee, Arnaud de Mesmay, Alantha Newman, Tony Chang Wang. 935-961 [doi]
• Strongly Polynomial Frame Scaling to High PrecisionDaniel Dadush, Akshay Ramachandran. 962-981 [doi]
• Positivity Certificates for Linear RecurrencesAlaa Ibrahim, Bruno Salvy. 982-994 [doi]
• A Unifying Framework for Differentially Private Sums under Continual ObservationMonika Henzinger, Jalaj Upadhyay, Sarvagya Upadhyay. 995-1018 [doi]
• Optimal Bounds on Private Graph ApproximationJingcheng Liu 0005, Jalaj Upadhyay, Zongrui Zou. 1019-1049 [doi]
• Shannon meets Gray: Noise-robust, Low-sensitivity Codes with Applications in Differential PrivacyDavid Rasmussen Lolck, Rasmus Pagh. 1050-1066 [doi]
• Adjacency Sketches in Adversarial EnvironmentsMoni Naor, Eugene Pekel. 1067-1098 [doi]
• Sorting and Selection in Rounds with Adversarial ComparisonsChristopher Trevisan. 1099-1119 [doi]
• f) CommunicationFatima Elsheimy, Giorgos Tsimos, Charalampos Papamanthou. 1120-1146 [doi]
• Small But Unwieldy: A Lower Bound on Adjacency Labels for Small ClassesEdouard Bonnet, Julien Duron, John Sylvester 0001, Viktor Zamaraev, Maksim Zhukovskii. 1147-1165 [doi]
• On the Extremal Functions of Acyclic Forbidden 0-1 MatricesSeth Pettie, Gábor Tardos. 1166-1176 [doi]
• Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is LogarithmicJesse Campion Loth, Kevin Halasz, Tomás Masarík, Bojan Mohar, Robert Sámal. 1177-1193 [doi]
• n/7Aleksander B. G. Christiansen, Eva Rotenberg, Daniel Rutschmann. 1194-1240 [doi]
• The Grid-Minor Theorem RevisitedVida Dujmovic, Robert Hickingbotham, Jedrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek, Pat Morin, Clément Rambaud, David R. Wood. 1241-1245 [doi]
• Partial Coloring Complex, Vertex Decomposability and Tverberg's Theorem with ConstraintsSharareh Alipour, Amir Jafari, Mohammad Hassan Mazidi, Seyed Abolfazl Najafian. 1246-1259 [doi]
• Approximating Subset Sum Ratio faster than Subset SumKarl Bringmann. 1260-1277 [doi]
• A Parameterized Family of Meta-Submodular FunctionsMehrdad Ghadiri, Richard Santiago, F. Bruce Shepherd. 1278-1306 [doi]
• Approximation Algorithms for the Weighted Nash Social Welfare via Convex and Non-Convex ProgramsAdam Brown, Aditi Laddha, Madhusudhan Reddy Pittu, Mohit Singh. 1307-1327 [doi]
• Tight approximability of MAX 2-SAT and relatives, under UGCJoshua Brakensiek, Neng Huang, Uri Zwick. 1328-1344 [doi]
• Gap Amplification for Reconfiguration ProblemsNaoto Ohsaka. 1345-1366 [doi]
• AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabetsOmar Alrabiah, Venkatesan Guruswami, Ray Li. 1367-1378 [doi]
• Conflict Checkable and Decodable Codes and Their ApplicationsBenny Applebaum, Eliran Kachlon. 1379-1424 [doi]
• Optimal thresholds for Latin squares, Steiner Triple Systems, and edge coloringsVishesh Jain, Huy Tuan Pham. 1425-1436 [doi]
• Cliquewidth and DimensionGwenaël Joret, Piotr Micek, Michal Pilipczuk, Bartosz Walczak. 1437-1446 [doi]
• The Hierarchy of Hereditary Sorting OperatorsVít Jelínek, Michal Opler, Jakub Pekárek. 1447-1464 [doi]
• Cactus Representations in Polylogarithmic Max-flow via Maximal Isolating MincutsZhongtian He, Shang-En Huang, Thatchaphol Saranurak. 1465-1502 [doi]
• Cactus Representation of Minimum Cuts: Derandomize and Speed upZhongtian He, Shang-En Huang, Thatchaphol Saranurak. 1503-1541 [doi]
• Beyond the Quadratic Time Barrier for Network UnreliabilityRuoxu Cen, William He, Jason Li 0006, Debmalya Panigrahi. 1542-1567 [doi]
• On (1 + ɛ)-Approximate Flow SparsifiersYu Chen 0039, Zihan Tan. 1568-1605 [doi]
• t-Flow Oracles and Negative Cycle Detection in Planar DigraphsAdam Karczmarz. 1606-1620 [doi]
• Breaking the Metric Voting Distortion BarrierMoses Charikar, Kangning Wang, Prasanna Ramakrishnan, Hongxun Wu. 1621-1640 [doi]
• Composition of nested embeddings with an application to outlier removalShuchi Chawla 0003, Kristin Sheridan. 1641-1668 [doi]
• p-metricsHenry L. Fleischmann, Surya Teja Gavva, Karthik C. S.. 1669-1703 [doi]
• Improved Approximations for Ultrametric Violation DistanceMoses Charikar, Ruiquan Gao. 1704-1737 [doi]
• A (3 + ɛ)-approximation algorithm for the minimum sum of radii problem with outliers and extensions for generalized lower boundsMoritz Buchem, Katja Ettmayr, Hugo K. K. Rosado, Andreas Wiese. 1738-1765 [doi]
• On Deterministically Approximating Total Variation DistanceWeiming Feng 0001, Liqiang Liu, Tianren Liu. 1766-1791 [doi]
• The Sharp Power Law of Local Search on ExpandersSimina Brânzei, Davin Choo, Nicholas J. Recker. 1792-1809 [doi]
• Randomized Communication and Implicit Representations for Matrices and Graphs of Small Sign-RankNathaniel Harms, Viktor Zamaraev. 1810-1833 [doi]
• Computations with polynomial evaluation oracle: ruling out superlinear SETH-based lower boundsTatiana Belova, Alexander S. Kulikov, Ivan Mihajlin, Olga Ratseeva, Grigory Reznikov, Denil Sharipov. 1834-1853 [doi]
• Count on CFI graphs for #P-hardnessRadu Curticapean. 1854-1871 [doi]
• On the Hardness of PosSLPPeter Bürgisser, Gorav Jindal. 1872-1886 [doi]
• Computing the 5-Edge-Connected Components in Linear TimeEvangelos Kosinas. 1887-2119 [doi]
• Edge-Coloring Algorithms for Bounded Degree MultigraphsAbhishek Dhawan. 2120-2157 [doi]
• Exact Community Recovery in the Geometric SBMJulia Gaudio, Xiaochun Niu, Ermin Wei. 2158-2184 [doi]
• A Faster Combinatorial Algorithm for Maximum Bipartite MatchingJulia Chuzhoy, Sanjeev Khanna. 2185-2235 [doi]
• Higher-Order Cheeger Inequality for Partitioning with BuffersKonstantin Makarychev, Yury Makarychev, Liren Shan, Aravindan Vijayaraghavan. 2236-2274 [doi]
• Dependent rounding with strong negative-correlation, and scheduling on unrelated machines to minimize completion timeDavid G. Harris. 2275-2304 [doi]
• Faster exact and approximation algorithms for packing and covering matroids via push-relabelKent Quanrud. 2305-2336 [doi]
• New SDP Roundings and Certifiable Approximation for Cubic OptimizationJun-Ting Hsieh, Pravesh K. Kothari, Lucas Pesenti, Luca Trevisan. 2337-2362 [doi]
• New Approximation Bounds for Small-Set Vertex ExpansionSuprovat Ghoshal, Anand Louis. 2363-2375 [doi]
• On the hardness of finding balanced independent sets in random bipartite graphsWill Perkins 0001, Yuzhou Wang. 2376-2397 [doi]
• An Improved Classical Singular Value Transformation for Quantum Machine LearningAinesh Bakshi, Ewin Tang. 2398-2453 [doi]
• Recovering the original simplicity: succinct and deterministic quantum algorithm for the welded tree problemGuanzhong Li, Lvzhou Li, Jingquan Luo. 2454-2480 [doi]
• Viderman's algorithm for quantum LDPC codesAnirudh Krishna, Inbal Livni Navon, Mary Wootters. 2481-2507 [doi]
• Efficient Quantum State Synthesis with One QueryGregory Rosenthal. 2508-2534 [doi]
• Quantum Worst-Case to Average-Case Reductions for All Linear ProblemsVahid R. Asadi, Alexander Golovnev, Tom Gur, Igor Shinkar, Sathyawageeswar Subramanian. 2535-2567 [doi]
• Nearly Optimal Approximate Dual-Failure Replacement PathsShiri Chechik, Tianyi Zhang 0008. 2568-2596 [doi]
• Exact Shortest Paths with Rational Weights on the Word RAMAdam Karczmarz, Wojciech Nadara, Marek Sokolowski 0001. 2597-2608 [doi]
• Fault-Tolerant Spanners against Bounded-Degree Edge Failures: Linearly More Faults, Almost For FreeGreg Bodwin, Bernhard Haeupler, Merav Parter. 2609-2642 [doi]
• Simpler and Higher Lower Bounds for Shortcut SetsVirginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu. 2643-2656 [doi]
• Distances and shortest paths on graphs of bounded highway dimension: simple, fast, dynamicSébastien Collette, John Iacono. 2657-2678 [doi]
• Fair Price DiscriminationSiddhartha Banerjee, Kamesh Munagala, Yiheng Shen, Kangning Wang. 2679-2703 [doi]
• School Redistricting: Wiping Unfairness Off the MapAriel D. Procaccia, Isaac Robinson, Jamie Tucker-Foltz. 2704-2724 [doi]
• Oracle Efficient Online Multicalibration and OmnipredictionSumegha Garg, Christopher Jung 0001, Omer Reingold, Aaron Roth 0001. 2725-2792 [doi]
• Improved Approximation Algorithms for the Joint Replenishment Problem with Outliers, and with Fairness ConstraintsVarun Suriyanarayana, Varun Sivashankar, Siddharth Gollapudi, David B. Shmoys. 2793-2828 [doi]
• Santa Claus meets Makespan and Matroids: Algorithms and ReductionsÉtienne Bamas, Alexander Lindermayr, Nicole Megow, Lars Rohwedder, Jens Schlöter. 2829-2860 [doi]
• A (3 + ɛ)-Approximate Correlation Clustering Algorithm in Dynamic StreamsMélanie Cambus, Fabian Kuhn, Etna Lindy, Shreyas Pai, Jara Uitto. 2861-2880 [doi]
• An Unconditional Lower Bound for Two-Pass Streaming Algorithms for Maximum Matching ApproximationChristian Konrad 0001, Kheeran K. Naidu. 2881-2899 [doi]
• Time-Space Lower Bounds for Bounded-Error Computation in the Random-Query ModelItai Dinur. 2900-2915 [doi]
• Robust Sparsification for Matroid Intersection with ApplicationsChien-Chung Huang, François Sellier. 2916-2940 [doi]
• Robust 1-bit Compressed Sensing with Iterative Hard ThresholdingNamiko Matsumoto, Arya Mazumdar. 2941-2979 [doi]
• Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update TimeJan van den Brand, Li Chen 0028, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford. 2980-2998 [doi]
• Fully Dynamic Min-Cut of Superconstant Size in Subpolynomial TimeWenyu Jin 0001, Xiaorui Sun, Mikkel Thorup. 2999-3026 [doi]
• Fully Dynamic Shortest Path Reporting Against an Adaptive AdversaryAnastasiia Alokhina, Jan van den Brand. 3027-3039 [doi]
• Fully Dynamic Matching: -Approximation in Polylog Update TimeAmir Azarmehr, Soheil Behnezhad, Mohammad Roghani. 3040-3061 [doi]
• Adaptive Out-Orientations with ApplicationsChandra Chekuri, Aleksander Bjørn Grodt Christiansen, Jacob Holm, Ivor van der Hoog, Kent Quanrud, Eva Rotenberg, Chris Schwiegelshohn. 3062-3088 [doi]
• Deterministic Near-Linear Time Minimum Cut in Weighted GraphsMonika Henzinger, Jason Li 0006, Satish Rao, Di Wang 0005. 3089-3139 [doi]
• The Cost of Parallelizing BoostingXin Lyu 0002, Hongxun Wu, Junzhao Yang. 3140-3155 [doi]
• How Many Neurons Does it Take to Approximate the Maximum?Itay Safran, Daniel Reichman 0001, Paul Valiant. 3156-3183 [doi]
• Learning Hard-Constrained Models with One SampleAndreas Galanis, Alkis Kalavasis, Anthimos Vardis Kandiros. 3184-3196 [doi]
• Online Robust Mean EstimationDaniel M. Kane, Ilias Diakonikolas, Hanshen Xiao, Sihan Liu. 3197-3235 [doi]
• Optimal rates for ranking a permuted isotonic matrix in polynomial timeEmmanuel Pilliat, Alexandra Carpentier, Nicolas Verzelen. 3236-3273 [doi]
• Faster Sublinear-Time Edit DistanceKarl Bringmann, Alejandro Cassis, Nick Fischer, Tomasz Kociumaka. 3274-3301 [doi]
• Near-Optimal Quantum Algorithms for Bounded Edit Distance and Lempel-Ziv FactorizationDaniel Gibney, Ce Jin 0001, Tomasz Kociumaka, Sharma V. Thankachan. 3302-3332 [doi]
• Deterministic Sparse Pattern Matching via the Baur-Strassen TheoremNick Fischer. 3333-3353 [doi]
• Sparse Regular Expression MatchingPhilip Bille, Inge Li Gørtz. 3354-3375 [doi]
• Grammar Boosting: A New Technique for Proving Lower Bounds for Computation over Compressed DataRajat De, Dominik Kempa. 3376-3392 [doi]
• Nibbling at Long Cycles: Dynamic (and Static) Edge Coloring in Optimal TimeSayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon. 3393-3440 [doi]
• k-center on graphsEmilio Cruciani, Sebastian Forster, Gramoz Goranci, Yasamin Nazari, Antonis Skarlatos. 3441-3462 [doi]
• k-Center ClusteringJakub Lacki, Bernhard Haeupler, Christoph Grunau, Rajesh Jayaram, Václav Rozhon. 3463-3484 [doi]
• Dynamic Algorithms for Matroid Submodular MaximizationKiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh. 3485-3533 [doi]
• On Dynamic Graph Algorithms with PredictionsJan van den Brand, Sebastian Forster, Yasamin Nazari, Adam Polak 0001. 3534-3557 [doi]
• Fast Algorithms for Separable Linear ProgramsSally Dong, Gramoz Goranci, Lawrence Li, Sushant Sachdeva, Guanghao Ye. 3558-3604 [doi]
• Integer Programming with GCD ConstraintsRémy Défossez, Christoph Haase, Alessio Mansutti, Guillermo A. Pérez 0001. 3605-3658 [doi]
• 4) TimeHaotian Jiang, Yin Tat Lee, Zhao Song 0002, Lichen Zhang 0003. 3659-3684 [doi]
• A Whole New Ball Game: A Primal Accelerated Method for Matrix Games and Minimizing the Maximum of Smooth FunctionsYair Carmon, Arun Jambulapati, Yujia Jin, Aaron Sidford. 3685-3723 [doi]
• Arborescences, Colorful Forests, and PopularityTelikepalli Kavitha, Kazuhisa Makino, Ildikó Schlotter, Yu Yokoi. 3724-3746 [doi]
• Sub-Exponential Lower Bounds for Branch-and-Bound with General Disjunctions via InterpolationMax Gläser, Marc E. Pfetsch. 3747-3764 [doi]
• Faster Rectangular Matrix Multiplication by Combination Loss AnalysisFrançois Le Gall. 3765-3791 [doi]
• New Bounds for Matrix Multiplication: from Alpha to OmegaVirginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu, Renfei Zhou. 3792-3835 [doi]
• Fast Fourier transform via automorphism groups of rational function fieldsSongsong Li, Chaoping Xing. 3836-3859 [doi]
• Nearly Optimal Black Box Polynomial Root-findersVictor Y. Pan. 3860-3900 [doi]
• Deterministic Algorithms for Low Degree Factors of Constant Depth CircuitsMrinal Kumar 0001, Varun Ramanathan 0002, Ramprasad Saptharishi. 3901-3918 [doi]
• The Identity Problem in nilpotent groups of bounded classRuiwen Dong 0001. 3919-3959 [doi]
• Massively Parallel Algorithms for High-Dimensional Euclidean Minimum Spanning TreeRajesh Jayaram, Vahab Mirrokni, Shyam Narayanan, Peilin Zhong. 3960-3996 [doi]
• Parallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic DepthArpit Agarwal, Sanjeev Khanna, Huan Li 0002, Prathamesh Patil, Chen Wang, Nathan White, Peilin Zhong. 3997-4061 [doi]
• A Nearly Linear-Time Distributed Algorithm for Exact Maximum MatchingTaisuke Izumi, Naoki Kitamura, Yutaro Yamaguchi 0001. 4062-4082 [doi]
• A Distributed Palette Sparsification TheoremMaxime Flin, Mohsen Ghaffari 0001, Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin. 4083-4123 [doi]
• Breaking 3-Factor Approximation for Correlation Clustering in Polylogarithmic RoundsNairen Cao, Shang-En Huang, Hsin-Hao Su. 4124-4154 [doi]
• The Minority Dynamics and the Power of SynchronicityLuca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan, Robin Vacus, Isabella Ziccardi. 4155-4176 [doi]
• Bin Packing under Random-Order: Breaking the Barrier of 3/2Anish Hebbar, Arindam Khan 0001, K. V. N. Sreenivas. 4177-4219 [doi]
• k-Taxi ProblemAnupam Gupta 0001, Amit Kumar 0001, Debmalya Panigrahi. 4220-4246 [doi]
• Controlling Tail Risk in Online Ski-RentalMichael Dinitz, Sungjin Im, Thomas Lavastida, Benjamin Moseley, Sergei Vassilvitskii. 4247-4263 [doi]
• k Barrier in Collective Tree Exploration via Tree-MiningRomain Cosson. 4264-4282 [doi]
• Maintaining Matroid Intersections OnlineNiv Buchbinder, Anupam Gupta 0001, Daniel Hathcock, Anna R. Karlin, Sherry Sarkar. 4283-4304 [doi]
• A Tight Bound for Testing Partition PropertiesAsaf Shapira, Henrique Stagni. 4305-4320 [doi]
• Mildly Exponential Lower Bounds on Tolerant Testers for Monotonicity, Unateness, and JuntasXi Chen 0001, Anindya De, Yuhao Li 0002, Shivam Nadimpalli, Rocco A. Servedio. 4321-4337 [doi]
• Uniformity Testing over Hypergrids with Subcube ConditioningXi Chen 0001, Cassandra Marcussen. 4338-4370 [doi]
• Tight Lower Bound on Equivalence Testing in Conditional Sampling ModelDiptarka Chakraborty, Sourav Chakraborty 0001, Gunjan Kumar. 4371-4394 [doi]
• Adversarial Low Degree TestingDor Minzer, Kai Zhe Zheng. 4395-4409 [doi]
• Fully Scalable Massively Parallel Algorithms for Embedded Planar GraphsYi-Jun Chang, Da-Wei Zheng. 4410-4450 [doi]
• An Optimal Algorithm for Higher-Order Voronoi Diagrams in the Plane: The Usefulness of NondeterminismTimothy M. Chan, Pingan Cheng, Da-Wei Zheng. 4451-4463 [doi]
• Improved Bounds for Point Selections and Halving Hyperplanes in Higher DimensionsNatan Rubin. 4464-4501 [doi]
• Solving Fréchet Distance Problems by Algebraic Geometric MethodsSiu-Wing Cheng, Haoqiang Huang. 4502-4513 [doi]
• Fast and Accurate Approximations of the Optimal Transport in Semi-Discrete and Discrete SettingsPankaj K. Agarwal, Sharath Raghvendra, Pouyan Shirzadian, Keegan Yao. 4514-4529 [doi]
• Set Covering with Our Eyes Wide ShutAnupam Gupta 0001, Gregory Kehne, Roie Levin. 4530-4553 [doi]
• Edge-disjoint paths in expanders: online with removalsNemanja Draganic, Rajko Nenadov. 4554-4563 [doi]
• Online Duet between Metric Embeddings and Minimum-Weight Perfect MatchingsSujoy Bhore, Arnold Filtser, Csaba D. Tóth. 4564-4579 [doi]
• Power of Posted-price Mechanisms for Prophet InequalitiesKiarash Banihashem, MohammadTaghi Hajiaghayi, Dariusz R. Kowalski, Piotr Krysta, Jan Olkowski. 4580-4604 [doi]
• Combinatorial Stationary Prophet InequalitiesNeel Patel, David Wajc. 4605-4630 [doi]
• Edge-weighted Online Stochastic Matching: BeatingShuyi Yan. 4631-4640 [doi]
• Improved Roundtrip Spanners, Emulators, and Directed Girth ApproximationAlina Harbuzova, Ce Jin 0001, Virginia Vassilevska Williams, Zixuan Xu. 4641-4669 [doi]
• The Time Complexity of Fully Sparse Matrix MultiplicationAmir Abboud, Karl Bringmann, Nick Fischer, Marvin Künnemann. 4670-4703 [doi]
• k-Dominating Set and Related First-Order Graph PropertiesNick Fischer, Marvin Künnemann, Mirza Redzic. 4704-4727 [doi]
• Fast 2-Approximate All-Pairs Shortest PathsMichal Dory, Sebastian Forster, Yael Kirkpatrick, Yasamin Nazari, Virginia Vassilevska Williams, Tijn de Vos. 4728-4757 [doi]
• Faster Approximate All Pairs Shortest PathsBarna Saha, Christopher Ye. 4758-4827 [doi]
• Faster Algorithms for Bounded Knapsack and Bounded Subset Sum Via Fine-Grained Proximity ResultsLin Chen 0009, Jiayi Lian, Yuchen Mao, Guochuan Zhang. 4828-4848 [doi]
• Flip Graph Connectivity for Arrangements of Pseudolines and PseudocirclesYan Alves Radtke, Stefan Felsner, Johannes Obenaus, Sandro Roch, Manfred Scheucher, Birgit Vogtenhuber. 4849-4871 [doi]
• Delaunay Bifiltrations of Functions on Point CloudsÁngel Javier Alonso, Michael Kerber, Tung Lam, Michael Lesnick. 4872-4891 [doi]
• Fast Approximation Algorithms for Piercing Boxes by PointsPankaj K. Agarwal, Sariel Har-Peled, Rahul Raychaudhury, Stavros Sintos. 4892-4908 [doi]
• Untangling Graphs on SurfacesÉric Colin de Verdière, Vincent Despré, Loïc Dubois. 4909-4941 [doi]
• Near-Optimal Min-Sum Motion Planning for Two Square Robots in a Polygonal EnvironmentPankaj K. Agarwal, Dan Halperin, Micha Sharir, Alex Steiger. 4942-4962 [doi]
• New Explicit Constant-Degree Lossless ExpandersLouis Golowich. 4963-4971 [doi]
• b-Edge CoversZongchen Chen, Yuzhou Gu. 4972-4987 [doi]
• Combinatorial Approach for Factorization of Variance and Entropy in Spin SystemsZongchen Chen. 4988-5012 [doi]
• Optimality of Glauber dynamics for general-purpose Ising model sampling and free energy approximationDmitriy Kunisky. 5013-5028 [doi]
• Universality of Spectral Independence with Applications to Fast Mixing in Spin GlassesNima Anari, Vishesh Jain, Frederic Koehler, Huy Tuan Pham, Thuy Duong Vuong. 5029-5056 [doi]
• Smoothed Complexity of SWAP in Local Graph PartitioningXi Chen 0001, Chenghao Guo, Emmanouil V. Vlatakis-Gkaragkounis, Mihalis Yannakakis. 5057-5083 [doi]
• Sublinear Time Low-Rank Approximation of Toeplitz MatricesCameron Musco, Kshiteej Sheth. 5084-5117 [doi]
• A Quasi-Monte Carlo Data Structure for Smooth Kernel EvaluationsMoses Charikar, Michael Kapralov, Erik Waingarten. 5118-5144 [doi]
• Code Sparsification and its ApplicationsSanjeev Khanna, Aaron (Louie) Putterman, Madhu Sudan 0001. 5145-5168 [doi]
• Linear-Sized Sparsifiers via Near-Linear Time Discrepancy TheoryArun Jambulapati, Victor Reis, Kevin Tian. 5169-5208 [doi]
• Quotient sparsification for submodular functionsKent Quanrud. 5209-5248 [doi]
• Induced-Minor-Free Graphs: Separator Theorem, Subexponential Algorithms, and Improved Hardness of RecognitionTuukka Korhonen, Daniel Lokshtanov. 5249-5275 [doi]
• 5-free Graphs in Quasi-polynomial TimeAkanksha Agrawal 0001, Paloma T. Lima, Daniel Lokshtanov, Saket Saurabh 0001, Roohani Sharma. 5276-5290 [doi]
• 6-free graphsMaria Chudnovsky, Rose McCarty, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski. 5291-5299 [doi]
• Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and MoreHsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than. 5300-5331 [doi]
• VC Set Systems in Minor-free (Di)Graphs and ApplicationsHung Le, Christian Wulff-Nilsen. 5332-5360 [doi]