default search action
Clyde L. Monma
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1995
- [j36]Martin Grötschel, Clyde L. Monma, Mechthild Stoer:
Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements. Oper. Res. 43(6): 1012-1024 (1995) - [j35]Nathaniel Dean, Monika Mevenkamp, Clyde L. Monma:
NETPAD: An interactive graphics system for network modeling and optimization. Oper. Res. Lett. 17(2): 89-101 (1995) - 1993
- [j34]Yi-Wu Chang, Michael S. Jacobson, Clyde L. Monma, Douglas B. West:
Subtree and Substar Intersection Numbers. Discret. Appl. Math. 44(1-3): 205-220 (1993) - [j33]Clyde L. Monma, Chris N. Potts:
Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times. Oper. Res. 41(5): 981-993 (1993) - 1992
- [j32]Clyde L. Monma, Subhash Suri:
Transitions in Geometric Minimum Spanning Trees. Discret. Comput. Geom. 8: 265-293 (1992) - [j31]Martin Grötschel, Clyde L. Monma, Mechthild Stoer:
Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints. Oper. Res. 40(2): 309-330 (1992) - [j30]Martin Grötschel, Clyde L. Monma, Mechthild Stoer:
Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints. SIAM J. Optim. 2(3): 474-504 (1992) - [p1]Nathaniel Dean, Monika Mevenkamp, Clyde L. Monma:
Netpad: an Interactive Graphics System for Network Modeling and Optimization. Computer Science and Operations Research 1992: 231-243 - 1991
- [c3]Clyde L. Monma, Subhash Suri:
Transitions in Geometric Minimum Spanning Trees (Extended Abstract). SCG 1991: 239-249 - [e1]Fred Roberts, Frank Hwang, Clyde L. Monma:
Reliability Of Computer And Communication Networks, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, December 2-4, 1989. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 5, DIMACS/AMS 1991, ISBN 978-0-8218-6592-7 [contents] - 1990
- [j29]Daniel Bienstock, Clyde L. Monma:
On the Complexity of Embedding Planar Graphs To Minimize Certain Distance Measures. Algorithmica 5(1): 93-109 (1990) - [j28]Clyde L. Monma, Mike Paterson, Subhash Suri, F. Frances Yao:
Computing Euclidean Maximum Spanning Trees. Algorithmica 5(3): 407-419 (1990) - [j27]In Chan Choi, Clyde L. Monma, David F. Shanno:
Further Development of a Primal-Dual Interior Point Method. INFORMS J. Comput. 2(4): 304-311 (1990) - [j26]Clyde L. Monma, Alexander Schrijver, Michael J. Todd, Victor K.-W. Wei:
Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions. Math. Oper. Res. 15(4): 736-748 (1990) - [j25]Clyde L. Monma, Beth Spellman Munson, William R. Pulleyblank:
Minimum-Weight Two-Connected Spanning Networks. Math. Program. 46: 153-171 (1990) - [j24]Daniel Bienstock, Ernest F. Brickell, Clyde L. Monma:
On the Structure of Minimum-Weight k-Connected Spanning Networks. SIAM J. Discret. Math. 3(3): 320-329 (1990) - [j23]Martin Grötschel, Clyde L. Monma:
Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints. SIAM J. Discret. Math. 3(4): 502-523 (1990)
1980 – 1989
- 1989
- [j22]Kevin A. McShane, Clyde L. Monma, David F. Shanno:
An Implementation of a Primal-Dual Interior Point Method for Linear Programming. INFORMS J. Comput. 1(2): 70-83 (1989) - [j21]Clyde L. Monma, David F. Shallcross:
Methods for Designing Communications Networks with Certain Two-Connected Survivability Constraints. Oper. Res. 37(4): 531-541 (1989) - [j20]Clyde L. Monma, Chris N. Potts:
On the Complexity of Scheduling with Batch Setup Times. Oper. Res. 37(5): 798-804 (1989) - [j19]Richard H. Cardwell, Clyde L. Monma, Tsong-Ho Wu:
Computer-aided design procedures for survivable fiber optic networks. IEEE J. Sel. Areas Commun. 7(8): 1188-1197 (1989) - [j18]Daniel Bienstock, Clyde L. Monma:
Optimal enclosing regions in planar graphs. Networks 19(1): 79-94 (1989) - [c2]Martin Grötschel, Clyde L. Monma, Mechthild Stoer:
Polyhedral Approaches to Network Survivability. Reliability Of Computer And Communication Networks 1989: 121-142 - 1988
- [j17]Clyde L. Monma, Bruce A. Reed, William T. Trotter:
Threshold tolerance graphs. J. Graph Theory 12(3): 343-362 (1988) - [j16]Daniel Bienstock, Clyde L. Monma:
On the Complexity of Covering Vertices by Faces in a Planar Graph. SIAM J. Comput. 17(1): 53-76 (1988) - [c1]Clyde L. Monma, Mike Paterson, Subhash Suri, F. Frances Yao:
Computing Euclidean Maximum Spanning Trees. SCG 1988: 241-251 - 1987
- [j15]Clyde L. Monma, Jeffrey B. Sidney:
Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions. Math. Oper. Res. 12(1): 22-31 (1987) - [j14]Ranel E. Erickson, Clyde L. Monma, Arthur F. Veinott Jr.:
Send-and-Split Method for Minimum-Concave-Cost Network Flows. Math. Oper. Res. 12(4): 634-664 (1987) - 1986
- [j13]Clyde L. Monma, Victor K.-W. Wei:
Intersection graphs of paths in a tree. J. Comb. Theory B 41(2): 141-181 (1986) - [j12]Clyde L. Monma, Diane Sheng:
Backbone Network Design and Performance Analysis: A Methodology for Packet Switching Networks. IEEE J. Sel. Areas Commun. 4(6): 946-965 (1986) - 1984
- [j11]Clyde L. Monma, Donald R. Smith:
Probabilistic analysis of interframe tie requirements for cross-connect systems. AT&T Bell Lab. Tech. J. 63(4): 643-664 (1984) - [j10]Martin Charles Golumbic, Clyde L. Monma, William T. Trotter:
Tolerance graphs. Discret. Appl. Math. 9(2): 157-170 (1984) - 1982
- [j9]Clyde L. Monma:
Linear-Time Algorithms for Scheduling on Parallel Processors. Oper. Res. 30(1): 116-124 (1982) - [j8]Clyde L. Monma:
Network flow programming, by P. A. Jensen and J. W. Barnes, John Wiley and Sons, Inc., New York, 1980, 408 pp. Price: $28.95. Networks 12(3): 351 (1982) - [j7]Edgar N. Gilbert, Clyde L. Monma:
Multigram codes. IEEE Trans. Inf. Theory 28(2): 346- (1982) - 1981
- [j6]Clyde L. Monma:
Sequencing with general precedence constraints. Discret. Appl. Math. 3(2): 137-150 (1981) - [j5]Clyde L. Monma:
Operations Research Support Methodology, Albert G. Holzman, Ed., Marcel Dekker, New York, 1979, 648 pp. Price $39.75. Networks 11(3): 321-322 (1981) - 1980
- [j4]Clyde L. Monma:
Sequencing to Minimize the Maximum Job Cost. Oper. Res. 28(4): 942-951 (1980)
1970 – 1979
- 1979
- [j3]Clyde L. Monma:
The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and Extensions. Oper. Res. 27(4): 792-798 (1979) - [j2]Clyde L. Monma, Jeffrey B. Sidney:
Sequencing with Series-Parallel Precedence Constraints. Math. Oper. Res. 4(3): 215-224 (1979) - [j1]Clyde L. Monma, Leslie E. Trotter Jr.:
On perfect graphs and polyhedra with (0, 1)-valued extreme points. Math. Program. 17(1): 239-242 (1979)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: