1. The transitive reduction of a directed graph;Aho;SIAM Journal on Computing,1972
2. A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times;Allahverdi;European Journal of Operational Research,2006
3. Single machine precedence constrained scheduling is a vertex cover problem;Ambühl;Algorithmica,2009
4. Approximating precedence-constrained single machine scheduling by coloring;Ambühl,2006
5. Andreev, G.V., Sotskov, Y.N., Werner, F., 2000. A branch and bound method for mixed graph coloring and scheduling. In: Proceedings of the 16th International Conference on CAD/CAM Robotics & Factories of the Future, Trinidad and Tobago, pp. 1–8.