Abstract is missing.
- Front Matter [doi]
- An almost 2-approximation for all-pairs of shortest paths in subquadratic timeMaor Akav, Liam Roditty. 1-11 [doi]
- Truly Subcubic Min-Plus Product for Less Structured Matrices, with ApplicationsVirginia Vassilevska Williams, Yinzhan Xu. 12-29 [doi]
- Equivalences between triangle and range query problemsLech Duraj, Krzysztof Kleiner, Adam Polak 0001, Virginia Vassilevska Williams. 30-47 [doi]
- New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected GraphsAmir Abboud, Robert Krauthgamer, Ohad Trabelsi. 48-61 [doi]
- t-Wise Agreement Testing Theorem)Pasin Manurangsi. 62-81 [doi]
- Learning from satisfying assignments under continuous distributionsClément L. Canonne, Anindya De, Rocco A. Servedio. 82-101 [doi]
- A Tight Analysis of Greedy Yields Subexponential Time Approximation for Uniform Decision TreeRay Li, Percy Liang, Stephen Mussmann. 102-121 [doi]
- k · nnz(data)) time via Subset SmoothingChiranjib Bhattacharyya, Ravindran Kannan. 122-140 [doi]
- Oblivious Sketching of High-Degree Polynomial KernelsThomas D. Ahle, Michael Kapralov, Jakob Bæk Tejs Knudsen, Rasmus Pagh, Ameya Velingker, David P. Woodruff, Amir Zandieh. 141-160 [doi]
- List Decodable Learning via Sum of SquaresPrasad Raghavendra, Morris Yau. 161-180 [doi]
- Zeros of ferromagnetic 2-spin systemsHeng Guo 0001, Jingcheng Liu 0001, Pinyan Lu. 181-192 [doi]
- Adaptive Quantum Simulated Annealing for Bayesian Inference and Estimating Partition FunctionsAram Wettroth Harrow, Annie Y. Wei. 193-212 [doi]
- Optimal Space-Depth Trade-Off of CNOT Circuits in Quantum Logic SynthesisJiaqing Jiang, Xiaoming Sun, Shang-Hua Teng, Bujiao Wu, Kewen Wu 0001, Jialin Zhang. 213-229 [doi]
- Normalizes and permutational isomorphisms in simply-exponential timeDaniel Wiebking. 230-238 [doi]
- The Directed Flat Wall TheoremArchontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon. 239-258 [doi]
- A Deterministic Linear Program Solver in Current Matrix Multiplication TimeJan van den Brand. 259-278 [doi]
- Packing LPs are Hard to Solve Accurately, Assuming Linear Equations are HardRasmus Kyng, Di Wang, Peng Zhang 0010. 279-296 [doi]
- Symmetric Polymorphisms and Efficient Decidability of Promise CSPsJoshua Brakensiek, Venkatesan Guruswami. 297-304 [doi]
- Extended Formulation Lower Bounds for Refuting Random CSPsJonah Brown-Cohen, Prasad Raghavendra. 305-324 [doi]
- Quasi-popular Matchings, Optimality, and Extended FormulationsYuri Faenza, Telikepalli Kavitha. 325-344 [doi]
- Computational Concentration of Measure: Optimal Bounds, Reductions, and MoreOmid Etesami, Saeed Mahloujifar, Mohammad Mahmoody. 345-363 [doi]
- Efficiency of the floating body as a robust measure of dispersionJoseph Anderson, Luis Rademacher. 364-377 [doi]
- Sample Efficient Toeplitz Covariance EstimationYonina C. Eldar, Jerry Li, Cameron Musco, Christopher Musco. 378-397 [doi]
- On the Learnability of Random Deep NetworksAbhimanyu Das, Sreenivas Gollapudi, Ravi Kumar 0001, Rina Panigrahy. 398-410 [doi]
- Exact computation of a manifold metric, via Lipschitz Embeddings and Shortest Paths on a GraphTimothy Chu, Gary L. Miller, Donald R. Sheehy. 411-425 [doi]
- How to Store a Random WalkEmanuele Viola, Omri Weinstein, Huacheng Yu. 426-445 [doi]
- Shorter Labeling Schemes for Planar GraphsMarthe Bonamy, Cyril Gavoille, Michal Pilipczuk. 446-462 [doi]
- Dynamic Low-Stretch Spanning Trees in Subpolynomial TimeShiri Chechik, Tianyi Zhang. 463-475 [doi]
- Coarse-Grained Complexity for Dynamic AlgorithmsSayan Bhattacharya, Danupon Nanongkai, Thatchaphol Saranurak. 476-494 [doi]
- Extremal Distances in Directed Graphs: Tight Spanners and Near-Optimal Approximation AlgorithmsKeerti Choudhary, Omer Gold. 495-514 [doi]
- Exponential Separations in Local Differential PrivacyMatthew Joseph, Jieming Mao, Aaron Roth 0001. 515-527 [doi]
- Individual Sensitivity Preprocessing for Data PrivacyRachel Cummings, David Durfee. 528-547 [doi]
- k-Means ClusteringUri Stemmer. 548-559 [doi]
- Differentially Private Release of Synthetic GraphsMarek Eliás 0001, Michael Kapralov, Janardhan Kulkarni, Yin Tat Lee. 560-578 [doi]
- The rank of sparse random matricesAmin Coja-Oghlan, Alperen Ali Ergür, Pu Gao, Samuel Hetterich, Maurice Rolvien. 579-591 [doi]
- A Lower Bound for Jumbled IndexingPeyman Afshani, Ingo van Duijn, Rasmus Killmann, Jesper Sindahl Nielsen. 592-606 [doi]
- Locally Consistent Parsing for Text Indexing in Small SpaceOr Birenzwige, Shay Golan, Ely Porat. 607-626 [doi]
- Better Data Structures for Colored Orthogonal Range ReportingTimothy M. Chan, Yakov Nekrich. 627-636 [doi]
- Faster Deterministic and Las Vegas Algorithms for Offline Approximate Nearest Neighbors in High DimensionsJosh Alman, Timothy M. Chan, R. Ryan Williams. 637-649 [doi]
- Flushing Without CascadesMichael A. Bender, Rathish Das, Martin Farach-Colton, Rob Johnson, William Kuszmaul. 650-669 [doi]
- A randomly weighted minimum spanning tree with a random cost constraintAlan M. Frieze, Tomasz Tkocz. 670-689 [doi]
- Sandwiching random regular graphs between binomial random graphsPu Gao, Mikhail Isaev, Brendan D. McKay. 690-701 [doi]
- Factors and loose Hamilton cycles in sparse pseudo-random hypergraphsHiêp Hàn, Jie Han 0002, Patrick Morris 0001. 702-717 [doi]
- Very fast construction of bounded-degree spanning graphs via the semi-random graph processOmri Ben-Eliezer, Lior Gishboliner, Dan Hefetz, Michael Krivelevich. 718-737 [doi]
- A New Algorithm for the Robust Semi-random Independent Set ProblemTheo McKenzie, Hermish Mehta, Luca Trevisan. 738-746 [doi]
- Tightening Curves on Surfaces Monotonically with ApplicationsHsien-Chih Chang, Arnaud de Mesmay. 747-766 [doi]
- Embeddability of Simplicial Complexes is UndecidableMarek Filakovský, Uli Wagner 0001, Stephan Zhechev. 767-785 [doi]
- Optimal Bound on the Combinatorial Complexity of Approximating PolytopesRahul Arya, Sunil Arya, Guilherme D. da Fonseca, David M. Mount. 786-805 [doi]
- Optimal Orthogonal Drawings of Planar 3-Graphs in Linear TimeWalter Didimo, Giuseppe Liotta, Giacomo Ortali, Maurizio Patrignani. 806-825 [doi]
- Euclidean Bottleneck Bounded-Degree Spanning Tree RatiosAhmad Biniaz. 826-836 [doi]
- Near-optimal Approximate Discrete and Continuous Submodular Function MinimizationBrian Axelrod, Yang P. Liu, Aaron Sidford. 837-853 [doi]
- Sticky Brownian Rounding and its Applications to Constraint Satisfaction ProblemsSepehr Abbasi Zadeh, Nikhil Bansal, Guru Guruganesh, Aleksandar Nikolov, Roy Schwartz, Mohit Singh. 854-873 [doi]
- Spherical Discrepancy Minimization and Algorithmic Lower Bounds for Covering the SphereChris Jones, Matt McPartlon. 874-891 [doi]
- q-norm problemsDeeksha Adil, Sushant Sachdeva. 892-910 [doi]
- Regular Languages meet Prefix SortingJarno Alanko, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza. 911-930 [doi]
- Hitting Topological Minor Models in Planar Graphs is Fixed Parameter TractablePetr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos. 931-950 [doi]
- A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundaryJulien Baste, Ignasi Sau, Dimitrios M. Thilikos. 951-970 [doi]
- k) TimeJason Li, Jesper Nederlof. 971-989 [doi]
- k-CutKen-ichi Kawarabayashi, Bingkai Lin. 990-999 [doi]
- k-connected subgraphsZeev Nutov. 1000-1009 [doi]
- 2-Approximating Feedback Vertex Set in TournamentsDaniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Fahad Panolan, Geevarghese Philip, Saket Saurabh 0001. 1010-1018 [doi]
- Fast LP-based Approximations for Geometric Packing and Covering ProblemsChandra Chekuri, Sariel Har-Peled, Kent Quanrud. 1019-1038 [doi]
- Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Other Directed Network Design ProblemsRohan Ghuge, Viswanath Nagarajan. 1039-1048 [doi]
- Lossless Prioritized EmbeddingsMichael Elkin, Ofer Neiman. 1049-1062 [doi]
- Labelings vs. Embeddings: On Distributed Representations of DistancesArnold Filtser, Lee-Ad Gottlieb, Robert Krauthgamer. 1063-1075 [doi]
- Round Complexity of Common Randomness Generation: The Amortized SettingNoah Golowich, Madhu Sudan. 1076-1095 [doi]
- The Power of Distributed Verifiers in Interactive ProofsMoni Naor, Merav Parter, Eylon Yogev. 1096-115 [doi]
- Lower Bounds for Oblivious Near-Neighbor SearchKasper Green Larsen, Tal Malkin, Omri Weinstein, Kevin Yeo. 1116-1134 [doi]
- The Combinatorics of the Longest-Chain Rule: Linear Consistency for Proof-of-Stake BlockchainsErica Blum, Aggelos Kiayias, Cristopher Moore, Saad Quader, Alexander Russell. 1135-1154 [doi]
- A New Lower Bound on Hadwiger-Debrunner Numbers in the PlaneChaya Keller, Shakhar Smorodinsky. 1155-1169 [doi]
- Navigating an Infinite Space with Unreliable MovementsAnders Martinsson, Jara Uitto. 1170-1179 [doi]
- Linear rankwidth meets stabilityJaroslav Nesetril, Roman Rabinovich, Patrice Ossona de Mendez, Sebastian Siebertz. 1180-1199 [doi]
- Edge Expansion and Spectral Gap of Nonnegative MatricesJenish C. Mehta, Leonard J. Schulman. 1200-1213 [doi]
- Combinatorial generation via permutation languagesElizabeth Hartung, Hung Phuc Hoang, Torsten Mütze, Aaron Williams. 1214-1225 [doi]
- X-Ramanujan graphsSidhanth Mohanty, Ryan O'Donnell. 1226-1243 [doi]
- Faster Deterministic Distributed Coloring Through Recursive List ColoringFabian Kuhn. 1244-1259 [doi]
- Faster Algorithms for Edge Connectivity via Random 2-Out ContractionsMohsen Ghaffari, Krzysztof Nowicki 0002, Mikkel Thorup. 1260-1279 [doi]
- Shortest Paths in a Hybrid Network ModelJohn Augustine, Kristian Hinnenthal, Fabian Kuhn, Christian Scheideler, Philipp Schneider. 1280-1299 [doi]
- Parallel Batch-Dynamic Graphs: Algorithms and Lower BoundsLaxman Dhulipala, David Durfee, Janardhan Kulkarni, Richard Peng, Saurabh Sawlani, Xiaorui Sun. 1300-1319 [doi]
- Finding a Bounded-Degree Expander Inside a Dense OneLuca Becchetti, Andrea E. F. Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan. 1320-1336 [doi]
- On Decoding Cohen-Haeupler-Schulman Tree CodesAnand Kumar Narayanan, Matthew Weidner. 1337-1356 [doi]
- On the Performance of Reed-Muller Codes with respect to Random Errors and ErasuresOri Sberlo, Amir Shpilka. 1357-1376 [doi]
- On the Power of Relaxed Local Decoding AlgorithmsTom Gur, Oded Lachish. 1377-1394 [doi]
- Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query ComplexityAlessandro Chiesa, Tom Gur, Igor Shinkar. 1395-1411 [doi]
- List Decoding of Direct Sum CodesVedat Levi Alev, Fernando Granha Jeronimo, Dylan Quintana, Shashank Srivastava, Madhur Tulsiani. 1412-1425 [doi]
- G-colourable graphsMarcin Wrochna, Stanislav Zivny. 1426-1435 [doi]
- Ultimate greedy approximation of independent sets in subcubic graphsPiotr Krysta, Mathieu Mari, Nan Zhi. 1436-1455 [doi]
- Counting independent sets in unbalanced bipartite graphsSarah Cannon, Will Perkins. 1456-1466 [doi]
- k-cliques in low-arboricity graphsTalya Eden, Dana Ron, C. Seshadhri. 1467-1478 [doi]
- Improved Inapproximability of Rainbow ColoringPer Austrin, Amey Bhangale, Aditya Potukuchi. 1479-1495 [doi]
- Chasing Nested Convex Bodies Nearly OptimallySébastien Bubeck, Bo'az Klartag, Yin Tat Lee, Yuanzhi Li, Mark Sellke. 1496-1508 [doi]
- Chasing Convex Bodies OptimallyMark Sellke. 1509-1518 [doi]
- Chasing Convex Bodies with Linear Competitive RatioC. J. Argue, Anupam Gupta, Guru Guruganesh, Ziye Tang. 1519-1524 [doi]
- The Online Submodular Cover ProblemAnupam Gupta, Roie Levin. 1525-1537 [doi]
- Online Probabilistic Metric Embedding: A General Framework for Bypassing Inherent BoundsYair Bartal, Nova Fandina, Seeun William Umboh. 1538-1557 [doi]
- Achieving Optimal Backlog in the Vanilla Multi-Processor Cup GameWilliam Kuszmaul. 1558-1577 [doi]
- Fine-grained complexity of graph homomorphism problem for bounded-treewidth graphsKarolina Okrasa, Pawel Rzazewski. 1578-1590 [doi]
- Reducing approximate Longest Common Subsequence to approximate Edit DistanceAviad Rubinstein, Zhao Song. 1591-1600 [doi]
- Improved Algorithms for Edit Distance and LCS: Beyond Worst CaseMahdi Boroujeni, Masoud Seddighin, Saeed Seddighin. 1601-1620 [doi]
- Hyperbolic intersection graphs and (quasi)-polynomial timeSándor Kisfaludi-Bak. 1621-1638 [doi]
- Adaptive Shivers Sort: An Alternative Sorting AlgorithmVincent Jugé. 1639-1654 [doi]
- Tight Bounds for the Subspace Sketch Problem with ApplicationsYi Li, Ruosong Wang, David P. Woodruff. 1655-1674 [doi]
- Composable Core-sets for Determinant Maximization Problems via Spectral SpannersPiotr Indyk, Sepideh Mahabadi, Shayan Oveis Gharan, Alireza Rezaei. 1675-1694 [doi]
- α, β) Spanners and HopsetsUri Ben-Levy, Merav Parter. 1695-1714 [doi]
- The Communication Complexity of Set Intersection and Multiple Equality TestingDawei Huang, Seth Pettie, Yixiang Zhang, Zhijun Zhang. 1715-1732 [doi]
- The Communication Complexity of OptimizationSantosh S. Vempala, Ruosong Wang, David P. Woodruff. 1733-1752 [doi]
- Space Efficient Approximation to Maximum Matching Size from Uniform Edge SamplesMichael Kapralov, Slobodan Mitrovic, Ashkan Norouzi-Fard, Jakab Tardos. 1753-1772 [doi]
- Approximate Maximum Matching in Random StreamsAlireza Farhadi 0001, Mohammad Taghi Hajiaghayi, Tung Mai, Anup Rao, Ryan A. Rossi. 1773-1785 [doi]
- Vertex Ordering Problems in Directed Graph StreamsAmit Chakrabarti, Prantar Ghosh, Andrew McGregor 0001, Sofya Vorotnikova. 1786-1802 [doi]
- Faster Update Time for Turnstile Streaming AlgorithmsJosh Alman, Huacheng Yu. 1803-1813 [doi]
- Fast and Space Efficient Spectral Sparsification in Dynamic StreamsMichael Kapralov, Aida Mousavifar, Cameron Musco, Christopher Musco, Navid Nouri, Aaron Sidford, Jakab Tardos. 1814-1833 [doi]
- Near-Optimal Bounds for Online Caching with Machine Learned AdviceDhruv Rohatgi. 1834-1845 [doi]
- Interleaved Caching with Access GraphsRavi Kumar 0001, Manish Purohit, Zoya Svitkina, Erik Vee. 1846-1858 [doi]
- Online Scheduling via Learned WeightsSilvio Lattanzi, Thomas Lavastida, Benjamin Moseley, Sergei Vassilvitskii. 1859-1877 [doi]
- Competitive Online Search Trees on TreesProsenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman. 1878-1891 [doi]
- Quantifying the Burden of Exploration and the Unfairness of Free RidingChristopher Jung, Sampath Kannan, Neil Lutz. 1892-1904 [doi]
- H-minor free graphs and graphs of bounded (distance) VC-dimensionGuillaume Ducoffe , Michel Habib, Laurent Viennot. 1905-1922 [doi]
- A Strongly Polynomial Algorithm for Finding a Shortest Non-zero Path in Group-Labeled GraphsYutaro Yamaguchi 0001. 1923-1932 [doi]
- T-PathsSatoru Iwata 0001, Yu Yokoi. 1933-1944 [doi]
- 1 embeddings of planar graphsArnold Filtser. 1945-1954 [doi]
- Multi-transversals for Triangles and the Tuza's ConjectureParinya Chalermsook, Samir Khuller, Pattara Sukprasert, Sumedha Uniyal. 1955-1974 [doi]
- d-DimensionsHadley Black, Deeparnab Chakrabarty, C. Seshadhri. 1975-1994 [doi]
- Approximating the Distance to Monotonicity of Boolean FunctionsRamesh Krishnan S. Pallavoor, Sofya Raskhodnikova, Erik Waingarten. 1995-2009 [doi]
- Reconstruction under outliers for Fourier-sparse functionsXue Chen, Anindya De. 2010-2029 [doi]
- Testing convexity of functions over finite domainsAleksandrs Belovs, Eric Blais, Abhinav Bommireddi. 2030-2045 [doi]
- Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut AlgorithmsSebastian Forster, Danupon Nanongkai, Liu Yang, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai. 2046-2065 [doi]
- The Two-Sided Game of Googol and Sample-Based Prophet InequalitiesJosé R. Correa, Andrés Cristi, Boris Epstein, José A. Soto. 2066-2081 [doi]
- Competitive Analysis with a Sample and the Secretary ProblemHaim Kaplan, David Naori, Danny Raz. 2082-2095 [doi]
- A Truthful Cardinal Mechanism for One-Sided MatchingRediet Abebe, Richard Cole 0001, Vasilis Gkatzelis, Jason D. Hartline. 2096-2113 [doi]
- Cake Cutting on Graphs: A Discrete and Bounded Proportional ProtocolXiaohui Bei, Xiaoming Sun, Hao Wu, Jialin Zhang, Zhijie Zhang, Wei Zi. 2114-2123 [doi]
- Instance-Optimality in the Noisy Value-and Comparison-ModelVincent Cohen-Addad, Frederik Mallmann-Trenn, Claire Mathieu. 2124-2143 [doi]
- Reconstruction of Depth-4 Multilinear CircuitsVishwas Bhargava, Shubhangi Saraf, Ilya Volkovich. 2144-2160 [doi]
- Counting and Finding Homomorphisms is Universal for Parameterized Complexity TheoryMarc Roth, Philip Wellnitz. 2161-2180 [doi]
- Parameterized Complexity and Approximability of Directed Odd Cycle TransversalDaniel Lokshtanov, M. S. Ramanujan, Saket Saurabh 0001, Meirav Zehavi. 2181-2200 [doi]
- Approximately counting and sampling small witnesses using a colourful decision oracleHolger Dell, John Lapinskas, Kitty Meeks. 2201-2211 [doi]
- Improved bounds for centered coloringsMichal Debski, Stefan Felsner, Piotr Micek, Felix Schröder. 2212-2226 [doi]
- Baker game and polynomial-time approximation schemesZdenek Dvorák. 2227-2240 [doi]
- Approximation Schemes for Capacitated Clustering in Doubling MetricsVincent Cohen-Addad. 2241-2259 [doi]
- H-free graphsMaria Chudnovsky, Marcin Pilipczuk, Michal Pilipczuk, Stéphan Thomassé. 2260-2278 [doi]
- A PTAS for subset TSP in minor-free graphsHung Le. 2279-2298 [doi]
- Approximation Schemes via Width/Weight Trade-offs on Minor-free GraphsFedor V. Fomin, Daniel Lokshtanov, Saket Saurabh 0001, Meirav Zehavi. 2299-2318 [doi]
- Efficiently list-edge coloring multigraphs asymptotically optimallyFotis Iliopoulos, Alistair Sinclair. 2319-2336 [doi]
- Linear Size Sparsifier and the Geometry of the Operator Norm BallVictor Reis, Thomas Rothvoss. 2337-2348 [doi]
- Small Memory Robust Simulation of Client-Server Interactive Protocols over Oblivious Noisy ChannelsT.-H. Hubert Chan, Zhibin Liang, Antigoni Polychroniadou, Elaine Shi. 2349-2365 [doi]
- Finding Perfect Matchings in Dense HypergraphsJie Han, Peter Keevash. 2366-2377 [doi]
- Worst-Case Polylog Incremental SPQR-trees: Embeddings, Planarity, and TriconnectivityJacob Holm, Eva Rotenberg. 2378-2397 [doi]
- Dominantly Truthful Multi-task Peer Prediction with a Constant Number of TasksYuqing Kong. 2398-2411 [doi]
- Selling Information Through ConsultingYiling Chen, Haifeng Xu, Shuran Zheng. 2412-2431 [doi]
- Algorithmic Price DiscriminationRachel Cummings, Nikhil R. Devanur, Zhiyi Huang 0002, Xiangning Wang. 2432-2451 [doi]
- Bulow-Klemperer-Style Results for Welfare Maximization in Two-Sided MarketsMoshe Babaioff, Kira Goldner, Yannai A. Gonczarowski. 2452-2471 [doi]
- Inference from Auction PricesJason D. Hartline, Aleck C. Johnsen, Denis Nekipelov, Zihe Wang. 2472-2491 [doi]
- ϵ Update TimeSoheil Behnezhad, Jakub Lacki, Vahab S. Mirrokni. 2492-2508 [doi]
- An Improved Algorithm for Incremental Cycle Detection and Topological Ordering in Sparse GraphsSayan Bhattacharya, Janardhan Kulkarni. 2509-2521 [doi]
- Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and SimplerMaximilian Probst Gutenberg, Christian Wulff-Nilsen. 2522-2541 [doi]
- Decremental SSSP in Weighted Digraphs: Faster and Against an Adaptive AdversaryMaximilian Probst Gutenberg, Christian Wulff-Nilsen. 2542-2561 [doi]
- Fully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space BoundsMaximilian Probst Gutenberg, Christian Wulff-Nilsen. 2562-2574 [doi]
- On the Cover of the Rolling StoneAdrian Dumitrescu, Csaba D. Tóth. 2575-2586 [doi]
- Computing Minimal Persistent Cycles: Polynomial and Hard CasesTamal K. Dey, Tao Hou, Sayan Mandal. 2587-2606 [doi]
- The Impacts of Dimensionality, Diffusion, and Directedness on Intrinsic Universality in the abstract Tile Assembly ModelDaniel Hader, Aaron Koch, Matthew J. Patitz, Michael Sharp. 2607-2624 [doi]
- Hierarchical Shape Construction and Complexity for Slidable Polyominoes under Uniform External ForcesJose Balanza-Martinez, Timothy Gomez, David Caballero, Austin Luchsinger, Angel A. Cantu, Rene Reyes, Mauricio Flores, Robert T. Schweller, Tim Wylie. 2625-2641 [doi]
- Even maps, the Colin de Verdière number and representations of graphsVojtech Kaluza, Martin Tancer. 2642-2657 [doi]
- A Little Charity Guarantees Almost Envy-FreenessBhaskar Ray Chaudhury, Telikepalli Kavitha, Kurt Mehlhorn, Alkmini Sgouritsa. 2658-2672 [doi]
- Approximating Nash Social Welfare under Submodular Valuations through (Un)MatchingsJugal Garg, Pooja Kulkarni, Rucha Kulkarni. 2673-2687 [doi]
- The Complexity of ContractsPaul Dütting, Tim Roughgarden, Inbal Talgam-Cohen. 2688-2707 [doi]
- On the Tractability of Public Persuasion with No ExternalitiesHaifeng Xu. 2708-2727 [doi]
- Complexity and Parametric Computation of Equilibria in Atomic Splittable Congestion Games via Weighted Block LaplaciansMax Klimm, Philipp Warode. 2728-2747 [doi]
- A Tale of Santa Claus, Hypergraphs and MatroidsSami Davies, Thomas Rothvoss, Yihao Zhang. 2748-2757 [doi]
- Parallel Machine Scheduling to Minimize Energy ConsumptionAntonios Antoniadis, Naveen Garg, Gunjan Kumar, Nikhil Kumar. 2758-2769 [doi]
- Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication ConstraintsJanardhan Kulkarni, Shi Li, Jakub Tarnawski, Minwei Ye. 2770-2789 [doi]
- Weighted Completion Time Minimization for Unrelated Machines via Iterative Fair Contention ResolutionSungjin Im, Maryam Shadloo. 2790-2809 [doi]
- How to aggregate Top-lists: Approximation algorithms via scores and average ranksClaire Mathieu, Simon Mauras. 2810-2822 [doi]
- Connectivity of Triangulation Flip Graphs in the Plane (Part I: Edge Flips)Uli Wagner 0001, Emo Welzl. 2823-2841 [doi]
- k Nearest Neighbors Queries under General Distance FunctionsChih-Hung Liu. 2842-2859 [doi]
- Computing Circle Packing Representations of Planar GraphsSally Dong, Yin Tat Lee, Kent Quanrud. 2860-2875 [doi]
- Atomic Embeddability, Clustered Planarity, and ThickenabilityRadoslav Fulek, Csaba D. Tóth. 2876-2895 [doi]
- The stable set problem in graphs with bounded genus and bounded odd cycle packing numberMichele Conforti, Samuel Fiorini, Tony Huynh, Gwenaël Joret, Stefan Weltge. 2896-2915 [doi]
- Nearly optimal edge estimation with independent set queriesXi Chen 0001, Amit Levi, Erik Waingarten. 2916-2935 [doi]
- A Lower Bound on Cycle-Finding in Sparse DigraphsXi Chen, Tim Randolph, Rocco A. Servedio, Timothy Sun. 2936-2952 [doi]
- Robust Clustering Oracle and Local Reconstructor of Cluster Structure of GraphsPan Peng. 2953-2972 [doi]
- k-nearest neighbor graphArtur Czumaj, Christian Sohler. 2973-2992 [doi]
- Improved Local Computation Algorithm for Set Cover via SparsificationChristoph Grunau, Slobodan Mitrovic, Ronitt Rubinfeld, Ali Vakilian. 2993-3011 [doi]