S. Thomas McCormick
- Industrial and Manufacturing Engineering top 1%
- Computer Networks and Communications top 2%
- Computational Theory and Mathematics top 1%
- Electrical and Electronic Engineering
- Management Information Systems top 5%
- Co-authors
- Michael PinedoChung‐Lun LiDavid Simchi‐LeviScott ShenkerBarry WolfHarish KrishnanJing ShaoAlexander V. Karzanov
- Topics
- Complexity and Algorithms in Graphs (33 papers)Optimization and Search Problems (20 papers)Advanced Graph Theory Research (20 papers)
- Cited by
- Industrial and Manufacturing EngineeringComputational Theory and MathematicsComputer Networks and Communications
- Partner nations
- CanadaUnited StatesJapan
In The Last Decade
S. Thomas McCormick
61 papers receiving 1.2k citations
Peers
Comparison fields: 5 of 76
- Industrial and Manufacturing Engineering 488
- Computer Networks and Communications 430
- Computational Theory and Mathematics 430
- Electrical and Electronic Engineering 190
- Management Information Systems 162
Countries citing papers authored by S. Thomas McCormick
This map shows the geographic impact of S. Thomas McCormick'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 S. Thomas McCormick with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites S. Thomas McCormick more than expected).
Fields of papers citing papers by S. Thomas McCormick
This network shows the impact of papers produced by S. Thomas McCormick. 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 S. Thomas McCormick. The network helps show where S. Thomas McCormick may publish in the future.
Co-authorship network of co-authors of S. Thomas McCormick
This figure shows the co-authorship network connecting the top 25 collaborators of S. Thomas McCormick. A scholar is included among the top collaborators of S. Thomas McCormick 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 S. Thomas McCormick. S. Thomas McCormick is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 5 | |
| 2 | 8 | |
| 3 | 1 | |
| 4 | 11 | |
| 5 | 1 | |
| 6 | 13 | |
| 7 | 2 | |
| 8 | 4 | |
| 9 | 55 | |
| 10 | 1 | |
| 11 | 8 | |
| 12 | Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization | 4 |
| 13 | 9 | |
| 14 | 1 | |
| 15 | 15 | |
| 16 | 29 | |
| 17 | 2 | |
| 18 | 27 | |
| 19 | 99 | |
| 20 | 24 |
About S. Thomas McCormick
S. Thomas McCormick is a scholar working on Computational Theory and Mathematics, Industrial and Manufacturing Engineering and Numerical Analysis, having authored 61 papers that have together received 1.3k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (33 papers), Optimization and Search Problems (20 papers) and Advanced Graph Theory Research (20 papers). The work is most often cited by research in Industrial and Manufacturing Engineering (488 citations), Computational Theory and Mathematics (430 citations) and Computer Networks and Communications (430 citations). S. Thomas McCormick has collaborated with scholars based in Canada, United States and Japan. Frequent co-authors include Michael Pinedo, Chung‐Lun Li, David Simchi‐Levi, Scott Shenker, Barry Wolf, Harish Krishnan, Jing Shao, Alexander V. Karzanov, Satoru Iwata and A. Ridha Mahjoub. Their work appears in journals such as Operations Research, Mathematical Programming and Computers & Operations Research.
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.