Paul Erdos -> Charles J. Colbourn -> Michael O. Ball -> Jayant R. Haritsa
Clark, B.N., Colbourn, C.J. and Erdos, P.,
"A Conjecture on Dominating Cycles",
Proc. of the 16th Southeastern Conference
on Combinatorics, Graph Theory, and Computing, pp. 189-198 (February 1985).
Ramesh, A., Ball, M.O, and Colbourn C.J.,
"Bounds for all-terminal reliability in planar networks",
Annals of Discrete Mathematics 33 (1987), 261-273.
Haritsa, J.R., Ball, M.O., Roussopoulos, N., Datta, A., Baras, J.S.,
"MANDATE: MAnaging Networks Using DAtabase TEchnology",
IEEE Journal on Selected Areas in Communications 11(9): 1360-1372 (1993)
A longer length-4 connection is:
Paul Erdos -> Shlomo Moran -> Louis E. Rosier -> Sanjoy K. Baruah -> Jayant R. Haritsa
89k:68077 Erdos, P.; Koren, I.; Moran, S.; Silberman, G. M.; Zaks, S.
Minimum-diameter cyclic arrangements in mapping data-flow graphs onto VLSI
arrays. Math. Systems Theory 21 (1988), no. 2, 85--98.
85c:68063 Ibarra, Oscar H.; Moran, Shlomo; Rosier, Louis E. On the
control power of integer division. Theoret. Comput. Sci. 24 (1983), no. 1,
35--52.
94e:68031 Baruah, Sanjoy K.; Howell, Rodney R.; Rosier, Louis E.
Feasibility problems for recurring tasks on one processor. 15th
International Symposium on Mathematical Foundations of Computer Science
(MFCS '90) (Bansk Bystrica, 1990). Theoret. Comput. Sci. 118 (1993), no.
1, 3--20.
2002h:90017 Baruah, Sanjoy; Haritsa, Jayant; Sharma, Nitin On-line
scheduling to maximize task completions. J. Combin. Math. Combin.
Comput. 39 (2001), 65--78. 90B35