An Algorithm for Finding a Minimal Equivalent Graph of a Digraph

Approximating the minimum equivalent digraph

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms

Approximating the minimum strongly connected subgraph via a matching lower bound

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms

On Scheduling Complex Dags for Internet-Based Computing

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01

Toward a Theory for Scheduling Dags in Internet-Based Computing

IEEE Transactions on Computers

Advances in IC-Scheduling Theory: Scheduling Expansive and Reductive Dags and Scheduling Dags via Duality

IEEE Transactions on Parallel and Distributed Systems

The minimum spanning strong subdigraph problem is fixed parameter tractable

Discrete Applied Mathematics

Scheduling as a graph transformation

IBM Journal of Research and Development

Extending IC-scheduling via the Sweep Algorithm

Journal of Parallel and Distributed Computing

A pebble game for internet-based computing

Theoretical Computer Science