default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAppajosyula Satyanarayana
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[j20]Francis T. Boesch, Appajosyula Satyanarayana, Charles L. Suffel:
A survey of some network reliability analysis and synthesis results. Networks 54(2): 99-107 (2009)
1990 – 1999
- 1997
- [j19]José Rodríguez, Appajosyula Satyanarayana:
Chromatic polynomials with least coefficients. Discret. Math. 172(1-3): 115-119 (1997) - [j18]A. Sakaloglu, Appajosyula Satyanarayana:
Planar graphs with least chromatic coefficients. Discret. Math. 172(1-3): 121-130 (1997) - 1996
- [j17]Themistocles Politof, Appajosyula Satyanarayana:
The structure of quasi 4-connected graphs. Discret. Math. 161(1-3): 217-228 (1996) - [j16]Appajosyula Satyanarayana, R. Kevin Wood, Leonidas Camarinopoulos, G. Pampoukis:
Note on "A Linear-Time Algorithm for Computing K-Terminal Reliability in a Series-Parallel Network". SIAM J. Comput. 25(2): 290 (1996) - 1995
- [j15]A. Sakaloglu, Appajosyula Satyanarayana:
Graphs with least number of colorings. J. Graph Theory 19(4): 523-533 (1995) - [j14]Gerard T. Lingner, Themistocles Politof, Appajosyula Satyanarayana:
A forbidden minor characterization and reliability of a class of partial 4-trees. Networks 25(3): 139-146 (1995) - 1994
- [j13]Themistocles Politof, Appajosyula Satyanarayana:
Minors of quasi 4-connected graphs. Discret. Math. 126(1-3): 245-256 (1994) - 1993
- [j12]Charles J. Colbourn, Appajosyula Satyanarayana, Charles L. Suffel, Klaus Sutner:
Computing Residual Connectedness Reliability for Restricted Networks. Discret. Appl. Math. 44(1-3): 221-232 (1993) - [j11]José Rodríguez, Appajosyula Satyanarayana:
A generalized chromatic polynomial, acyclic orientations with prescribed sources and sinks, and network reliability. Discret. Math. 112(1-3): 185-197 (1993) - [j10]M. Khalifat, Themistocles Politof, Appajosyula Satyanarayana:
On minors of graphs with at least 3n -4 edges. J. Graph Theory 17(4): 523-529 (1993) - 1992
- [j9]Appajosyula Satyanarayana, L. Schoppmann, Charles L. Suffel:
A reliability-improving graph transformation with applications to network reliability. Networks 22(2): 209-216 (1992) - 1991
- [j8]Klaus Sutner, Appajosyula Satyanarayana, Charles L. Suffel:
The Complexity of the Residual Node Connectedness Reliability Problem. SIAM J. Comput. 20(1): 149-155 (1991) - 1990
- [j7]Appajosyula Satyanarayana, L. Tung:
A characterization of partial 3-trees. Networks 20(3): 299-322 (1990) - [j6]Francis T. Boesch, Appajosyula Satyanarayana, Charles L. Suffel:
Least reliable networks and the reliability domination. IEEE Trans. Commun. 38(11): 2004-2009 (1990)
1980 – 1989
- 1989
- [c1]Francis T. Boesch, Appajosyula Satyanarayana, Charles L. Suffel:
On Residual Connectedness Network Reliability. Reliability Of Computer And Communication Networks 1989: 51-60 - 1987
- [j5]Appajosyula Satyanarayana, Ralph Tindell:
Chromatic polynomials and network reliability. Discret. Math. 67(1): 57-79 (1987) - 1986
- [j4]Themistocles Politof, Appajosyula Satyanarayana:
Network Reliability and Inner-Four-Cycle-Free Graphs. Math. Oper. Res. 11(3): 484-505 (1986) - 1985
- [j3]Avinash Agrawal, Appajosyula Satyanarayana:
Network reliability analysis using 2-connected digraph reductions. Networks 15(2): 239-256 (1985) - [j2]Appajosyula Satyanarayana, R. Kevin Wood:
A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks. SIAM J. Comput. 14(4): 818-832 (1985) - 1984
- [j1]Avinash Agrawal, Appajosyula Satyanarayana:
An O(|E|) Time Algorithm for Computing the Reliability of a Class of Directed Networks. Oper. Res. 32(3): 493-515 (1984)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
