ACM Transactions on Algorithms

10 papers10 directions
ACM Transactions on Algorithms is a research venue focused on the design and analysis of algorithms, with a publication history extending from 2007 to 2025. Within the fields of machine learning and artificial intelligence, the journal provides a foundation for theoretical research into optimization and decision-making. Its contributions often center on online scheduling and resource allocation, particularly in environments characterized by uncertainty or adversarial conditions. The venue publishes research on topics such as hierarchical scheduling for distributed task orchestration, online throughput maximization, and the intersection of continuous dynamics with discrete optimization. Specific areas of inquiry include the development of algorithms for unrelated machines and the analysis of slack and commitment in scheduling. These works frequently address the mathematical bounds and optimality of various algorithmic approaches, such as greedy algorithms in assignment problems and checkpointing strategies. Research in this venue also explores graph theory and reconfiguration problems, including studies on sparse induced subgraphs and gap amplification. Prolific contributors include researchers such as Marcin Pilipczuk, Maria Chudnovsky, and Kevin Schewior. By focusing on the formal properties of algorithms, the journal supports the development of robust computational methods applicable to complex AI systems and resource management tasks.

Papers by Year

2025 2
2022 1
2020 1
2019 1
2018 2
2014 1
2012 1
2011 1
2007 2

Top Research Directions

Research directions most represented by papers from this venue.

Structural Parameterization via Treedepth Modulators 1
Weighted Throughput Maximization for Heterogeneous Tasks 1
Online Scheduling with Processing Slack and Commitments 1
Selectivity Driven Query and Predicate Reordering 1
Slack-Based Scheduling for Deadline-Constrained Workloads 1
Randomization vs Determinism in Online Competitive Analysis 1
Dynamic Programming on Tree Decompositions 1
Mitigating Resource Lockup in Non-Preemptive Online Scheduling 1
Extending Structural Graph Properties to Broader Graph Classes 1
Algorithmic Scheduling on Unrelated and Heterogeneous Machines 1

Top Authors

AuthorPapers
Aravind Srinivasan1
Rose McCarty1

Impactful Papers

Papers from this venue that shaped research clusters.

Influential

Papers

TitleYear
Gap Amplification for Reconfiguration Problems2025
Sparse Induced Subgraphs in P 6 -free Graphs2025
Online Throughput Maximization on Unrelated Machines: Commitment is No Burden2022
Tight Bounds on Online Checkpointing Algorithms2020
地形保護のための正確なアルゴリズム【JST・京大機械翻訳】2018
Editorial2014
Iterative Expansion and Color Coding2012
The optimality of the online greedy algorithm in carpool and chairman assignment problems2011
Entropy-based bounds for online algorithms2007
Querying priced information in databases2007