Clyde L. Monma

41 papers Journal 36Unranked 3
YearRankTypeTitle / Venue / Authors
1995 J jnl
NETPAD: An interactive graphics system for network modeling and optimization.
Oper. Res. Lett.
Nathaniel Dean, Monika Mevenkamp, Clyde L. Monma
1995 J jnl
Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements.
Oper. Res.
Martin Grötschel, Clyde L. Monma, Mechthild Stoer
1993 J jnl
Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times.
Oper. Res.
Clyde L. Monma, Chris N. Potts
1993 J jnl
Subtree and Substar Intersection Numbers.
Discret. Appl. Math.
Yi-Wu Chang, Michael S. Jacobson, Clyde L. Monma, Douglas B. West
1992 J jnl
Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints.
Oper. Res.
Martin Grötschel, Clyde L. Monma, Mechthild Stoer
1992 J jnl
Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints.
SIAM J. Optim.
Martin Grötschel, Clyde L. Monma, Mechthild Stoer
1992 — ch.
Netpad: an Interactive Graphics System for Network Modeling and Optimization.
Computer Science and Operations Research
Nathaniel Dean, Monika Mevenkamp, Clyde L. Monma
1992 J jnl
Transitions in Geometric Minimum Spanning Trees.
Discret. Comput. Geom.
Clyde L. Monma, Subhash Suri
1991 — ed.
Reliability Of Computer And Communication Networks, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, December 2-4, 1989
Reliability Of Computer And Communication Networks
Fred Roberts, Frank Hwang, Clyde L. Monma
1991 — conf
Transitions in Geometric Minimum Spanning Trees (Extended Abstract).
SCG
Clyde L. Monma, Subhash Suri
1990 J jnl
Computing Euclidean Maximum Spanning Trees.
Algorithmica
Clyde L. Monma, Mike Paterson, Subhash Suri, F. Frances Yao
1990 J jnl
Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions.
Math. Oper. Res.
Clyde L. Monma, Alexander Schrijver, Michael J. Todd, Victor K.-W. Wei
1990 J jnl
Further Development of a Primal-Dual Interior Point Method.
INFORMS J. Comput.
In Chan Choi, Clyde L. Monma, David F. Shanno
1990 J jnl
Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints.
SIAM J. Discret. Math.
Martin Grötschel, Clyde L. Monma
1990 J jnl
Minimum-Weight Two-Connected Spanning Networks.
Math. Program.
Clyde L. Monma, Beth Spellman Munson, William R. Pulleyblank
1990 J jnl
On the Complexity of Embedding Planar Graphs To Minimize Certain Distance Measures.
Algorithmica
Daniel Bienstock, Clyde L. Monma
1990 J jnl
On the Structure of Minimum-Weight
SIAM J. Discret. Math.
Daniel Bienstock, Ernest F. Brickell, Clyde L. Monma
1989 J jnl
An Implementation of a Primal-Dual Interior Point Method for Linear Programming.
INFORMS J. Comput.
Kevin A. McShane, Clyde L. Monma, David F. Shanno
1989 J jnl
Computer-aided design procedures for survivable fiber optic networks.
IEEE J. Sel. Areas Commun.
Richard H. Cardwell, Clyde L. Monma, Tsong-Ho Wu
1989 J jnl
Methods for Designing Communications Networks with Certain Two-Connected Survivability Constraints.
Oper. Res.
Clyde L. Monma, David F. Shallcross
1989 J jnl
On the Complexity of Scheduling with Batch Setup Times.
Oper. Res.
Clyde L. Monma, Chris N. Potts
1989 J jnl
Optimal enclosing regions in planar graphs.
Networks
Daniel Bienstock, Clyde L. Monma
1989 — conf
Polyhedral Approaches to Network Survivability.
Reliability Of Computer And Communication Networks
Martin Grötschel, Clyde L. Monma, Mechthild Stoer
1988 — conf
Computing Euclidean Maximum Spanning Trees.
SCG
Clyde L. Monma, Mike Paterson, Subhash Suri, F. Frances Yao
1988 J jnl
On the Complexity of Covering Vertices by Faces in a Planar Graph.
SIAM J. Comput.
Daniel Bienstock, Clyde L. Monma
1988 J jnl
Threshold tolerance graphs.
J. Graph Theory
Clyde L. Monma, Bruce A. Reed, William T. Trotter
1987 J jnl
Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions.
Math. Oper. Res.
Clyde L. Monma, Jeffrey B. Sidney
1987 J jnl
Send-and-Split Method for Minimum-Concave-Cost Network Flows.
Math. Oper. Res.
Ranel E. Erickson, Clyde L. Monma, Arthur F. Veinott Jr.
1986 J jnl
Backbone Network Design and Performance Analysis: A Methodology for Packet Switching Networks.
IEEE J. Sel. Areas Commun.
Clyde L. Monma, Diane Sheng
1986 J jnl
Intersection graphs of paths in a tree.
J. Comb. Theory B
Clyde L. Monma, Victor K.-W. Wei
1984 J jnl
Probabilistic analysis of interframe tie requirements for cross-connect systems.
AT&T Bell Lab. Tech. J.
Clyde L. Monma, Donald R. Smith
1984 J jnl
Tolerance graphs.
Discret. Appl. Math.
Martin Charles Golumbic, Clyde L. Monma, William T. Trotter
1982 J jnl
Linear-Time Algorithms for Scheduling on Parallel Processors.
Oper. Res.
Clyde L. Monma
1982 J jnl
Multigram codes.
IEEE Trans. Inf. Theory
Edgar N. Gilbert, Clyde L. Monma
1982 J jnl
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
Clyde L. Monma
1981 J jnl
Operations Research Support Methodology, Albert G. Holzman, Ed., Marcel Dekker, New York, 1979, 648 pp. Price $39.75.
Networks
Clyde L. Monma
1981 J jnl
Sequencing with general precedence constraints.
Discret. Appl. Math.
Clyde L. Monma
1980 J jnl
Sequencing to Minimize the Maximum Job Cost.
Oper. Res.
Clyde L. Monma
1979 J jnl
On perfect graphs and polyhedra with (0, 1)-valued extreme points.
Math. Program.
Clyde L. Monma, Leslie E. Trotter Jr.
1979 J jnl
Sequencing with Series-Parallel Precedence Constraints.
Math. Oper. Res.
Clyde L. Monma, Jeffrey B. Sidney
1979 J jnl
The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and Extensions.
Oper. Res.
Clyde L. Monma