M. Yannakakis and C. H. Papadimitriou, Scheduling interval-ordered tasks, SIAM J. Comput, vol.8, pp.405-409, 1979.

P. C. Fishburn, Intransitive indifference in preference theory: a survey, per. Res, vol.18, pp.207-228, 1970.

E. L. Lawler, J. Valdes, and R. E. Tarjan, The recognition of series parallel digraphs, SIAM J. Comput, vol.11, issue.2, pp.298-313, 1982.

E. L. Lawler, Sequencing jobs to minimize total weighted completion time subject to precedence constraints, Annals of Discrete Math, vol.2, pp.75-90, 1978.
DOI : 10.1016/s0167-5060(08)70323-6

R. Shamir and M. C. Golumbic, Complexity and algorithms for reasoning about time: a graphtheoretic approach, JACM, vol.40, pp.1108-1133, 1993.

R. Shamir, M. C. Golumbic, and H. Kaplan, On the complexity of dna physical mapping, Adv. Appl. Math, vol.15, pp.251-261, 1994.

R. Shamir, M. C. Golumbic, and H. Kaplan, Graph sandwich problems, Journal of Algorithms, vol.19, pp.449-473, 1995.

Y. Zalcstein and P. B. Henderson, A graph-theoretic characterization of the pv chunk class of synchronizing primitives, SIAM J. Comput, vol.6, pp.88-108, 1977.

J. D. Rose, A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations, Graph Theory and Computing, pp.183-217, 1972.