default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Algorithms, Volume 21
Volume 21, Number 1, January 2025
- Evan Sala
, Joe Sawada, Abbas Alhakim:
Efficient Constructions of the Prefer-Same and Prefer-Opposite de Bruijn Sequences. 1:1-1:33 - Shi Li, Bundit Laekhanukit:
Polynomial Integrality Gap of Flow LP for Directed Steiner Tree. 2:1-2:9 - David G. Harris, Vladimir Kolmogorov:
Parameter Estimation for Gibbs Distributions. 3:1-3:39 - Arnold Filtser:
A Face Cover Perspective to ℓ1 Embeddings of Planar Graphs. 4:1-4:21 - Sujoy Bhore, Csaba D. Tóth:
Online Euclidean Spanners. 5:1-5:22 - Ken-ichi Kawarabayashi, Bojan Mohar, Roman Nedela, Peter Zeman:
Automorphisms and Isomorphisms of Maps in Linear Time. 6:1-6:32 - Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling. 7:1-7:58 - Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný:
Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations. 8:1-8:29 - Harold N. Gabow:
Maximum Cardinality f-Matching in Time O(n2/3m). 9:1-9:28 - N. S. Narayanaswamy, S. M. Dhannya:
Perfect Resolution of Strong Conflict-Free Colouring of Interval Hypergraphs. 10:1-10:21 - Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam:
Fully Dynamic Submodular Maximization over Matroids. 11:1-11:23 - Gonzalo Navarro:
Computing MEMs and Relatives on Repetitive Text Collections. 12:1-12:33 - Jean Cardinal, Arturo Merino, Torsten Mütze:
Combinatorial Generation via Permutation Languages. IV. Elimination Trees. 13:1-13:41
Volume 21, Number 2, April 2025
- Tatsuya Terao:
Faster Matroid Partition Algorithms. 14:1-14:26 - Gerth Stølting Brodal, George Lagogiannis, Robert E. Tarjan:
Strict Fibonacci Heaps. 15:1-15:18 - Akanksha Agrawal, Paloma T. Lima, Daniel Lokshtanov, Pawel Rzazewski, Saket Saurabh, Roohani Sharma:
Odd Cycle Transversal on P5-free Graphs in Polynomial Time. 16:1-16:14 - Marek Chrobak, Neal E. Young:
Classification via Two-Way Comparisons. 17:1-17:19 - Lucas Boczkowski, Uriel Feige, Amos Korman, Yoav Rodeh:
The Query Complexity of Searching Trees with Permanently Noisy Advice. 18:1-18:30 - Pankaj K. Agarwal, Boris Aronov, Tzvika Geft, Dan Halperin:
On Two-Handed Planar Assembly Partitioning with Connectivity Constraints. 19:1-19:31 - Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
Rerouting Planar Curves and Disjoint Paths. 20:1-20:37 - Diptarka Chakraborty, Keerti Choudhary:
New Extremal Bounds for Reachability and Strong-Connectivity Preservers under Failures. 21:1-21:17 - Telikepalli Kavitha, Kazuhisa Makino, Ildikó Schlotter, Yu Yokoi:
Popular Arborescences and Their Matroid Generalization. 22:1-22:35 - Justin Dallant, John Iacono:
Conditional Lower Bounds for Dynamic Geometric Measure Problems. 23:1-23:35 - Nikhil Ayyadevara, Rajni Dabas, Arindam Khan, K. V. N. Sreenivas:
Near-optimal Algorithms for Stochastic Online Bin Packing. 24:1-24:39
Volume 21, Number 3, July 2025
- Pankaj K. Agarwal, Boris Aronov, Esther Ezra, Matthew J. Katz, Micha Sharir:
Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems. 25:1-25:59 - Victor A. Campos, Jonas Costa Ferreira da Silva, Raul Lopes, Ignasi Sau:
New Menger-Like Dualities in Digraphs and Applications to Half-Integral Linkages. 26:1-26:28 - Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz:
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs - Part I: Algorithmic Results. 27:1-27:45 - Arindam Khan, Aditya Lonkar, Arnab Maiti, Amatya Sharma, Andreas Wiese:
Tight Approximation Algorithms for 2D Guillotine Strip Packing. 28:1-28:30
- Alina Ene, Troy Lee, Piotr Micek, Sushant Sachdeva:
Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2021 Special Issue. 29:1-29:2 - Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha:
Polynomial-time Trace Reconstruction in the Smoothed Complexity Model. 30:1-30:28 - Arun Jambulapati, Aaron Sidford:
Ultrasparse Ultrasparsifiers and Faster Laplacian System Solvers. 31:1-31:49 - Per Austrin, Jonah Brown-Cohen, Johan Håstad:
Optimal Inapproximability with Universal Factor Graphs. 32:1-32:39 - Stefan Walzer:
Peeling Close to the Orientability Threshold Spatial Coupling in Hashing-Based Data Structures. 33:1-33:23
Volume 21, Number 4, October 2025
- Nikhil Bansal, Eun Jung Kim, Viswanath Nagarajan, Aaron Potechin, Lars Rohwedder:
Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2023 Special Issue. 34:1-34:2 - Anthony Leverrier, Gilles Zémor:
Efficient Decoding up to a Constant Fraction of the Code Length for Asymptotically Good Quantum Codes. 35:1-35:34 - Sepehr Assadi, Martín Farach-Colton, William Kuszmaul:
Tight Bounds for Monotone Minimal Perfect Hashing. 36:1-36:23 - Corwin Sinnamon, Robert E. Tarjan:
Efficiency of Self-Adjusting Heaps. 37:1-37:39 - Michael A. Bender, Alexander Conway, Martín Farach-Colton, William Kuszmaul, Guido Tagliavini:
Tiny Pointers. 38:1-38:43 - David P. Woodruff, Taisuke Yasuda:
Online Lewis Weight Sampling. 39:1-39:50 - Tatiana Belova, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Denil Sharipov:
Polynomial Formulations as a Barrier for Reduction-Based Hardness Proofs. 40:1-40:44 - Guillaume Chapuy, Guillem Perarnau:
Short Synchronizing Words for Random Automata. 41:1-41:55 - Salwa Faour, Mohsen Ghaffari, Christoph Grunau, Fabian Kuhn, Václav Rozhon:
Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond. 42:1-42:48
- Michael A. Bender, Abhishek Bhattacharjee, Alexander Conway, Martin Farach-Colton, Rob Johnson, Sudarsun Kannan, William Kuszmaul, Nirjhar Mukherjee, Donald E. Porter, Guido Tagliavini, Janet Vorobyeva, Evan West:
Paging and the Address-Translation Problem. 43:1-43:22 - Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström:
Almost Consistent Systems of Linear Equations. 44:1-44:55 - Zachary Friggstad, Ramin Mousavi:
A \(\boldsymbol{O}(\textbf{log}\,\boldsymbol{k})\)-Approximation for Directed Steiner Tree in Planar Graphs. 45:1-45:14 - Vladimir Kolmogorov:
A Simpler and Parallelizable \(\boldsymbol{O(\sqrt{\log n})}\)-Approximation Algorithm for Sparsest Cut. 46:1-46:22 - Andreas Emil Feldmann, Michael Lampis:
Parameterized Algorithms for Steiner Forest in Bounded Width Graphs. 47:1-47:26 - Hugo A. Akitaya, Ahmad Biniaz, Erik D. Demaine, Linda Kleist, Frederick Stock, Csaba D. Tóth:
Minimum Plane Bichromatic Spanning Trees. 48:1-48:14
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-05 22:25 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
