C Suffel

890 total citations
29 papers, 583 citations indexed

About

C Suffel is a scholar working on Computational Theory and Mathematics, Safety, Risk, Reliability and Quality and Geometry and Topology. According to data from OpenAlex, C Suffel has authored 29 papers receiving a total of 583 indexed citations (citations by other indexed papers that have themselves been cited), including 16 papers in Computational Theory and Mathematics, 10 papers in Safety, Risk, Reliability and Quality and 8 papers in Geometry and Topology. Recurrent topics in C Suffel's work include Advanced Graph Theory Research (11 papers), Reliability and Maintenance Optimization (10 papers) and Graph theory and applications (8 papers). C Suffel is often cited by papers focused on Advanced Graph Theory Research (11 papers), Reliability and Maintenance Optimization (10 papers) and Graph theory and applications (8 papers). C Suffel collaborates with scholars based in United States, Canada and Finland. C Suffel's co-authors include F Boesch, A. Satyanarayana, Douglas C. Bauer, Ralph Tindell, Frank Harary, Juhani Nieminen, Klaus Sutner, Richard Van Slyke, Charles J. Colbourn and Daniel Gross and has published in prestigious journals such as Annals of the New York Academy of Sciences, IEEE Transactions on Communications and SIAM Journal on Computing.

In The Last Decade

C Suffel

26 papers receiving 531 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
C Suffel United States	12	335	227	219	144	65	29	583
Ashok T. Amin United States	7	84 0.3×	323 1.4×	51 0.2×	28 0.2×	102 1.6×	12	418
Ali Ridha Mahjoub France	15	512 1.5×	112 0.5×	36 0.2×	4 0.0×	209 3.2×	41	701
Hiro Ito Japan	9	162 0.5×	157 0.7×	4 0.0×	8 0.1×	32 0.5×	64	271
Bertrand Estellon France	10	82 0.2×	42 0.2×	50 0.2×	3 0.0×	13 0.2×	18	267
Jinfeng Liu China	10	67 0.2×	71 0.3×	72 0.3×	1 0.0×	43 0.7×	29	264
Toshimasa Watanabe Japan	11	302 0.9×	186 0.8×	4 0.0×	6 0.0×	51 0.8×	37	380
Qingying Deng China	6	38 0.1×	107 0.5×	67 0.3×	4 0.0×	38 0.6×	19	285
Stéphane Pérennès France	12	239 0.7×	409 1.8×	23 0.1×	2 0.0×	159 2.4×	70	573
Peter Horák United States	11	216 0.6×	85 0.4×	57 0.3×		223 3.4×	56	456
Richard Borie United States	9	165 0.5×	122 0.5×	10 0.0×		21 0.3×	21	308

Countries citing papers authored by C Suffel

Since Specialization

Citations

This map shows the geographic impact of C Suffel's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by C Suffel with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites C Suffel more than expected).

Fields of papers citing papers by C Suffel

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by C Suffel. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by C Suffel. The network helps show where C Suffel may publish in the future.

Co-authorship network of co-authors of C Suffel

This figure shows the co-authorship network connecting the top 25 collaborators of C Suffel. A scholar is included among the top collaborators of C Suffel based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with C Suffel. C Suffel is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Gross, Daniel, et al.. (2013). Spanning Tree Results for Graphs and Multigraphs. WORLD SCIENTIFIC eBooks. 6 indexed citations

Boesch, F, et al.. (2009). A generalization of an edge‐connectivity theorem of Chartrand. Networks. 54(2). 82–89.

Boesch, F, A. Satyanarayana, & C Suffel. (2009). A survey of some network reliability analysis and synthesis results. Networks. 54(2). 99–107. 54 indexed citations

Boesch, F, et al.. (2007). Realizability Results Involving Two Connectivity Parameters.. Ars Combinatoria. 82.

Boesch, F, et al.. (1998). On the characterization of graphs with maximum number of spanning trees. Discrete Mathematics. 179(1-3). 155–166. 32 indexed citations

Colbourn, Charles J., A. Satyanarayana, C Suffel, & Klaus Sutner. (1993). Computing residual connectedness reliability for restricted networks. Discrete Applied Mathematics. 44(1-3). 221–232. 23 indexed citations

Boesch, F, C Suffel, Ralph Tindell, & Frank Harary. (1993). The neighborhood inclusion structure of a graph. Mathematical and Computer Modelling. 17(11). 25–28. 8 indexed citations

Satyanarayana, A., et al.. (1992). A reliability‐improving graph transformation with applications to network reliability. Networks. 22(2). 209–216. 31 indexed citations

Boesch, F, et al.. (1991). On the existence of uniformly optimally reliable networks. Networks. 21(2). 181–194. 63 indexed citations

10.

Sutner, Klaus, A. Satyanarayana, & C Suffel. (1991). The Complexity of the Residual Node Connectedness Reliability Problem. SIAM Journal on Computing. 20(1). 149–155. 35 indexed citations

11.

Boesch, F, A. Satyanarayana, & C Suffel. (1990). Some Alternate Characterizations of Reliability Domination. Probability in the Engineering and Informational Sciences. 4(2). 257–276. 8 indexed citations

12.

Bauer, Douglas C., F Boesch, C Suffel, & Richard Van Slyke. (1987). On the validity of a reduction of reliable network design to a graph extremal problem. IEEE Transactions on Circuits and Systems. 34(12). 1579–1581. 36 indexed citations

13.

Chirlian, Paul M., Charles R. Giardina, & C Suffel. (1986). On the effective bandwidth of sampled signals. IEEE Transactions on Circuits and Systems. 33(3). 268–275. 2 indexed citations

14.

Bauer, Douglas C., F Boesch, C Suffel, & Ralph Tindell. (1985). Combinatorial optimization problems in the analysis and design of probabilistic networks. Networks. 15(2). 257–271. 55 indexed citations

15.

Bauer, Douglas C., Frank Harary, Juhani Nieminen, & C Suffel. (1983). Domination alteration sets in graphs. Discrete Mathematics. 47. 153–161. 95 indexed citations

16.

Boesch, F & C Suffel. (1981). Realizability of p-point graphs with prescribed minimum degree, maximum degree, and point-connectivity. Discrete Applied Mathematics. 3(1). 9–18. 5 indexed citations

17.

Suffel, C. (1979). THE SPANNING SUBGRAPHS OF EULERIAN GRAPHS*. Annals of the New York Academy of Sciences. 328(1). 193–200. 1 indexed citations

18.

Beckenstein, Edward, Lawrence Narici, C Suffel, & Seth Warner. (1977). Maximal ideals in algebras of continuous functions. Journal d Analyse Mathématique. 31(1). 293–297. 1 indexed citations

19.

Boesch, F, C Suffel, & Ralph Tindell. (1977). The spanning subgraphs of eulerian graphs. Journal of Graph Theory. 1(1). 79–84. 62 indexed citations

20.

Suffel, C. (1972). On set functions with values in a topological vector space. Annali di Matematica Pura ed Applicata (1923 -). 93(1). 81–88.

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact