


default search action
ACM 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 - 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

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.