Clyde L. Monma

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 




NETPAD: An interactive graphics system for network modeling and optimization.
Oper. Res. Lett., 1995

Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements.
Oper. Res., 1995

Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times.
Oper. Res., 1993

Subtree and Substar Intersection Numbers.
Discret. Appl. Math., 1993

Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints.
SIAM J. Optim., 1992

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

Transitions in Geometric Minimum Spanning Trees.
Discret. Comput. Geom., 1992

Netpad: an Interactive Graphics System for Network Modeling and Optimization.
Proceedings of the Computer Science and Operations Research, 1992

Transitions in Geometric Minimum Spanning Trees (Extended Abstract).
Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints.
SIAM J. Discret. Math., 1990

On the Structure of Minimum-Weight <i>k</i>-Connected Spanning Networks.
SIAM J. Discret. Math., 1990

Minimum-Weight Two-Connected Spanning Networks.
Math. Program., 1990

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

Further Development of a Primal-Dual Interior Point Method.
INFORMS J. Comput., 1990

Computing Euclidean Maximum Spanning Trees.
Algorithmica, 1990

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

Optimal enclosing regions in planar graphs.
Networks, 1989

Computer-aided design procedures for survivable fiber optic networks.
IEEE J. Sel. Areas Commun., 1989

Methods for Designing Communications Networks with Certain Two-Connected Survivability Constraints.
Oper. Res., 1989

On the Complexity of Scheduling with Batch Setup Times.
Oper. Res., 1989

An Implementation of a Primal-Dual Interior Point Method for Linear Programming.
INFORMS J. Comput., 1989

Polyhedral Approaches to Network Survivability.
Proceedings of the Reliability Of Computer And Communication Networks, 1989

On the Complexity of Covering Vertices by Faces in a Planar Graph.
SIAM J. Comput., 1988

Threshold tolerance graphs.
J. Graph Theory, 1988

Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions.
Math. Oper. Res., 1987

Send-and-Split Method for Minimum-Concave-Cost Network Flows.
Math. Oper. Res., 1987

Backbone Network Design and Performance Analysis: A Methodology for Packet Switching Networks.
IEEE J. Sel. Areas Commun., 1986

Intersection graphs of paths in a tree.
J. Comb. Theory, Ser. B, 1986

Tolerance graphs.
Discret. Appl. Math., 1984

Probabilistic analysis of interframe tie requirements for cross-connect systems.
AT&T Bell Lab. Tech. J., 1984

Multigram codes.
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.
Networks, 1982

Linear-Time Algorithms for Scheduling on Parallel Processors.
Oper. Res., 1982

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

Sequencing with general precedence constraints.
Discret. Appl. Math., 1981

Sequencing to Minimize the Maximum Job Cost.
Oper. Res., 1980

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

Sequencing with Series-Parallel Precedence Constraints.
Math. Oper. Res., 1979

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