An O(|E|) Time Algorithm for Computing the Reliability of a Class of Directed Networks. - Avinash Agrawal; Appajosyula Satyanarayana (Oper. Res., 1984)

Network reliability analysis using 2-connected digraph reductions. - Avinash Agrawal; Appajosyula Satyanarayana (Networks, 1985)

A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks. - Appajosyula Satyanarayana; R. Kevin Wood (SIAM J. Comput., 1985)

Network Reliability and Inner-Four-Cycle-Free Graphs. - Themistocles Politof; Appajosyula Satyanarayana (Math. Oper. Res., 1986)

Chromatic polynomials and network reliability. - Appajosyula Satyanarayana; Ralph Tindell (Discret. Math., 1987)

On Residual Connectedness Network Reliability. - Francis T. Boesch; Appajosyula Satyanarayana; Charles L. Suffel (Reliability Of Computer And Communication Networks, 1989)

A characterization of partial 3-trees. - Appajosyula Satyanarayana; L. Tung (Networks, 1990)

Least reliable networks and the reliability domination. - Francis T. Boesch; Appajosyula Satyanarayana; Charles L. Suffel (IEEE Trans. Commun., 1990)

The Complexity of the Residual Node Connectedness Reliability Problem. - Klaus Sutner; Appajosyula Satyanarayana; Charles L. Suffel (SIAM J. Comput., 1991)

A reliability-improving graph transformation with applications to network reliability. - Appajosyula Satyanarayana; L. Schoppmann; Charles L. Suffel (Networks, 1992)

Computing Residual Connectedness Reliability for Restricted Networks. - Charles J. Colbourn; Appajosyula Satyanarayana; Charles L. Suffel; Klaus Sutner (Discret. Appl. Math., 1993)

A generalized chromatic polynomial, acyclic orientations with prescribed sources and sinks, and network reliability. - José Rodríguez; Appajosyula Satyanarayana (Discret. Math., 1993)

On minors of graphs with at least 3n -4 edges. - M. Khalifat; Themistocles Politof; Appajosyula Satyanarayana (J. Graph Theory, 1993)

Minors of quasi 4-connected graphs. - Themistocles Politof; Appajosyula Satyanarayana (Discret. Math., 1994)

Graphs with least number of colorings. - A. Sakaloglu; Appajosyula Satyanarayana (J. Graph Theory, 1995)

A forbidden minor characterization and reliability of a class of partial 4-trees. - Gerard T. Lingner; Themistocles Politof; Appajosyula Satyanarayana (Networks, 1995)

The structure of quasi 4-connected graphs. - Themistocles Politof; Appajosyula Satyanarayana (Discret. Math., 1996)

Note on "A Linear-Time Algorithm for Computing K-Terminal Reliability in a Series-Parallel Network". - Appajosyula Satyanarayana; R. Kevin Wood; Leonidas Camarinopoulos; G. Pampoukis (SIAM J. Comput., 1996)

Chromatic polynomials with least coefficients. - José Rodríguez; Appajosyula Satyanarayana (Discret. Math., 1997)

Planar graphs with least chromatic coefficients. - A. Sakaloglu; Appajosyula Satyanarayana (Discret. Math., 1997)

A survey of some network reliability analysis and synthesis results. - Francis T. Boesch; Appajosyula Satyanarayana; Charles L. Suffel (Networks, 2009)