Clyde L. Monma

According to our database, Clyde L. Monma authored at least 39 papers between 1979 and 1995.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

1995

NETPAD: An interactive graphics system for network modeling and optimization.

Nathaniel Dean, Monika Mevenkamp, Clyde L. Monma

Oper. Res. Lett., 1995

Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements.

Martin Grötschel, Clyde L. Monma, Mechthild Stoer

Oper. Res., 1995

1993

Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times.

Clyde L. Monma, Chris N. Potts

Oper. Res., 1993

Subtree and Substar Intersection Numbers.

Yi-Wu Chang, Michael S. Jacobson, Clyde L. Monma, Douglas B. West

Discret. Appl. Math., 1993

1992

Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints.

Martin Grötschel, Clyde L. Monma, Mechthild Stoer

SIAM J. Optim., 1992

Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints.

Martin Grötschel, Clyde L. Monma, Mechthild Stoer

Oper. Res., 1992

Transitions in Geometric Minimum Spanning Trees.

Clyde L. Monma, Subhash Suri

Discret. Comput. Geom., 1992

Netpad: an Interactive Graphics System for Network Modeling and Optimization.

Nathaniel Dean, Monika Mevenkamp, Clyde L. Monma

Proceedings of the Computer Science and Operations Research, 1992

1991

Transitions in Geometric Minimum Spanning Trees (Extended Abstract).

Clyde L. Monma, Subhash Suri

Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

1990

Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints.

Martin Grötschel, Clyde L. Monma

SIAM J. Discret. Math., 1990

On the Structure of Minimum-Weight <i>k</i>-Connected Spanning Networks.

Daniel Bienstock, Ernest F. Brickell, Clyde L. Monma

SIAM J. Discret. Math., 1990

Minimum-Weight Two-Connected Spanning Networks.

Clyde L. Monma, Beth Spellman Munson, William R. Pulleyblank

Math. Program., 1990

Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions.

Clyde L. Monma, Alexander Schrijver, Michael J. Todd, Victor K.-W. Wei

Math. Oper. Res., 1990

Further Development of a Primal-Dual Interior Point Method.

In Chan Choi, Clyde L. Monma, David F. Shanno

INFORMS J. Comput., 1990

Computing Euclidean Maximum Spanning Trees.

Clyde L. Monma, Mike Paterson, Subhash Suri, F. Frances Yao

Algorithmica, 1990

On the Complexity of Embedding Planar Graphs To Minimize Certain Distance Measures.

Daniel Bienstock, Clyde L. Monma

Algorithmica, 1990

1989

Optimal enclosing regions in planar graphs.

Daniel Bienstock, Clyde L. Monma

Networks, 1989

Computer-aided design procedures for survivable fiber optic networks.

Richard H. Cardwell, Clyde L. Monma, Tsong-Ho Wu

IEEE J. Sel. Areas Commun., 1989

Methods for Designing Communications Networks with Certain Two-Connected Survivability Constraints.

Clyde L. Monma, David F. Shallcross

Oper. Res., 1989

On the Complexity of Scheduling with Batch Setup Times.

Clyde L. Monma, Chris N. Potts

Oper. Res., 1989

An Implementation of a Primal-Dual Interior Point Method for Linear Programming.

Kevin A. McShane, Clyde L. Monma, David F. Shanno

INFORMS J. Comput., 1989

Polyhedral Approaches to Network Survivability.

Martin Grötschel, Clyde L. Monma, Mechthild Stoer

Proceedings of the Reliability Of Computer And Communication Networks, 1989

1988

On the Complexity of Covering Vertices by Faces in a Planar Graph.

Daniel Bienstock, Clyde L. Monma

SIAM J. Comput., 1988

Threshold tolerance graphs.

Clyde L. Monma, Bruce A. Reed, William T. Trotter

J. Graph Theory, 1988

1987

Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions.

Clyde L. Monma, Jeffrey B. Sidney

Math. Oper. Res., 1987

Send-and-Split Method for Minimum-Concave-Cost Network Flows.

Ranel E. Erickson, Clyde L. Monma, Arthur F. Veinott Jr.

Math. Oper. Res., 1987

1986

Backbone Network Design and Performance Analysis: A Methodology for Packet Switching Networks.

Clyde L. Monma, Diane Sheng

IEEE J. Sel. Areas Commun., 1986

Intersection graphs of paths in a tree.

Clyde L. Monma, Victor K.-W. Wei

J. Comb. Theory B, 1986

1984

Tolerance graphs.

Martin Charles Golumbic, Clyde L. Monma, William T. Trotter

Discret. Appl. Math., 1984

Probabilistic analysis of interframe tie requirements for cross-connect systems.

Clyde L. Monma, Donald R. Smith

AT&T Bell Lab. Tech. J., 1984

1982

Multigram codes.

Edgar N. Gilbert, Clyde L. Monma

IEEE Trans. Inf. Theory, 1982

Network flow programming, by P. A. Jensen and J. W. Barnes, John Wiley and Sons, Inc., New York, 1980, 408 pp. Price: $28.95.

Clyde L. Monma

Networks, 1982

Linear-Time Algorithms for Scheduling on Parallel Processors.

Clyde L. Monma

Oper. Res., 1982

1981

Operations Research Support Methodology, Albert G. Holzman, Ed., Marcel Dekker, New York, 1979, 648 pp. Price $39.75.

Clyde L. Monma

Networks, 1981

Sequencing with general precedence constraints.

Clyde L. Monma

Discret. Appl. Math., 1981

1980

Sequencing to Minimize the Maximum Job Cost.

Clyde L. Monma

Oper. Res., 1980

1979

On perfect graphs and polyhedra with (0, 1)-valued extreme points.

Clyde L. Monma, Leslie E. Trotter Jr.

Math. Program., 1979

Sequencing with Series-Parallel Precedence Constraints.

Clyde L. Monma, Jeffrey B. Sidney

Math. Oper. Res., 1979

The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and Extensions.

Clyde L. Monma

Oper. Res., 1979