J. Scott Provan
- Computational Theory and Mathematics top 0.5%
- Computer Networks and Communications top 5%
- Safety, Risk, Reliability and Quality top 1%
- Geometry and Topology top 2%
- Electrical and Electronic Engineering
- Co-authors
- Michael O. BallLouis J. BilleraMegan OwenDouglas R. ShierThomas A. FeoCharles J. ColbournDirk VertiganV. G. Kulkarni
- Topics
- Advanced Graph Theory Research (17 papers)Reliability and Maintenance Optimization (12 papers)Software Reliability and Analysis Research (11 papers)
- Partner nations
- United StatesCanadaMexico
In The Last Decade
J. Scott Provan
43 papers receiving 1.4k citations
Hit Papers
Peers
Comparison fields: 5 of 94
- Computational Theory and Mathematics 618
- Computer Networks and Communications 361
- Safety, Risk, Reliability and Quality 350
- Geometry and Topology 251
- Electrical and Electronic Engineering 247
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-authorship network of co-authors of J. Scott Provan
This figure shows the co-authorship network connecting the top 25 collaborators of J. Scott Provan. A scholar is included among the top collaborators of J. Scott Provan 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 J. Scott Provan. J. Scott Provan is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 97 | |
| 2 | Pre-conditioning integer programs using column basis reduction and geometry and topology of protein structure | 1 |
| 3 | 45 | |
| 4 | 12 | |
| 5 | 0 | |
| 6 | 2 | |
| 7 | 8 | |
| 8 | 9 | |
| 9 | 14 | |
| 10 | 10 | |
| 11 | Hindenburg: An Illustrated History | 3 |
| 12 | 12 | |
| 13 | 5 | |
| 14 | 5 | |
| 15 | 13 | |
| 16 | 8 | |
| 17 | 62 | |
| 18 | 2 | |
| 19 | 18 | |
| 20 | Decompositions, shellings, and diameters of simplical complexes and convex polyhedra. | 19 |
About J. Scott Provan
J. Scott Provan is a scholar working on Software, Discrete Mathematics and Combinatorics and Computational Theory and Mathematics, having authored 45 papers that have together received 1.5k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (17 papers), Reliability and Maintenance Optimization (12 papers) and Software Reliability and Analysis Research (11 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (167 citations), Software (156 citations) and Computational Theory and Mathematics (618 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, Douglas R. Shier, Thomas A. Feo, Charles J. Colbourn, Dirk Vertigan, V. G. Kulkarni, Dan Archdeacon and Jane N. Hagstrom. Their work appears in journals such as Annals of the New York Academy of Sciences, Operations Research and Mathematical Programming.
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.