1. The transitive reduction of a directed graph;Aho;SIAM J. Comput.,1972
2. On economical construction of the transitive closure of an oriented graph;Arlazarov;Dokl. Akad. Nauk SSSR,1970
3. Extremal Graph Theory;Bollobàs,1978
4. Complexité de problèmes liés aux graphes sans circuits;Bordat;Informatique Théorique et Applications,1987
5. Matrix multiplication via arithmetic progressions;Coppersmith;Proc. 19th Ann. Symp. on the Theory of Computation,1987