Abstract is missing.
- Efficient Linear and Affine Codes for Correcting Insertions/DeletionsKuan Cheng, Venkatesan Guruswami, Bernhard Haeupler, Xin Li. 1-20 [doi]
- Online Nash Social Welfare Maximization with PredictionsSiddhartha Banerjee, Vasilis Gkatzelis, Artur Gorokh, Billy Jin. 1-19 [doi]
- Front Matter1-22 [doi]
- Robust Load Balancing with Machine Learned AdviceSara Ahmadian, Hossein Esfandiari, Vahab S. Mirrokni, Binghui Peng. 20-34 [doi]
- Explicit two-deletion codes with redundancy matching the existential boundVenkatesan Guruswami, Johan Håstad. 21-32 [doi]
- Beating the probabilistic lower bound on perfect hashingChaoping Xing, Chen Yuan 0003. 33-41 [doi]
- Online Graph Algorithms with PredictionsYossi Azar, Debmalya Panigrahi, Noam Touitou. 35-66 [doi]
- The Impact of Heterogeneity and Geometry on the Proof Complexity of Random SatisfiabilityThomas Bläsius, Tobias Friedrich 0001, Andreas Göbel 0001, Jordi Levy, Ralf Rothenberger. 42-53 [doi]
- Polynomial-time trace reconstruction in the smoothed complexity modelXi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha. 54-73 [doi]
- Learning-Augmented Weighted PagingNikhil Bansal 0001, Christian Coester, Ravi Kumar 0001, Manish Purohit, Erik Vee. 67-89 [doi]
- Non-linear Hamilton cycles in linear quasi-random hypergraphsJie Han, Xichao Shu, Guanghui Wang. 74-88 [doi]
- The Connectivity Threshold for Dense GraphsAnupam Gupta 0001, Euiwoong Lee, Jason Li 0006. 89-105 [doi]
- A Faster Algorithm for Quickest Transshipments via an Extended Discrete Newton MethodMiriam Schlöter, Martin Skutella, Khai Van Tran. 90-102 [doi]
- The popular assignment problem: when cardinality is more important than popularityTelikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin. 103-123 [doi]
- How Many Vertices Does a Random Walk Miss in a Network with Moderately Increasing the Number of Vertices?Shuji Kijima, Nobutaka Shimizu, Takeharu Shiraga. 106-122 [doi]
- Rolling backwards can move you forward: on embedding problems in sparse expandersNemanja Draganic, Michael Krivelevich, Rajko Nenadov. 123-134 [doi]
- Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear TimeSally Dong, Yu Gao, Gramoz Goranci, Yin Tat Lee, Richard Peng, Sushant Sachdeva, Guanghao Ye. 124-153 [doi]
- An improved procedure for colouring graphs of bounded local densityEoin Hurley, Rémi de Joannis de Verclos, Ross J. Kang. 135-148 [doi]
- Solving hard cut problems via flow-augmentationEun Jung Kim 0002, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström. 149-168 [doi]
- Improved Strongly Polynomial Algorithms for Deterministic MDPs, 2VPI Feasibility, and Discounted All-Pairs Shortest PathsAdam Karczmarz. 154-172 [doi]
- k-Disjoint Shortest Paths ProblemWilliam Lochet. 169-178 [doi]
- Efficient Computation of Representative Weight Functions with Applications to Parameterized Counting (Extended Version)Daniel Lokshtanov, Saket Saurabh 0001, Meirav Zehavi. 179-198 [doi]
- Hopcroft's Problem, Log-Star Shaving, 2D Fractional Cascading, and Decision TreesTimothy M. Chan, Da-Wei Zheng. 190-210 [doi]
- FPT-approximation for FPT ProblemsDaniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan 0001, Saket Saurabh 0001, Meirav Zehavi. 199-218 [doi]
- Untangling Planar Graphs and Curves by Staying PositiveSantiago Aranguri, Hsien-Chih Chang, Dylan Fridman. 211-225 [doi]
- Strong Connectivity Augmentation is FPTKristine Vitting Klinkby, Pranabendu Misra, Saket Saurabh 0001. 219-234 [doi]
- Computational Topology in a Collapsing Universe: Laplacians, Homology, CohomologyMitchell Black, William Maxwell, Amir Nayyeri, Eli Winkelman. 226-251 [doi]
- Directed Shortest Paths via Approximate Cost BalancingJames B. Orlin, László A. Végh. 235-254 [doi]
- Distortion-Oblivious Algorithms for Minimizing Flow TimeYossi Azar, Stefano Leonardi, Noam Touitou. 252-274 [doi]
- A Deterministic Parallel APSP Algorithm and its ApplicationsAdam Karczmarz, Piotr Sankowski. 255-272 [doi]
- 2.5) barrierFabrizio Grandoni 0001, Giuseppe F. Italiano, Aleksander Lukasiewicz, Nikos Parotsidis, Przemyslaw Uznanski. 273-289 [doi]
- q</italic>-norm load balancing: beyond exponential dependencies on 1/<italic>∊</italic>Lin Chen, Liangde Tao, José Verschae. 275-315 [doi]
- Optimal Girth Approximation for Dense Directed GraphsShiri Chechik, Gur Lifshitz. 290-300 [doi]
- The Min-Cost Matching with Concave Delays ProblemYossi Azar, Runtian Ren, Danny Vainstein. 301-320 [doi]
- On the Hardness of Scheduling With Non-Uniform Communication DelaysSami Davies, Janardhan Kulkarni, Thomas Rothvoss, Sai Sandeep, Jakub Tarnawski, Yihao Zhang. 316-328 [doi]
- Random Restrictions of High Dimensional Distributions and Uniformity Testing with Subcube ConditioningClément L. Canonne, Xi Chen, Gautam Kamath 0001, Amit Levi, Erik Waingarten. 321-336 [doi]
- Competitive Strategies for Symmetric Rendezvous on the LineMax Klimm, Guillaume Sagnol, Martin Skutella, Khai Van Tran. 329-347 [doi]
- Optimal Distribution-Free Sample-Based Testing of Subsequence-FreenessDana Ron, Asaf Rosin. 337-256 [doi]
- Collapsing the Tower - On the Complexity of Multistage Stochastic IPsKim-Manuel Klein, Janina Reuter. 348-358 [doi]
- On Tolerant Distribution Testing in the Conditional Sampling ModelShyam Narayanan. 357-373 [doi]
- Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear TimeManuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu. 359-376 [doi]
- SoS Degree Reduction with Applications to Clustering and Robust Moment EstimationDavid Steurer, Stefan Tiegel. 374-393 [doi]
- Directed Tangle Tree-Decompositions and ApplicationsArchontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon. 377-405 [doi]
- Algorithmic Extensions of Dirac's TheoremFedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov. 406-416 [doi]
- Approximation Algorithms and Hardness for Strong Unique GamesSuprovat Ghoshal, Anand Louis. 414-433 [doi]
- Uncertainty about Uncertainty: Optimal Adaptive Algorithms for Estimating Mixtures of Unknown CoinsJasper C. H. Lee, Paul Valiant. 414-433 [doi]
- Counting Homomorphic Cycles in Degenerate GraphsLior Gishboliner, Yevgeny Levanzov, Asaf Shapira, Raphael Yuster. 417-430 [doi]
- Counting list homomorphisms from graphs of bounded treewidth: tight complexity boundsJacob Focke, Dániel Marx, Pawel Rzazewski. 431-458 [doi]
- Optimal Inapproximability with Universal Factor GraphsPer Austrin, Jonah Brown-Cohen, Johan Håstad. 434-453 [doi]
- Strongly refuting all semi-random Boolean CSPsJackson Abascal, Venkatesan Guruswami, Pravesh K. Kothari. 454-472 [doi]
- The Complexity of Average-Case Dynamic Subgraph CountingMonika Henzinger, Andrea Lincoln, Barna Saha. 459-498 [doi]
- Treewidth-Pliability and PTAS for Max-CSPsMiguel Romero 0001, Marcin Wrochna, Stanislav Zivný. 473-483 [doi]
- On the Mysteries of MAX NAE-SATJoshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick. 484-503 [doi]
- Approximately counting independent sets in bipartite graphs via graph containersMatthew Jenssen, Aditya Potukuchi, Will Perkins. 499-516 [doi]
- Solving Sparse Linear Systems Faster than Matrix MultiplicationRichard Peng, Santosh S. Vempala. 504-521 [doi]
- Tight Bounds for Approximate Near Neighbor Searching for Time Series under the Fréchet DistanceKarl Bringmann, Anne Driemel, André Nusser, Ioannis Psarros. 517-550 [doi]
- A Refined Laser Method and Faster Matrix MultiplicationJosh Alman, Virginia Vassilevska Williams. 522-539 [doi]
- Ultrasparse Ultrasparsifiers and Faster Laplacian System SolversArun Jambulapati, Aaron Sidford. 540-559 [doi]
- 1 Column Subset Selection and a Fast PTAS for Low Rank ApproximationArvind V. Mahankali, David P. Woodruff. 560-578 [doi]
- Branch-and-Bound Solves Random Binary IPs in PolytimeSantanu S. Dey, Yatharth Dubey, Marco Molinaro 0001. 579-591 [doi]
- Sensitivity Oracles for All-Pairs MincutsSurender Baswana, Abhyuday Pandey. 581-609 [doi]
- The Demand Query Model for Bipartite MatchingNoam Nisan. 592-599 [doi]
- Polyhedral Value Iteration for Discounted Games and Energy GamesAlexander Kozachinskiy. 600-616 [doi]
- A Tail Estimate with Exponential Decay for the Randomized Incremental Construction of Search StructuresJoachim Gudmundsson, Martin P. Seybold. 610-626 [doi]
- Infinite-Duration All-Pay Bidding GamesGuy Avni, Ismaël Jecker, Dorde Zikelic. 617-636 [doi]
- Semi-Streaming Bipartite Matching in Fewer Passes and Optimal SpaceSepehr Assadi, Arun Jambulapati, Yujia Jin, Aaron Sidford, Kevin Tian. 627-669 [doi]
- Algorithms for Persuasion with Limited CommunicationRonen Gradwohl, Niklas Hahn, Martin Hoefer 0001, Rann Smorodinsky. 637-652 [doi]
- Improved Truthful Mechanisms for Subadditive Combinatorial Auctions: Breaking the Logarithmic BarrierSepehr Assadi, Thomas Kesselheim, Sahil Singla 0001. 653-661 [doi]
- Algorithms for weighted independent transversals and strong colouringAlessandra Graf, David G. Harris 0001, Penny Haxell. 662-674 [doi]
- Streaming Regular Expression Membership and Pattern MatchingBartlomiej Dudek 0001, Pawel Gawrychowski, Garance Gourdel, Tatiana Starikovskaya. 670-694 [doi]
- Improving the dilation of a metric graph by adding edgesJoachim Gudmundsson, Sampson Wong. 675-683 [doi]
- Average Sensitivity of Graph AlgorithmsNithin Varma, Yuichi Yoshida. 684-703 [doi]
- Frequency Estimation with One-Sided ErrorPiotr Indyk, Shyam Narayanan, David P. Woodruff. 695-707 [doi]
- Deterministic Replacement Path CoveringKarthik C. S., Merav Parter. 704-723 [doi]
- A Two-Pass (Conditional) Lower Bound for Semi-Streaming Maximum MatchingSepehr Assadi. 708-742 [doi]
- A Fast Minimum Degree Algorithm and Matching Lower BoundRobert Cummings, Matthew Fahrbach, Animesh Fatehpuria. 724-734 [doi]
- On a combinatorial generation problem of KnuthArturo I. Merino, Ondrej Micka, Torsten Mütze. 735-743 [doi]
- Average-Case Subset Balancing ProblemsXi Chen 0001, Yaonan Jin, Tim Randolph, Rocco A. Servedio. 743-778 [doi]
- On Locating Paths in Compressed TriesNicola Prezza. 744-760 [doi]
- Approximating the Median under the Ulam MetricDiptarka Chakraborty, Debarati Das 0001, Robert Krauthgamer. 761-775 [doi]
- The Growth Rate Over Trees Of Any Family Of Sets Defined By A Monadic Second Order Formula Is Semi-computableMatthieu Rosenfeld. 776-795 [doi]
- Efficient fully dynamic elimination forests with applications to detecting long paths and cyclesJiehua Chen 0001, Wojciech Czerwinski, Yann Disser, Andreas Emil Feldmann, Danny Hermelin, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk, Manuel Sorge, Bartlomiej Wróblewski, Anna Zych-Pawlewicz. 796-809 [doi]
- Shortest Paths Among Obstacles in the Plane RevisitedHaitao Wang. 810-821 [doi]
- A Constant Factor Approximation for Navigating Through Connected Obstacles in the PlaneNeeraj Kumar 0004, Daniel Lokshtanov, Saket Saurabh 0001, Subhash Suri. 822-839 [doi]
- The Sparse Parity MatrixAmin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Joon Lee, Jean Bernoulli Ravelomanana. 822-833 [doi]
- Strong recovery of geometric planted matchingsDmitriy Kunisky, Jonathan Niles-Weed. 834-876 [doi]
- PTAS for Minimum Cost Multi-covering with DisksZiyun Huang, Qilong Feng, Jianxin Wang 0001, Jinhui Xu 0001. 840-859 [doi]
- Coloring and Maximum Weight Independent Set of RectanglesParinya Chalermsook, Bartosz Walczak. 860-868 [doi]
- ∊-Approximation Algorithm for RMS Matching in a PlaneNathaniel Lahn, Sharath Raghvendra. 869-888 [doi]
- Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway DimensionAditya Jayaprakash, Mohammad R. Salavatipour. 877-893 [doi]
- Hamiltonicity of random subgraphs of the hypercubePadraig Condon, Alberto Espuny Díaz, António Girão, Daniela Kühn, Deryk Osthus. 889-898 [doi]
- A tight condition for triangle factors in pseudorandom graphsPatrick Morris 0001. 890-918 [doi]
- A 3-Approximation Algorithm for Maximum Independent Set of RectanglesWaldo Gálvez, Arindam Khan 0001, Mathieu Mari, Tobias Mömke, Madhusudhan Reddy Pittu, Andreas Wiese. 894-905 [doi]
- Unsplittable Flow on a Path: The Game!Fabrizio Grandoni 0001, Tobias Mömke, Andreas Wiese. 906-926 [doi]
- Analytic quantum weak coin flipping protocols with arbitrarily small biasAtul Singh Arora, Jérémie Roland, Chrysoula Vlachou. 919-938 [doi]
- Approximate Hypergraph Vertex Cover and generalized Tuza's conjectureVenkatesan Guruswami, Sai Sandeep. 927-944 [doi]
- Quantum algorithms for graph problems with cut queriesTroy Lee, Miklos Santha, Shengyu Zhang. 939-958 [doi]
- On complete classes of valuated matroidsEdin Husic, Georg Loho, Ben Smith, László A. Végh. 945-962 [doi]
- Approximating Permanent of Random Matrices with Vanishing Mean: Made Better and SimplerZhengfeng Ji, Zhihan Jin, Pinyan Lu. 959-975 [doi]
- A Sublinear Bound on the Page Number of Upward Planar GraphsPaul Jungeblut, Laura Merker, Torsten Ueckerdt. 963-978 [doi]
- Minimizing Convex Functions with Integral MinimizersHaotian Jiang. 976-985 [doi]
- Perfect Matching in Random Graphs is as Hard as TseitinPer Austrin, Kilian Risse. 979-1012 [doi]
- Improved Approximations for Min Sum Vertex Cover and Generalized Min Sum Set CoverNikhil Bansal 0001, Jatin Batra, Majid Farhadi, Prasad Tetali. 998-1005 [doi]
- Beyond Submodular Maximization via One-Sided SmoothnessMehrdad Ghadiri, Richard Santiago, F. Bruce Shepherd. 1006-1025 [doi]
- A Deterministic Parallel Reduction from Weighted Matroid Intersection Search to DecisionSumanta Ghosh, Rohit Gurjar, Roshan Raj. 1013-1035 [doi]
- Min-max Partitioning of Hypergraphs and Symmetric Submodular FunctionsKarthekeyan Chandrasekaran, Chandra Chekuri. 1026-1038 [doi]
- Twin-width VI: the lens of contraction sequencesÉdouard Bonnet, Eun Jung Kim 0002, Amadeus Reinald, Stéphan Thomassé. 1036-1056 [doi]
- A Local Search Framework for Experimental DesignLap Chi Lau, Hong Zhou 0001. 1039-1058 [doi]
- CLAP: A New Algorithm for Promise CSPsLorenzo Ciardo, Stanislav Zivný. 1057-1068 [doi]
- Optimal Contextual Pricing and ExtensionsAllen Liu, Renato Paes Leme, Jon Schneider. 1059-1078 [doi]
- High Dimensional Expanders: Eigenstripping, Pseudorandomness, and Unique GamesMitali Bafna, Max Hopkins, Tali Kaufman, Shachar Lovett. 1069-1128 [doi]
- On Multi-Dimensional Gains from Trade MaximizationYang Cai 0001, Kira Goldner, Steven Ma, Mingfei Zhao. 1079-1098 [doi]
- Beating Greedy For Approximating Reserve Prices in Multi-Unit VCG AuctionsMahsa Derakhshan, David M. Pennock, Aleksandrs Slivkins. 1099-1118 [doi]
- Estimating the Nash Social Welfare for coverage and other submodular valuationsWenzheng Li, Jan Vondrák. 1119-1130 [doi]
- Promise Constraint Satisfaction and WidthAlbert Atserias, Víctor Dalmau. 1129-1153 [doi]
- Online Combinatorial AuctionsYuan Deng, Debmalya Panigrahi, Hanrui Zhang. 1131-1149 [doi]
- Static and Streaming Data Structures for Fréchet Distance QueriesArnold Filtser, Omrit Filtser. 1150-1170 [doi]
- Algorithmic Thresholds for Refuting Random Polynomial SystemsJun-Ting Hsieh, Pravesh K. Kothari. 1154-1203 [doi]
- Approximate Nearest Neighbors Beyond Space PartitionsAlexandr Andoni, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten. 1171-1190 [doi]
- New Data Structures for Orthogonal Range Reporting and Range Minima QueriesYakov Nekrich. 1191-1205 [doi]
- Combinatorial Gap Theorem and Reductions between Promise CSPsLibor Barto, Marcin Kozik. 1204-1220 [doi]
- Vertex Sparsification for Edge ConnectivityParinya Chalermsook, Syamantak Das, Yunbum Kook, Bundit Laekhanukit, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz 0001. 1206-1225 [doi]
- Tight Guarantees for Multi-unit Prophet Inequalities and Online Stochastic KnapsackJiashuo Jiang, Will Ma, Jiawei Zhang. 1221-1246 [doi]
- Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with ApplicationsSebastian Forster, Gramoz Goranci, Monika Henzinger. 1226-1245 [doi]
- Robust Learning of Mixtures of GaussiansDaniel M. Kane. 1246-1258 [doi]
- Online Weighted Matching with a SampleHaim Kaplan, David Naori, Danny Raz. 1247-1272 [doi]
- Improved Algorithms for Population Recovery from the Deletion ChannelShyam Narayanan. 1259-1278 [doi]
- Robust Secretary and Prophet Algorithms for Packing Integer ProgramsC. J. Argue, Anupam Gupta 0001, Marco Molinaro 0001, Sahil Singla 0001. 1273-1297 [doi]
- List-Decodable Subspace Recovery: Dimension Independent Error in Polynomial TimeAinesh Bakshi, Pravesh K. Kothari. 1279-1297 [doi]
- Local Statistics, Semidefinite Programming, and Community DetectionJess Banks, Sidhanth Mohanty, Prasad Raghavendra. 1298-1316 [doi]
- Single-Sample Prophet Inequalities via Greedy-Ordered SelectionConstantine Caramanis, Paul Dütting, Matthew Faw, Federico Fusco, Philip Lazos, Stefano Leonardi, Orestis Papadigenopoulos, Emmanouil Pountourakis, Rebecca Reiffenhäuser. 1298-1325 [doi]
- On the Competitive Analysis and High Accuracy Optimality of Profile Maximum LikelihoodYanjun Han, Kirankumar Shiragur. 1317-1336 [doi]
- New Diameter-Reducing Shortcuts and Directed Hopsets: Breaking the BarrierShimon Kogan, Merav Parter. 1326-1341 [doi]
- ∊-BIC to BIC Transformation and Its Application to Black-Box Reduction in Revenue MaximizationYang Cai 0001, Argyris Oikonomou, Grigoris Velegkas, Mingfei Zhao. 1337-1356 [doi]
- Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-WilliamsTakehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi 0001, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki. 1342-1355 [doi]
- Online Discrepancy with Recourse for Vectors and GraphsAnupam Gupta 0001, Vijaykrishna Gurunathan, Ravishankar Krishnaswamy, Amit Kumar 0001, Sahil Singla 0001. 1356-1383 [doi]
- Non-Excludable Dynamic Mechanism DesignSantiago R. Balseiro, Vahab S. Mirrokni, Renato Paes Leme, Song Zuo. 1357-1373 [doi]
- In which matching markets does the short side enjoy an advantage?Yash Kanoria, Seungki Min, Pengyu Qian. 1374-1386 [doi]
- Recognizing <italic>k</italic>-leaf powers in polynomial time, for constant <italic>k</italic>Manuel Lafond. 1384-1410 [doi]
- Fast Convergence of Fictitious Play for Diagonal Payoff MatricesJacob D. Abernethy, Kevin A. Lai, Andre Wibisono. 1387-1404 [doi]
- Competitive Allocation of a Mixed MannaBhaskar Ray Chaudhury, Jugal Garg, Peter McGlaughlin, Ruta Mehta. 1405-1424 [doi]
- Isomorphism Testing for Graphs Excluding Small Topological SubgraphsDaniel Neuen. 1411-1434 [doi]
- Decomposing the Complement of the Union of Cubes in Three DimensionsPankaj K. Agarwal, Micha Sharir, Alex Steiger. 1425-1444 [doi]
- Faster Algorithms for Bounded-Difference Min-Plus ProductShucheng Chi, Ran Duan, Tianle Xie. 1435-1447 [doi]
- Spectral Sparsification of Metrics and KernelsKent Quanrud. 1445-1464 [doi]
- Polynomial-time algorithm for Maximum Independent Set in bounded-degree graphs with no long induced clawsTara Abrishami, Maria Chudnovsky, Cemil Dibek, Pawel Rzazewski. 1448-1470 [doi]
- (Near-)Linear-Time Randomized Algorithms for Row Minima in Monge Partial Matrices and Related ProblemsTimothy M. Chan. 1465-1482 [doi]
- Algorithmic trade-offs for girth approximation in undirected graphsAvi Kadria, Liam Roditty, Aaron Sidford, Virginia Vassilevska Williams, Uri Zwick. 1471-1492 [doi]
- Near-Optimal Randomized Algorithms for Selection in Totally Monotone MatricesTimothy M. Chan. 1483-1495 [doi]
- Unlinking, splitting, and some other NP-hard problems in knot theoryDale Koenig, Anastasiia Tsvietkova. 1496-1507 [doi]
- Lee-Yang zeros and the complexity of the ferromagnetic Ising Model on bounded-degree graphsPjotr Buys, Andreas Galanis, Viresh Patel, Guus Regts. 1508-1519 [doi]
- An FPTAS for the square lattice six-vertex and eight-vertex models at low temperaturesJin-yi Cai, Tianyu Liu. 1520-1534 [doi]
- Densest Subgraph: Supermodularity, Iterative Peeling, and FlowChandra Chekuri, Kent Quanrud, Manuel R. Torres. 1531-1555 [doi]
- New Planar P-time Computable Six-Vertex Models and a Complete Complexity ClassificationJin-yi Cai, Zhiguo Fu, Shuai Shao 0001. 1535-1547 [doi]
- Rapid Mixing for Colorings via Spectral IndependenceZongchen Chen, Andreas Galanis, Daniel Stefankovic, Eric Vigoda. 1548-1557 [doi]
- An Improved Local Search Algorithm for k-MedianVincent Cohen-Addad, Anupam Gupta 0001, Lunjia Hu, Hoon Oh, David Saulpic. 1556-1612 [doi]
- Rapid Mixing from Spectral Independence beyond the Boolean DomainWeiming Feng, Heng Guo 0001, Yitong Yin, Chihao Zhang 0001. 1558-1577 [doi]
- On Testability of First-Order Properties in Bounded-Degree GraphsIsolde Adler, Noleen Köhler, Pan Peng 0001. 1578-1597 [doi]
- Spectral Clustering Oracles in Sublinear TimeGrzegorz Gluch, Michael Kapralov, Silvio Lattanzi, Aida Mousavifar, Christian Sohler. 1598-1617 [doi]
- Massively Parallel and Dynamic Algorithms for Minimum Size ClusteringAlessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Peilin Zhong. 1613-1660 [doi]
- On Efficient Distance Approximation for Graph PropertiesNimrod Fiat, Dana Ron. 1618-1637 [doi]
- Query strategies for priced information, revisitedGuy Blanc, Jane Lange, Li-Yang Tan. 1638-1650 [doi]
- A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and PrivacyMarcel de Sena Dall'Agnol, Tom Gur, Oded Lachish. 1651-1665 [doi]
- Truly Low-Space Element Distinctness and Subset Sum via Pseudorandom Hash FunctionsLijie Chen 0001, Ce Jin, R. Ryan Williams, Hongxun Wu. 1661-1678 [doi]
- Block-Structured Integer and Linear Programming in Strongly Polynomial and Near Linear TimeJana Cslovjecsek, Friedrich Eisenbrand, Christoph Hunkenschröder, Lars Rohwedder, Robert Weismantel. 1666-1681 [doi]
- Testing matrix product statesMehdi Soleimanifar, John Wright. 1679-1701 [doi]
- A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive CombinatoricsJesper Nederlof, Jakub Pawlewicz, Céline M. F. Swennenhuis, Karol Wegrzycki. 1682-1701 [doi]
- Optimal Discretization is Fixed-parameter TractableStefan Kratsch, Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Manuel Sorge. 1702-1719 [doi]
- The complexity of testing all properties of planar graphs, and the role of isomorphismSabyasachi Basu, Akash Kumar 0003, C. Seshadhri. 1702-1714 [doi]
- Distribution-free Testing for Halfspaces (Almost) Requires PAC LearningXi Chen, Shyamal Patel. 1715-1743 [doi]
- Approximate Evaluation of First-Order Counting QueriesJan Dreier, Peter Rossmanith. 1720-1739 [doi]
- On Two-Handed Planar Assembly Partitioning with Connectivity ConstraintsPankaj K. Agarwal, Boris Aronov, Tzvika Geft, Dan Halperin. 1740-1756 [doi]
- Deterministic algorithms for the Lovász Local Lemma: simpler, more general, and more parallelDavid G. Harris 0001. 1744-1779 [doi]
- Fast Low-Space Algorithms for Subset SumCe Jin, Nikhil Vyas 0001, Ryan Williams 0001. 1757-1776 [doi]
- On Near-Linear-Time Algorithms for Dense Subset SumKarl Bringmann, Philip Wellnitz. 1777-1796 [doi]
- Multi-token Markov Game with Switching CostsJian Li 0015, Daogao Liu. 1780-1807 [doi]
- A Fine-Grained Perspective on Approximating Subset Sum and PartitionKarl Bringmann, Vasileios Nakos. 1797-1815 [doi]
- Stochastic Vertex Cover with Few QueriesSoheil Behnezhad, Avrim Blum, Mahsa Derakhshan. 1808-1846 [doi]
- Fine-grained hardness of CVP(P) - Everything that we can prove (and nothing else)Divesh Aggarwal, Huck Bennett, Alexander Golovnev, Noah Stephens-Davidowitz. 1816-1835 [doi]
- New Techniques and Fine-Grained Hardness for Dynamic Near-Additive SpannersThiago Bergamaschi, Monika Henzinger, Maximilian Probst Gutenberg, Virginia Vassilevska Williams, Nicole Wein. 1836-1855 [doi]
- Balanced Allocations: Caching and Packing, Twinning and ThinningDimitrios Los, Thomas Sauerwald, John Sylvester. 1847-1874 [doi]
- Tight Distributed Sketching Lower Bound for ConnectivityHuacheng Yu. 1856-1873 [doi]
- Space Lower Bounds for Approximating Maximum Matching in the Edge Arrival ModelMichael Kapralov. 1874-1893 [doi]
- Splay trees on treesBenjamin Aram Berendsohn, László Kozma 0002. 1875-1900 [doi]
- Graph Spanners by Sketching in Dynamic Streams and the Simultaneous Communication ModelArnold Filtser, Michael Kapralov, Navid Nouri. 1894-1913 [doi]
- Simulating a stack using queuesHaim Kaplan, Robert E. Tarjan, Or Zamir, Uri Zwick. 1901-1924 [doi]
- Streaming Submodular Matching Meets the Primal-Dual MethodRoie Levin, David Wajc. 1914-1933 [doi]
- Average Sensitivity of Dynamic ProgrammingSoh Kumabe, Yuichi Yoshida. 1925-1961 [doi]
- Improved Sublinear Time Algorithm for Longest Increasing SubsequenceMichael Mitzenmacher, Saeed Seddighin. 1934-1947 [doi]
- Induced subgraphs of bounded treewidth and the container methodTara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski, Paul D. Seymour. 1948-1964 [doi]
- Selectable Heaps and Optimal Lazy Search TreesBryce Sandlund, Lingyi Zhang. 1962-1975 [doi]
- Approximating Pathwidth for Graphs of Small TreewidthCarla Groenland, Gwenaël Joret, Wojciech Nadara, Bartosz Walczak. 1965-1976 [doi]
- Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-EquivalentAkanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan 0001, Saket Saurabh 0001, Meirav Zehavi. 1976-2004 [doi]
- Twin-width II: small classesÉdouard Bonnet, Colin Geniet, Eun Jung Kim 0002, Stéphan Thomassé, Rémi Watrigant. 1977-1996 [doi]
- Asymptotic dimension of minor-closed families and beyondChun-Hung Liu. 1997-2013 [doi]
- Subexponential Parameterized Algorithms on Disk Graphs (Extended Abstract)Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Jie Xue, Meirav Zehavi. 2005-2031 [doi]
- Rankwidth meets stabilityJaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz. 2014-2033 [doi]
- Planar Multiway Cut with Terminals on Few FacesSukanya Pandey, Erik Jan van Leeuwen. 2032-2063 [doi]
- Constrained-Order Prophet InequalitiesMakis Arsenis, Odysseas Drosis, Robert Kleinberg. 2034-2046 [doi]
- The Secretary Problem with Independent SamplingJosé R. Correa, Andrés Cristi, Laurent Feuilloley, Tim Oosterwijk, Alexandros Tsigonias-Dimitriadis. 2047-2058 [doi]
- Randomized Cup Game Algorithms Against Strong AdversariesMichael A. Bender, William Kuszmaul. 2059-2077 [doi]
- Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H<-Minor-Free GraphsSayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh 0001, Jie Xue. 2063-2084 [doi]
- Robust Algorithms for Online Convex Problems via Primal-DualMarco Molinaro 0001. 2078-2092 [doi]
- A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar GraphsDániel Marx, Pranabendu Misra, Daniel Neuen, Prafullkumar Tale. 2085-2127 [doi]
- Online Multiserver Convex Chasing and OptimizationSébastien Bubeck, Yuval Rabani, Mark Sellke. 2093-2104 [doi]
- Being Fast Means Being Chatty: The Local Information Cost of Graph SpannersPeter Robinson. 2105-2120 [doi]
- Distributed Metropolis Sampler with Optimal ParallelismWeiming Feng, Thomas P. Hayes, Yitong Yin. 2121-2140 [doi]
- Efficient generation of elimination trees and graph associahedraJean Cardinal, Arturo I. Merino, Torsten Mütze. 2128-2140 [doi]
- Enumerating k-SAT functionsDingding Dong, Nitya Mani, Yufei Zhao. 2141-2184 [doi]
- Atomic Power in Forks: A Super-Logarithmic Lower Bound for Implementing Butterfly Networks in the Nonatomic Binary Fork-Join ModelMichael T. Goodrich, Riko Jacob, Nodari Sitchinava. 2141-2153 [doi]
- Self-Stabilizing Clock Synchronization with 1-bit MessagesPaul Bastide 0002, George Giakkoupis, Hayk Saribekyan. 2154-2173 [doi]
- Shorter Labels for Routing in TreesPawel Gawrychowski, Wojciech Janczewski, Jakub Lopuszanski. 2174-2193 [doi]
- A Lower Bound for the n-queens ProblemMichael Simkin, Zur Luria. 2185-2197 [doi]
- Peeling Close to the Orientability Threshold - Spatial Coupling in Hashing-Based Data StructuresStefan Walzer. 2194-2211 [doi]
- Deterministic enumeration of all minimum k-cut-sets in hypergraphs for fixed kCalvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang 0002. 2208-2228 [doi]
- The Expander Hierarchy and its Applications to Dynamic Graph AlgorithmsGramoz Goranci, Harald Räcke, Thatchaphol Saranurak, Zihan Tan. 2212-2228 [doi]
- Approximate Core for Committee Selection via Multilinear Extension and Market ClearingKamesh Munagala, Yiheng Shen, Kangning Wang, Zhiyi Wang. 2229-2252 [doi]
- A Lower Bound for Dynamic Fractional CascadingPeyman Afshani. 2229-2248 [doi]
- n)Gilad Asharov, Wei-Kai Lin, Elaine Shi. 2249-2268 [doi]
- Computational Hardness of the Hylland-Zeckhauser SchemeThomas Chen, Xi Chen, Binghui Peng, Mihalis Yannakakis. 2253-2268 [doi]
- Approximating Equilibrium under Constrained Piecewise Linear Concave Utilities with Applications to Matching MarketsJugal Garg, Yixin Tao, László A. Végh. 2269-2284 [doi]
- Competitive Data-Structure DynamizationClaire Mathieu, Rajmohan Rajaraman, Neal E. Young, Arman Yousefi. 2269-2287 [doi]
- Polynomial Time Algorithms to Find an Approximate Competitive Equilibrium for ChoresShant Boodaghians, Bhaskar Ray Chaudhury, Ruta Mehta. 2285-2302 [doi]
- Counting Small Permutation PatternsChaim Even-Zohar, Calvin Leng. 2288-2302 [doi]
- Better Sum Estimation via Weighted SamplingLorenzo Beretta 0001, Jakub Tetek. 2303-2338 [doi]
- 4-minor-free Graphs, modulo 2Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný. 2303-2314 [doi]
- Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The Barrier of Long Induced CyclesSuman K. Bera, Noujan Pashanasangi, C. Seshadhri. 2315-2332 [doi]
- The Fine-Grained Complexity of Computing the Tutte Polynomial of a Linear MatroidAndreas Björklund, Petteri Kaski. 2333-2345 [doi]
- Approximating Sumset SizeAnindya De, Shivam Nadimpalli, Rocco A. Servedio. 2339-2357 [doi]
- Nearly Optimal Average-Case Complexity of Counting Bicliques Under SETHShuichi Hirahara, Nobutaka Shimizu. 2346-2365 [doi]
- Improved Algorithms for Low Rank Approximation from SparsityDavid P. Woodruff, Taisuke Yasuda 0002. 2358-2403 [doi]
- Optimal Oblivious Priority QueuesZahra Jafargholi, Kasper Green Larsen, Mark Simkin 0001. 2366-2383 [doi]
- Connecting Robust Shuffle Privacy and Pan-PrivacyVictor Balcer, Albert Cheu, Matthew Joseph, Jieming Mao. 2384-2403 [doi]
- Approximating the Arboricity in Sublinear TimeTalya Eden, Saleet Mossel, Dana Ron. 2404-2425 [doi]
- k-wise independence with applications to non-uniform securityNick Gravin, Siyao Guo, Tsz Chiu Kwok, Pinyan Lu. 2404-2423 [doi]
- Efficient Document Exchange and Error Correcting Codes with Asymmetric InformationKuan Cheng, Xin Li. 2424-2443 [doi]
- Distributed Zero-Knowledge Proofs Over NetworksAviv Bick, Gillat Kol, Rotem Oshman. 2426-2458 [doi]
- p-NormsDivesh Aggarwal, Yanlin Chen, Rajendra Kumar, Zeyong Li, Noah Stephens-Davidowitz. 2444-2462 [doi]
- Optimal Oblivious Parallel RAMGilad Asharov, Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, Elaine Shi. 2459-2521 [doi]
- Incremental Single Source Shortest Paths in Sparse DigraphsShiri Chechik, Tianyi Zhang. 2463-2477 [doi]
- Deterministic Algorithms for Decremental Shortest Paths via Layered Core DecompositionJulia Chuzhoy, Thatchaphol Saranurak. 2478-2496 [doi]
- Approximate Distance Oracles Subject to Multiple Vertex FailuresRan Duan, Yong Gu, Hanlin Ren. 2497-2516 [doi]
- Planar Distance Oracles with Better Time-Space TradeoffsYaowei Long, Seth Pettie. 2517-2537 [doi]
- Limits of Preprocessing for Single-Server PIRGiuseppe Persiano, Kevin Yeo. 2522-2548 [doi]
- Dynamic Set Cover: Improved Amortized and Worst-Case Update TimeSayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Xiaowei Wu 0001. 2537-2549 [doi]
- 1-Oblivious RoutingGoran Zuzic, Gramoz Goranci, Mingquan Ye, Bernhard Haeupler, Xiaorui Sun. 2549-2579 [doi]
- Improved Algorithms for Solving Polynomial Systems over GF(2) by Multiple Parity-CountingItai Dinur. 2550-2564 [doi]
- On the Orbit Closure Containment Problem and Slice Rank of TensorsMarkus Bläser, Christian Ikenmeyer, Vladimir Lysikov, Anurag Pandey 0001, Frank-Olaf Schreyer. 2565-2584 [doi]
- Near-Optimal Explainable k-Means for All DimensionsMoses Charikar, Lunjia Hu. 2580-2606 [doi]
- On Indexing and Compressing Finite AutomataNicola Cotumaccio, Nicola Prezza. 2585-2599 [doi]
- Deep Weisfeiler LemanMartin Grohe, Pascal Schweitzer, Daniel Wiebking. 2600-2614 [doi]
- How many Clusters? - An algorithmic answerChiranjib Bhattacharyya, Ravindran Kannan, Amit Kumar 0001. 2607-2640 [doi]
- p Arguments and Implications for Necklace SplittingAris Filos-Ratsikas, Alexandros Hollender, Katerina Sotiraki, Manolis Zampetakis. 2615-2634 [doi]
- On Approximability of Clustering Problems Without Candidate CentersVincent Cohen-Addad, Karthik C. S., Euiwoong Lee. 2635-2648 [doi]
- Almost Tight Approximation Algorithms for Explainable ClusteringHossein Esfandiari, Vahab S. Mirrokni, Shyam Narayanan. 2641-2663 [doi]
- k-means Clustering of Affine SubspacesEduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov. 2649-2659 [doi]
- Consistent k-Clustering for General MetricsHendrik Fichtenberger, Silvio Lattanzi, Ashkan Norouzi-Fard, Ola Svensson. 2660-2678 [doi]
- Approximating Fair Clustering with Cascaded Norm ObjectivesEden Chlamtác, Yury Makarychev, Ali Vakilian. 2664-2683 [doi]
- Coresets for Clustering in Excluded-minor Graphs and BeyondVladimir Braverman, Shaofeng H.-C. Jiang, Robert Krauthgamer, Xuan Wu 0002. 2679-2696 [doi]
- On the complexity of binary polynomial optimization over acyclic hypergraphsAlberto Del Pia, Silvia Di Gregorio. 2684-2699 [doi]
- k, ℓ-Median Clustering for Polygonal CurvesMaike Buchin, Anne Driemel, Dennis Rohde. 2697-2717 [doi]
- On finding exact solutions of linear programs in the oracle modelDaniel Dadush, László A. Végh, Giacomo Zambelli. 2700-2722 [doi]
- k-CyclePawel Gawrychowski, Shay Mozes, Oren Weimann. 2717-2724 [doi]
- Computing Lewis Weights to High PrecisionMaryam Fazel, Yin Tat Lee, Swati Padmanabhan, Aaron Sidford. 2723-2742 [doi]
- Minimum-cost integer circulations in given homology classesSarah Morell, Ina Seidel, Stefan Weltge. 2725-2739 [doi]
- Planar Reachability Under Single Vertex or Edge FailuresGiuseppe F. Italiano, Adam Karczmarz, Nikos Parotsidis. 2739-2758 [doi]
- Congruency-Constrained TU Problems Beyond the Bimodular CaseMartin Nägele, Richard Santiago, Rico Zenklusen. 2743-2790 [doi]
- How to Morph Graphs on the TorusErin Wolf Chambers, Jeff Erickson 0001, Patrick Lin 0001, Salman Parsa. 2759-2778 [doi]
- 2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)TreesPatrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani. 2779-2798 [doi]
- Near-Optimal Quantum Algorithms for String ProblemsShyan Akmal, Ce Jin. 2791-2832 [doi]
- Tight Bounds for Online Graph PartitioningMonika Henzinger, Stefan Neumann 0003, Harald Räcke, Stefan Schmid 0001. 2799-2818 [doi]
- Online Generalized Network Design Under (Dis)Economies of ScaleViswanath Nagarajan, Lily Wang. 2819-2829 [doi]
- Online Edge Coloring Algorithms via the Nibble MethodSayan Bhattacharya, Fabrizio Grandoni 0001, David Wajc. 2830-2842 [doi]
- Pattern Matching on Grammar-Compressed Strings in Linear TimeMoses Ganardi, Pawel Gawrychowski. 2833-2846 [doi]
- Online Discrepancy Minimization for Stochastic ArrivalsNikhil Bansal 0001, Haotian Jiang, Raghu Meka, Sahil Singla 0001, Makrand Sinha. 2842-2861 [doi]
- An Upper Bound and Linear-Space Queries on the LZ-End ParsingDominik Kempa, Barna Saha. 2847-2866 [doi]
- Two-stage Stochastic Matching with Application to Ride HailingYiding Feng, Rad Niazadeh, Amin Saberi. 2862-2877 [doi]
- How Compression and Approximation Affect Efficiency in String Distance MeasuresArun Ganesh, Tomasz Kociumaka, Andrea Lincoln, Barna Saha. 2867-2919 [doi]
- Tight Distributed Listing of CliquesKeren Censor Hillel, Yi-Jun Chang, François Le Gall, Dean Leitersdorf. 2878-2891 [doi]
- A Time-Optimal Randomized Parallel Algorithm for MISMohsen Ghaffari, Bernhard Haeupler. 2892-2903 [doi]
- Improved Deterministic Network DecompositionMohsen Ghaffari, Christoph Grunau, Václav Rozhon. 2904-2923 [doi]
- Private Interdependent ValuationsAlon Eden, Kira Goldner, Shuran Zheng. 2920-2939 [doi]
- Optimal Vertex Fault-Tolerant Spanners in Polynomial TimeGreg Bodwin, Michael Dinitz, Caleb Robelle. 2924-2938 [doi]
- Dynamic Graph Algorithms with Batch Updates in the Massively Parallel Computation ModelKrzysztof Nowicki 0002, Krzysztof Onak. 2939-2958 [doi]
- Deterministic Budget-Feasible Clock AuctionsEric Balkanski, Pranav Garimidi, Vasilis Gkatzelis, Daniel Schoepflin 0001, Xizhi Tan. 2940-2963 [doi]
- Scheduling with Communication Delays via LP Hierarchies and Clustering II: Weighted Completion Times on Related MachinesSami Davies, Janardhan Kulkarni, Thomas Rothvoss, Jakub Tarnawski, Yihao Zhang. 2958-2977 [doi]
- Fixed-Price Approximations in Bilateral TradeZi Yang Kang, Francisco Pernice, Jan Vondrák. 2964-2985 [doi]
- Hardness of Approximation for Orienteering with Multiple Time WindowsNaveen Garg 0001, Sanjeev Khanna, Amit Kumar 0001. 2977-2990 [doi]
- Metric Distortion Bounds for Randomized Social ChoiceMoses Charikar, Prasanna Ramakrishnan. 2986-3004 [doi]
- Towards PTAS for Precedence Constrained Scheduling via Combinatorial AlgorithmsShi Li. 2991-3010 [doi]
- Improved Sliding Window Algorithms for Clustering and Coverage via Bucketing-Based SketchesAlessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Peilin Zhong. 3005-3042 [doi]
- Non-uniform Geometric Set Cover and Scheduling on Multiple MachinesNikhil Bansal 0001, Jatin Batra. 3011-3021 [doi]
- Tight Bounds for Parallel Paging and Green PagingKunal Agrawal, Michael A. Bender, Rathish Das, William Kuszmaul, Enoch Peserico, Michele Scquizzato. 3022-3041 [doi]
- Near-Optimal Algorithms for Linear Algebra in the Current Matrix Multiplication TimeNadiia Chepurko, Kenneth L. Clarkson, Praneeth Kacham, David P. Woodruff. 3043-3068 [doi]
- Deterministic and Las Vegas Algorithms for Sparse Nonnegative ConvolutionKarl Bringmann, Nick Fischer, Vasileios Nakos. 3069-3090 [doi]
- Simulating Random Walks in Random StreamsJohn Kallaugher, Michael Kapralov, Eric Price. 3091-3126 [doi]
- Optimal angle bounds for Steiner triangulations of polygonsChristopher J. Bishop. 3127-3143 [doi]
- Preprocessing Imprecise Points for the Pareto FrontIvor van der Hoog, Irina Kostitsyna, Maarten Löffler, Bettina Speckmann. 3144-3167 [doi]
- Polygon Placement Revisited: (Degree of Freedom + 1)-SUM Hardness and an Improvement via Offline Dynamic Rectangle UnionMarvin Künnemann, André Nusser. 3181-3201 [doi]
- An Improved Analysis of Greedy for Online Steiner ForestÉtienne Bamas, Marina Drygala, Andreas Maggiori. 3202-3229 [doi]
- Polynomial Integrality Gap of Flow LP for Directed Steiner TreeShi Li 0001, Bundit Laekhanukit. 3230-3236 [doi]
- Augmenting Edge Connectivity via Isolating CutsRuoxu Cen, Jason Li 0006, Debmalya Panigrahi. 3237-3252 [doi]
- Local Search for Weighted Tree Augmentation and Steiner TreeVera Traub, Rico Zenklusen. 3253-3272 [doi]
- Greedy Spanners in Euclidean Spaces Admit Sublinear SeparatorsHung Le, Cuong Than. 3287-3310 [doi]
- Better Lower Bounds for Shortcut Sets and Additive Spanners via an Improved Alternation ProductKevin Lu, Virginia Vassilevska Williams, Nicole Wein, Zixuan Xu. 3311-3331 [doi]
- Near-Optimal Spanners for General Graphs in (Nearly) Linear TimeHung Le, Shay Solomon. 3332-3361 [doi]
- Co-evolution of Opinion and Social Tie Dynamics Towards Structural BalanceHaotian Wang 0002, Feng Luo, Jie Gao 0001. 3362-3388 [doi]
- Spectral recovery of binary censored block modelsSouvik Dhara, Julia Gaudio, Elchanan Mossel, Colin Sandon. 3389-3416 [doi]
- Fast Consensus via the Unconstrained Undecided State DynamicsGregor Bankhamer, Petra Berenbrink, Felix Biermeier, Robert Elsässer, Hamed Hosseinpour, Dominik Kaaser, Peter Kling. 3417-3429 [doi]
- Algorithms Using Local Graph Features to Predict EpidemicsYeganeh Alimohammadi, Christian Borgs, Amin Saberi. 3430-3451 [doi]
- Incremental SSSP for Sparse Digraphs Beyond the Hopset BarrierRasmus Kyng, Simon Meierhans, Maximilian Probst Gutenberg. 3452-3481 [doi]
- A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar DigraphsDebarati Das 0001, Maximilian Probst Gutenberg, Christian Wulff-Nilsen. 3482-3495 [doi]
- Dynamic Geometric Set Cover, RevisitedTimothy M. Chan, Qizheng He, Subhash Suri, Jie Xue 0003. 3496-3528 [doi]
- New Trade-Offs for Fully Dynamic Matching via Hierarchical EDCSSoheil Behnezhad, Sanjeev Khanna. 3529-3566 [doi]
- On the Fine-Grained Complexity of the Unbounded SubsetSum and the Frobenius ProblemKim-Manuel Klein. 3567-3582 [doi]
- Optimal Sorting Circuits for Short KeysWei-Kai Lin, Elaine Shi. 3583-3629 [doi]
- Friendly Cut Sparsifiers and Faster Gomory-Hu TreesAmir Abboud, Robert Krauthgamer, Ohad Trabelsi. 3630-3649 [doi]
- An Improved Algorithm for The k-Dyck Edit Distance ProblemDvir Fried, Shay Golan 0001, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Tatiana Starikovskaya. 3650-3669 [doi]
- On Mixing of Markov Chains: Coupling, Spectral Independence, and Entropy FactorizationAntonio Blanca, Pietro Caputo, Zongchen Chen, Daniel Parisi, Daniel Stefankovic, Eric Vigoda. 3670-3692 [doi]
- Cut Sparsification of the Clique Beyond the Ramanujan Bound: A Separation of Cut Versus Spectral SparsificationAntares Chen, Jonathan Shi, Luca Trevisan. 3693-3731 [doi]
- ∞-IndependenceTali Kaufman, Rasmus Kyng, Federico Soldà. 3732-3753 [doi]
- Compact Redistricting Plans Have Many Spanning TreesAriel D. Procaccia, Jamie Tucker-Foltz. 3754-3771 [doi]