Combinatorial properties of directed graphs useful in computing network reliability. - A. Satyanarayana; Jane N. Hagstrom (Networks, 1981)

Note on independence of arcs in antiparallel for network flow problems. - Jane N. Hagstrom (Networks, 1984)

Computational complexity of PERT problems. - Jane N. Hagstrom (Networks, 1988)

Directed network reliability: Domination and computing coefficients of the success-marginal expansion. - Jane Nichols Hagstrom (Networks, 1990)

Computing the probability distribution of project duration in a PERT network. - Jane N. Hagstrom (Networks, 1990)

Computing rooted communication reliability in an almost acyclic digraph. - Jane N. Hagstrom (Networks, 1991)

Maximum likelihood genetic sequence reconstruction from oligo content. - Jane N. Hagstrom; Ray Hagstrom; Ross A. Overbeek; Morgan Price; Linus Schrage (Networks, 1994)

Threshold reliability of networks with small failure sets. - Michael O. Ball; Jane N. Hagstrom; J. Scott Provan (Networks, 1995)

Two-path Subsets: Efficient Counting and Applications to Performability Analysis. - Michael O. Ball; Jane N. Hagstrom; J. Scott Provan (Discret. Appl. Math., 1998)