Clyde Monma

3.6k total citations
43 papers, 2.1k citations indexed

About

Clyde Monma is a scholar working on Computational Theory and Mathematics, Industrial and Manufacturing Engineering and Computer Networks and Communications. According to data from OpenAlex, Clyde Monma has authored 43 papers receiving a total of 2.1k indexed citations (citations by other indexed papers that have themselves been cited), including 21 papers in Computational Theory and Mathematics, 19 papers in Industrial and Manufacturing Engineering and 14 papers in Computer Networks and Communications. Recurrent topics in Clyde Monma's work include Advanced Graph Theory Research (15 papers), Scheduling and Optimization Algorithms (11 papers) and Complexity and Algorithms in Graphs (10 papers). Clyde Monma is often cited by papers focused on Advanced Graph Theory Research (15 papers), Scheduling and Optimization Algorithms (11 papers) and Complexity and Algorithms in Graphs (10 papers). Clyde Monma collaborates with scholars based in United States, United Kingdom and Canada. Clyde Monma's co-authors include Chris N. Potts, Martin Grötschel, Mechthild Stoer, Jeffrey B. Sidney, David Shallcross, Victor K. Wei, David F. Shanno, Subhash Suri, Daniel Bienstock and Arthur F. Veinott and has published in prestigious journals such as IEEE Transactions on Information Theory, IEEE Journal on Selected Areas in Communications and Operations Research.

In The Last Decade

Clyde Monma

43 papers receiving 1.9k citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Clyde Monma United States	25	952	866	816	436	212	43	2.1k
William R. Pulleyblank Canada	26	1.1k 1.1×	793 0.9×	443 0.5×	300 0.7×	71 0.3×	58	2.0k
Harlan Crowder United States	9	394 0.4×	1.1k 1.2×	434 0.5×	223 0.5×	260 1.2×	11	2.0k
Serge Plotkin United States	29	1.5k 1.6×	452 0.5×	2.3k 2.9×	574 1.3×	87 0.4×	69	3.3k
L. E. Trotter United States	12	704 0.7×	535 0.6×	279 0.3×	135 0.3×	69 0.3×	30	1.4k
Michele Conforti Italy	19	874 0.9×	278 0.3×	242 0.3×	315 0.7×	134 0.6×	91	1.3k
Warren P. Adams United States	17	801 0.8×	710 0.8×	351 0.4×	284 0.7×	690 3.3×	33	2.0k
S. Thomas McCormick Canada	19	430 0.5×	488 0.6×	430 0.5×	190 0.4×	69 0.3×	61	1.3k
Oktay Günlük United States	20	361 0.4×	597 0.7×	278 0.3×	275 0.6×	165 0.8×	66	1.4k
Naveen Garg India	21	1.0k 1.1×	459 0.5×	1.4k 1.7×	411 0.9×	35 0.2×	63	2.4k
Edward Rothberg United States	22	374 0.4×	303 0.3×	991 1.2×	304 0.7×	195 0.9×	38	1.9k

Countries citing papers authored by Clyde Monma

Since Specialization

Citations

This map shows the geographic impact of Clyde Monma'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 Clyde Monma with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Clyde Monma more than expected).

Fields of papers citing papers by Clyde Monma

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Clyde Monma. 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 Clyde Monma. The network helps show where Clyde Monma may publish in the future.

Co-authorship network of co-authors of Clyde Monma

This figure shows the co-authorship network connecting the top 25 collaborators of Clyde Monma. A scholar is included among the top collaborators of Clyde Monma 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 Clyde Monma. Clyde Monma 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

Jacobson, Michael S., et al.. (1993). Subtree and substar intersection numbers. Discrete Applied Mathematics. 44(1-3). 205–220. 3 indexed citations

Monma, Clyde & Chris N. Potts. (1993). Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times. Operations Research. 41(5). 981–993. 39 indexed citations

Grötschel, Martin, Clyde Monma, & Mechthild Stoer. (1992). Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints. Operations Research. 40(2). 309–330. 121 indexed citations

Roberts, Fred S., Frank K. Hwang, & Clyde Monma. (1991). Reliability of Computer and Communication Networks. 34 indexed citations

Monma, Clyde & Subhash Suri. (1991). Transitions in geometric minimum spanning trees (extended abstract). 239–249. 17 indexed citations

Monma, Clyde, et al.. (1990). Further Development of a Primal-Dual Interior Point Method. INFORMS Journal on Computing. 2(4). 304–311. 46 indexed citations

Monma, Clyde, et al.. (1990). Minimum-weight two-connected spanning networks. Mathematical Programming. 46(1-3). 153–171. 106 indexed citations

Monma, Clyde, et al.. (1989). An Implementation of a Primal-Dual Interior Point Method for Linear Programming. INFORMS Journal on Computing. 1(2). 70–83. 127 indexed citations

Monma, Clyde, Bruce Reed, & William T. Trotter. (1988). Threshold tolerance graphs. Journal of Graph Theory. 12(3). 343–362. 18 indexed citations

10.

Erickson, Ranel E., Clyde Monma, & Arthur F. Veinott. (1987). Send-and-Split Method for Minimum-Concave-Cost Network Flows. Mathematics of Operations Research. 12(4). 634–664. 128 indexed citations

11.

Monma, Clyde & Victor K. Wei. (1986). Intersection graphs of paths in a tree. Journal of Combinatorial Theory Series B. 41(2). 141–181. 76 indexed citations

12.

Monma, Clyde. (1985). Algorithms and software for optimization. 8 indexed citations

13.

Golumbic, Martin Charles, Clyde Monma, & William T. Trotter. (1984). Tolerance graphs. Discrete Applied Mathematics. 9(2). 157–170. 74 indexed citations

14.

Monma, Clyde & Michael Segal. (1982). A Primal Algorithm for Finding Minimum-Cost Flows in Capacitated Networks With Applications. Bell System Technical Journal. 61(6). 949–968. 14 indexed citations

15.

Monma, Clyde. (1982). Linear-Time Algorithms for Scheduling on Parallel Processors. Operations Research. 30(1). 116–124. 22 indexed citations

16.

Monma, Clyde. (1981). Sequencing with general precedence constraints. Discrete Applied Mathematics. 3(2). 137–150. 13 indexed citations

17.

Monma, Clyde. (1980). Sequencing to Minimize the Maximum Job Cost. Operations Research. 28(4). 942–951. 31 indexed citations

18.

Monma, Clyde & Jeffrey B. Sidney. (1979). Sequencing with Series-Parallel Precedence Constraints. Mathematics of Operations Research. 4(3). 215–224. 109 indexed citations

19.

Monma, Clyde. (1979). The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and Extensions. Operations Research. 27(4). 792–798. 29 indexed citations

20.

Monma, Clyde & Jeffrey B. Sidney. (1977). A general algorithm for optimal job sequencing with series-parallel precedence constraints. uO Research (University of Ottawa). 5 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