Table of Contents

• Efficient Linear and Affine Codes for Correcting Insertions/DeletionsKuan Cheng, Venkatesan Guruswami, Bernhard Haeupler, Xin Li 0006. 1-20 [doi]
• Front Matter1-22 [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]
• 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 0001, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha. 54-73 [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, Euiwoong Lee, Jason Li 0006. 89-105 [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]
• 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]
• k-Disjoint Shortest Paths ProblemWillian 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]
• FPT-approximation for FPT ProblemsDaniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan 0001, Saket Saurabh 0001, Meirav Zehavi. 199-218 [doi]
• Strong Connectivity Augmentation is FPTKristine Vitting Klinkby, Pranabendu Misra, Saket Saurabh 0001. 219-234 [doi]
• Directed Shortest Paths via Approximate Cost BalancingJames B. Orlin, László A. Végh. 235-254 [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]
• 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]
• Random Restrictions of High Dimensional Distributions and Uniformity Testing with Subcube ConditioningClément L. Canonne, Xi Chen 0001, Gautam Kamath 0001, Amit Levi, Erik Waingarten. 321-336 [doi]
• Optimal Distribution-Free Sample-Based Testing of Subsequence-FreenessDana Ron, Asaf Rosin. 337-256 [doi]
• On Tolerant Distribution Testing in the Conditional Sampling ModelShyam Narayanan. 357-373 [doi]
• SoS Degree Reduction with Applications to Clustering and Robust Moment EstimationDavid Steurer, Stefan Tiegel. 374-393 [doi]
• Uncertainty about Uncertainty: Optimal Adaptive Algorithms for Estimating Mixtures of Unknown CoinsJasper C. H. Lee, Paul Valiant. 414-433 [doi]
• Approximation Algorithms and Hardness for Strong Unique GamesSuprovat Ghoshal, Anand Louis. 414-433 [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]
• 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]
• Solving Sparse Linear Systems Faster than Matrix MultiplicationRichard Peng, Santosh S. Vempala. 504-521 [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. 579-591 [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]
• Infinite-Duration All-Pay Bidding GamesGuy Avni, Ismaël Jecker, Dorde Zikelic. 617-636 [doi]
• Algorithms for Persuasion with Limited CommunicationRonen Gradwohl, Niklas Hahn, Martin Hoefer, 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, Penny Haxell. 662-674 [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]
• Deterministic Replacement Path CoveringKarthik C. S., Merav Parter. 704-723 [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]
• 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]
• 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]
• 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]
• Analytic quantum weak coin flipping protocols with arbitrarily small biasAtul Singh Arora, Jérémie Roland, Chrysoula Vlachou. 919-938 [doi]
• Quantum algorithms for graph problems with cut queriesTroy Lee, Miklos Santha, Shengyu Zhang. 939-958 [doi]
• Approximating Permanent of Random Matrices with Vanishing Mean: Made Better and SimplerZhengfeng Ji, Zhihan Jin, Pinyan Lu. 959-975 [doi]
• Minimizing Convex Functions with Integral MinimizersHaotian Jiang. 976-985 [doi]
• Improved Approximations for Min Sum Vertex Cover and Generalized Min Sum Set CoverNikhil Bansal, 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]
• Min-max Partitioning of Hypergraphs and Symmetric Submodular FunctionsKarthekeyan Chandrasekaran, Chandra Chekuri. 1026-1038 [doi]
• A Local Search Framework for Experimental DesignLap Chi Lau, Hong Zhou 0001. 1039-1058 [doi]
• Optimal Contextual Pricing and ExtensionsAllen Liu, Renato Paes Leme, Jon Schneider. 1059-1078 [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]
• 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]
• 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]
• 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]
• 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]
• Improved Algorithms for Population Recovery from the Deletion ChannelShyam Narayanan. 1259-1278 [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]
• On the Competitive Analysis and High Accuracy Optimality of Profile Maximum LikelihoodYanjun Han, Kirankumar Shiragur. 1317-1336 [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]
• 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]
• 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]
• Decomposing the Complement of the Union of Cubes in Three DimensionsPankaj K. Agarwal, Micha Sharir, Alex Steiger. 1425-1444 [doi]
• Spectral Sparsification of Metrics and KernelsKent Quanrud. 1445-1464 [doi]
• (Near-)Linear-Time Randomized Algorithms for Row Minima in Monge Partial Matrices and Related ProblemsTimothy M. Chan. 1465-1482 [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]
• 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]
• 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]
• 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]
• 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]
• 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]
• 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]
• 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]
• A Fine-Grained Perspective on Approximating Subset Sum and PartitionKarl Bringmann, Vasileios Nakos. 1797-1815 [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]
• 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]
• Graph Spanners by Sketching in Dynamic Streams and the Simultaneous Communication ModelArnold Filtser, Michael Kapralov, Navid Nouri. 1894-1913 [doi]
• Streaming Submodular Matching Meets the Primal-Dual MethodRoie Levin, David Wajc. 1914-1933 [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]
• Approximating Pathwidth for Graphs of Small TreewidthCarla Groenland, Gwenaël Joret, Wojciech Nadara, Bartosz Walczak. 1965-1976 [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]
• Rankwidth meets stabilityJaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz. 2014-2033 [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]
• Robust Algorithms for Online Convex Problems via Primal-DualMarco Molinaro. 2078-2092 [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 0010. 2105-2120 [doi]
• Distributed Metropolis Sampler with Optimal ParallelismWeiming Feng, Thomas P. Hayes, Yitong Yin. 2121-2140 [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, George Giakkoupis, Hayk Saribekyan. 2154-2173 [doi]
• Shorter Labels for Routing in TreesPawel Gawrychowski, Wojciech Janczewski, Jakub Lopuszanski. 2174-2193 [doi]
• Peeling Close to the Orientability Threshold - Spatial Coupling in Hashing-Based Data StructuresStefan Walzer. 2194-2211 [doi]
• The Expander Hierarchy and its Applications to Dynamic Graph AlgorithmsGramoz Goranci, Harald Räcke, Thatchaphol Saranurak, Zihan Tan. 2212-2228 [doi]
• A Lower Bound for Dynamic Fractional CascadingPeyman Afshani. 2229-2248 [doi]
• n)Gilad Asharov, Wei-Kai Lin, Elaine Shi. 2249-2268 [doi]
• Competitive Data-Structure DynamizationClaire Mathieu, Rajmohan Rajaraman, Neal E. Young, Arman Yousefi. 2269-2287 [doi]
• Counting Small Permutation PatternsChaim Even-Zohar, Calvin Leng. 2288-2302 [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]
• Nearly Optimal Average-Case Complexity of Counting Bicliques Under SETHShuichi Hirahara, Nobutaka Shimizu. 2346-2365 [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]
• 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]
• p-NormsDivesh Aggarwal, Yanlin Chen, Rajendra Kumar, Zeyong Li, Noah Stephens-Davidowitz. 2444-2462 [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]
• Dynamic Set Cover: Improved Amortized and Worst-Case Update TimeSayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Xiaowei Wu 0001. 2537-2549 [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]
• On Indexing and Compressing Finite AutomataNicola Cotumaccio, Nicola Prezza. 2585-2599 [doi]
• Deep Weisfeiler LemanMartin Grohe, Pascal Schweitzer, Daniel Wiebking. 2600-2614 [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]
• k-means Clustering of Affine SubspacesEduard Eiben, Fedor V. Fomin, Petr A. Golovach, Willian 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]
• Coresets for Clustering in Excluded-minor Graphs and BeyondVladimir Braverman, Shaofeng H.-C. Jiang, Robert Krauthgamer, Xuan Wu 0002. 2679-2696 [doi]
• k, ℓ-Median Clustering for Polygonal CurvesMaike Buchin, Anne Driemel, Dennis Rohde. 2697-2717 [doi]
• k-CyclePawel Gawrychowski, Shay Mozes, Oren Weimann. 2717-2724 [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]
• 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]
• 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]
• Online Discrepancy Minimization for Stochastic ArrivalsNikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla 0001, Makrand Sinha. 2842-2861 [doi]
• Two-stage Stochastic Matching with Application to Ride HailingYiding Feng, Rad Niazadeh, Amin Saberi. 2862-2877 [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]
• 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]
• 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]
• Hardness of Approximation for Orienteering with Multiple Time WindowsNaveen Garg 0001, Sanjeev Khanna, Amit Kumar 0001. 2977-2990 [doi]
• Towards PTAS for Precedence Constrained Scheduling via Combinatorial AlgorithmsShi Li. 2991-3010 [doi]
• Non-uniform Geometric Set Cover and Scheduling on Multiple MachinesNikhil Bansal, 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]