default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCharles L. Suffel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[j19]Daniel Gross, L. William Kazmierczak, John T. Saccoman, Charles L. Suffel, Antonius Suhartomo:
On Component Order Edge Connectivity Of a Complete Bipartite Graph. Ars Comb. 112: 433-448 (2013)
2000 – 2009
- 2009
- [j18]Charles L. Suffel:
A eulogy for Frank Boesch. Networks 54(2): 69 (2009) - [j17]Frank Boesch, Daniel Gross, John T. Saccoman, L. William Kazmierczak, Charles L. Suffel, Antonius Suhartomo:
A generalization of an edge-connectivity theorem of Chartrand. Networks 54(2): 82-89 (2009) - [j16]Francis T. Boesch, Appajosyula Satyanarayana, Charles L. Suffel:
A survey of some network reliability analysis and synthesis results. Networks 54(2): 99-107 (2009) - 2007
- [j15]L. William Kazmierczak, Frank Boesch, Daniel Gross, Charles L. Suffel:
Realizability Results Involving Two Connectivity Parameters. Ars Comb. 82 (2007)
1990 – 1999
- 1998
- [j14]Louis Petingi, Frank Boesch, Charles L. Suffel:
On the characterization of graphs with maximum number of spanning trees. Discret. Math. 179(1-3): 155-166 (1998) - 1996
- [j13]Lynne L. Doty, R. J. Goldstone, Charles L. Suffel:
Cayley Graphs with Neighbor Connectivity One. SIAM J. Discret. Math. 9(4): 625-642 (1996) - [j12]Frank Boesch, Daniel Gross, Charles L. Suffel:
A coherent model for reliability of multiprocessor networks. IEEE Trans. Reliab. 45(4): 678-684 (1996) - 1993
- [j11]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) - 1992
- [j10]Appajosyula Satyanarayana, L. Schoppmann, Charles L. Suffel:
A reliability-improving graph transformation with applications to network reliability. Networks 22(2): 209-216 (1992) - 1991
- [j9]Francis T. Boesch, Xiaoming Li, Charles L. Suffel:
On the existence of uniformly optimally reliable networks. Networks 21(2): 181-194 (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]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 - 1985
- [j6]Douglas Bauer, Frank Boesch, Charles L. Suffel, Ralph Tindell:
Combinatorial optimization problems in the analysis and design of probabilistic networks. Networks 15(2): 257-271 (1985) - 1983
- [j5]Douglas Bauer, Frank Harary, Juhani Nieminen, Charles L. Suffel:
Domination alteration sets in graphs. Discret. Math. 47: 153-161 (1983) - 1982
- [j4]Francis T. Boesch, Charles L. Suffel:
Realizability of p-point, q-line graphs with prescribed point connectivity, line connectivity, or minimum degree. Networks 12(3): 341-350 (1982) - 1981
- [j3]Francis T. Boesch, Charles L. Suffel:
Realizability of p-point graphs with prescribed minimum degree, maximum degree, and point-connectivity. Discret. Appl. Math. 3(1): 9-18 (1981) - 1980
- [j2]Francis T. Boesch, Charles L. Suffel:
Realizability of p-point graphs with prescribed minimum degree, maximum degree, and line connectivity. J. Graph Theory 4(4): 363-370 (1980)
1970 – 1979
- 1977
- [j1]Francis T. Boesch, Charles L. Suffel, Ralph Tindell:
The spanning subgraphs of eulerian graphs. J. Graph Theory 1(1): 79-84 (1977)
Coauthor Index
aka: Frank Boesch
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-25 05:48 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:
