S. Thomas McCormick

2.1k total citations
61 papers, 1.3k citations indexed

About

S. Thomas McCormick is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Industrial and Manufacturing Engineering. According to data from OpenAlex, S. Thomas McCormick has authored 61 papers receiving a total of 1.3k indexed citations (citations by other indexed papers that have themselves been cited), including 37 papers in Computational Theory and Mathematics, 23 papers in Computer Networks and Communications and 16 papers in Industrial and Manufacturing Engineering. Recurrent topics in S. Thomas McCormick's work include Complexity and Algorithms in Graphs (33 papers), Optimization and Search Problems (20 papers) and Advanced Graph Theory Research (20 papers). S. Thomas McCormick is often cited by papers focused on Complexity and Algorithms in Graphs (33 papers), Optimization and Search Problems (20 papers) and Advanced Graph Theory Research (20 papers). S. Thomas McCormick collaborates with scholars based in Canada, United States and Japan. S. Thomas McCormick's 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 and has published in prestigious journals such as Operations Research, Mathematical Programming and Computers & Operations Research.

In The Last Decade

S. Thomas McCormick

61 papers receiving 1.2k citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
S. Thomas McCormick Canada 19 488 430 430 190 162 61 1.3k
Oktay Günlük United States 20 597 1.2× 278 0.6× 361 0.8× 275 1.4× 147 0.9× 66 1.4k
Antoon Kolen Netherlands 16 898 1.8× 356 0.8× 248 0.6× 131 0.7× 308 1.9× 38 1.5k
C.A.J. Hurkens Netherlands 18 661 1.4× 367 0.9× 307 0.7× 137 0.7× 226 1.4× 67 1.3k
J. B. G. Frenk Netherlands 18 396 0.8× 156 0.4× 200 0.5× 63 0.3× 342 2.1× 81 1.0k
Maria Grazia Scutellà Italy 19 704 1.4× 286 0.7× 150 0.3× 161 0.8× 78 0.5× 74 1.4k
Dachuan Xu China 15 289 0.6× 283 0.7× 219 0.5× 51 0.3× 58 0.4× 150 833
K. P. K. Nair Canada 14 339 0.7× 186 0.4× 255 0.6× 102 0.5× 101 0.6× 55 992
Andreas S. Schulz United States 22 854 1.8× 808 1.9× 235 0.5× 125 0.7× 118 0.7× 61 1.9k
Sven O. Krumke Germany 15 367 0.8× 395 0.9× 167 0.4× 150 0.8× 32 0.2× 86 1.0k
Colm Art O’Cinneide United States 15 624 1.3× 146 0.3× 233 0.5× 87 0.5× 900 5.6× 41 1.6k

Countries citing papers authored by S. Thomas McCormick

Since Specialization
Citations

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

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

20 of 20 papers shown
1.
Park, Ju Nyeong, et al.. (2023). Retention and Overdose Risk among Patients Receiving Substance Use Disorder Treatment, Mental Health Care and Peer Recovery Support: A Longitudinal Analysis. Journal of Addiction Medicine. 17(5). 608–611. 5 indexed citations
2.
Fischer, Frank, et al.. (2017). Matroid optimisation problems with nested non-linear monomials in the objective function. Mathematical Programming. 169(2). 417–446. 8 indexed citations
3.
Dawande, Milind, et al.. (2017). On Integral Policies in Deterministic and Stochastic Distribution Systems. Operations Research. 65(3). 703–711. 1 indexed citations
4.
Aissi, Hassène, A. Ridha Mahjoub, S. Thomas McCormick, & Maurice Queyranne. (2015). Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs. Mathematical Programming. 154(1-2). 3–28. 11 indexed citations
5.
McCormick, S. Thomas, et al.. (2010). Separation, dimension, and facet algorithms for node flow polyhedra. Mathematical Programming. 124(1-2). 317–348. 1 indexed citations
6.
Fleischer, Lisa, Satoru Iwata, & S. Thomas McCormick. (2002). A faster capacity scaling algorithm for minimum cost submodular flow. Mathematical Programming. 92(1). 119–139. 13 indexed citations
7.
McCormick, S. Thomas & Akiyoshi Shioura. (2000). Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks. Symposium on Discrete Algorithms. 944–952. 2 indexed citations
8.
Iwata, Satoru, S. Thomas McCormick, & Maiko Shigeno. (1998). A faster algorithm for minimum cost submodular flows. Symposium on Discrete Algorithms. 167–174. 4 indexed citations
9.
Karzanov, Alexander V. & S. Thomas McCormick. (1997). Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications. SIAM Journal on Computing. 26(4). 1245–1275. 55 indexed citations
10.
Cunningham, William H., S. Thomas McCormick, & Maurice Queyranne. (1996). Integer programming and combinatorial optimization : 5th International IPCO Conference, Vancouver, British Columbia, Canada, June 3-5, 1996 : proceedings. Springer eBooks. 1 indexed citations
11.
McCormick, S. Thomas. (1996). A polynomial algorithm for abstract maximum flow. Symposium on Discrete Algorithms. 490–497. 8 indexed citations
12.
Cunningham, William H., S. Thomas McCormick, & Maurice Queyranne. (1996). Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization. 4 indexed citations
13.
McCormick, S. Thomas. (1996). Submodular containment is hard, even for networks. Operations Research Letters. 19(2). 95–99. 9 indexed citations
14.
Karzanov, Alexander V. & S. Thomas McCormick. (1995). Polynomial methods for separable convex optimization in unimodular spaces. Symposium on Discrete Algorithms. 78–87. 1 indexed citations
15.
McCormick, S. Thomas, et al.. (1994). Computing maximum mean cuts. Discrete Applied Mathematics. 52(1). 53–70. 15 indexed citations
16.
McCormick, S. Thomas, et al.. (1993). Two strongly polynomial cut cancelling algorithms for minimum cost network flow. Discrete Applied Mathematics. 46(2). 133–165. 29 indexed citations
17.
McCormick, S. Thomas, et al.. (1993). Canceling most helpful total submodular cuts for submodular flow.. 198. 343–353. 2 indexed citations
18.
Li, Chung‐Lun, S. Thomas McCormick, & David Simchi‐Levi. (1992). The point-to-point delivery and connection problems: complexity and algorithms. Discrete Applied Mathematics. 36(3). 267–292. 27 indexed citations
19.
Li, Chung‐Lun, S. Thomas McCormick, & David Simchi‐Levi. (1990). The complexity of finding two disjoint paths with min-max objective function. Discrete Applied Mathematics. 26(1). 105–115. 99 indexed citations
20.
Chaudhry, Sohail S., et al.. (1986). Locating independent facilities with maximum weight: Greedy heuristics. Omega. 14(5). 383–389. 24 indexed citations

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

Breakdown of academic impact, for papers by Oktay Günlük Breakdown of academic impact, for papers by Antoon Kolen Breakdown of academic impact, for papers by C.A.J. Hurkens Breakdown of academic impact, for papers by J. B. G. Frenk Breakdown of academic impact, for papers by Maria Grazia Scutellà Breakdown of academic impact, for papers by Dachuan Xu Breakdown of academic impact, for papers by K. P. K. Nair Breakdown of academic impact, for papers by Andreas S. Schulz Breakdown of academic impact, for papers by Sven O. Krumke Breakdown of academic impact, for papers by Colm Art O’Cinneide
Rankless by CCL
2026