ACM Transactions on Algorithms 2025

2 papers

Top Research Directions

The 3 research directions with ACM Transactions on Algorithms 2025 papers, ranked by paper count, next to 2022. Share is the fraction of the edition’s papers in the direction.

#Direction20252022Share 2025Share 20222022 rank
1Dynamic Programming on Tree Decompositions1050.0%0.0%—
2Extending Structural Graph Properties to Broader Graph Classes1050.0%0.0%—
3Structural Parameterization via Treedepth Modulators1050.0%0.0%—

Download all directions as CSV

Institutions

Institutions credited by ACM Transactions on Algorithms 2025 papers: a paper credits every institution named in its affiliations, once. 6 institutions share 2 credited papers.

#InstitutionPapersShare20222022 rank
1CyberAgent (Japan) 150.0%0—
2Institute of Informatics of the Slovak Academy of Sciences 150.0%0—
3IT University of Copenhagen 150.0%0—
4Princeton University 150.0%0—
5University of Warsaw 150.0%0—
6Warsaw University of Technology 150.0%0—

Download all institutions as CSV

About this data

Papers. ACM Transactions on Algorithms 2025 lists 2 papers on Lacuna, duplicate versions counted once; rejected and withdrawn submissions are left out.

Directions. Directions are Lacuna’s clustering of the concept elements extracted from each paper, so a paper can belong to several and direction counts add up to more than the paper count. A direction’s share is its papers divided by the edition’s papers. Comparisons with 2022 use shares, since the edition went from 1 to 2 papers.

Institutions. A paper credits each institution named in its affiliations, resolved to a ROR record, once. 2 of 2 papers (100.0%) credit at least one institution and are the base for institution shares; the rest have no resolved affiliation yet.

Data. Counts come from Lacuna’s data build of 2026-11-17 and change as papers are added. Tables as CSV: directions · institutions. Cite as: Lacuna, “ACM Transactions on Algorithms 2025”, https://lacuna.tiptreesystems.com/venue/acm-transactions-on-algorithms/2025.

Top Authors

AuthorPapers
Rose McCarty1

Papers

Title
Gap Amplification for Reconfiguration Problems
Sparse Induced Subgraphs in P 6 -free Graphs