J. Scott Provan
Impact in
-
- Advanced Combinatorial Mathematics
-
- Reliability and Maintenance Optimization
Papers in
-
- Advanced Graph Theory Research 17
- Formal Methods in Verification 5
- Software 11
- Software Reliability and Analysis Research 11
- Co-authors
- Michael O. Ball (9 shared papers)Louis J. Billera (4 shared papers)Megan Owen (2 shared papers)Charles J. Colbourn (4 shared papers)Douglas R. Shier (3 shared papers)Thomas A. Feo (2 shared papers)Dirk Vertigan (2 shared papers)V. G. Kulkarni (1 shared paper)
- Journals
- Networks (6 papers)Operations Research (5 papers)Mathematics of Operations Research (4 papers)SIAM Journal on Computing (3 papers)Discrete Applied Mathematics (3 papers)
- Partner nations
- United StatesCanadaMexico
In The Last Decade
J. Scott Provan
46 papers receiving 1.7k citations
J. Scott Provan's Hit Papers
Peers
Comparison fields: 5 of 94
- Discrete Mathematics and Combinatorics 200
- Safety, Risk, Reliability and Quality 430
- Computational Theory and Mathematics 772
- Software 183
- Geometry and Topology 308
Countries citing papers authored by J. Scott Provan
This map shows the geographic impact of J. Scott Provan'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 J. Scott Provan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites J. Scott Provan more than expected).
Fields of papers citing papers by J. Scott Provan
This network shows the impact of papers produced by J. Scott Provan. 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 J. Scott Provan. The network helps show where J. Scott Provan may publish in the future.
Co-authors
The 19 scholars most cited alongside J. Scott Provan, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 48 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected Hit paper breakdown → | 1983 | 553 |
| 2 | 1980 | 143 | |
| 3 | 2010 | 122 | |
| 4 | 1983 | 113 | |
| 5 | 1984 | 104 | |
| 6 | 1995 | 104 | |
| 7 | 1986 | 84 | |
| 8 | 1988 | 69 | |
| 9 | 1982 | 69 | |
| 10 | 2003 | 47 | |
| 11 | 1988 | 43 | |
| 12 | 1993 | 32 | |
| 13 | 1988 | 32 | |
| 14 | 1991 | 28 | |
| 15 | 1996 | 27 | |
| 16 | 1987 | 25 | |
| 17 | 1994 | 23 | |
| 18 | 1995 | 20 | |
| 19 | Decompositions, shellings, and diameters of simplical complexes and convex polyhedra. | 1977 | 20 |
| 20 | 1986 | 19 |
About J. Scott Provan
J. Scott Provan is a scholar working on Computational Theory and Mathematics, Software, Safety, Risk, Reliability and Quality, Discrete Mathematics and Combinatorics and Computer Graphics and Computer-Aided Design, having authored 48 papers that have together received 1.9k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (17 papers), Reliability and Maintenance Optimization (13 papers), Software Reliability and Analysis Research (11 papers), VLSI and FPGA Design Techniques (11 papers), graph theory and CDMA systems (6 papers), Interconnection Networks and Systems (6 papers), Advanced Combinatorial Mathematics (6 papers) and Formal Methods in Verification (5 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (200 citations), Safety, Risk, Reliability and Quality (430 citations), Computational Theory and Mathematics (772 citations), Software (183 citations) and Geometry and Topology (308 citations). J. Scott Provan has collaborated with scholars based in United States, Canada and Mexico. Frequent co-authors include Michael O. Ball, Louis J. Billera, Megan Owen, Charles J. Colbourn, Douglas R. Shier, Thomas A. Feo, Dirk Vertigan, V. G. Kulkarni, Dan Archdeacon and Isidoro Gitler. Their work appears in journals such as Networks, Operations Research, Mathematics of Operations Research, SIAM Journal on Computing and Discrete Applied Mathematics.
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.