# Clyde L. Monma

According to our database

Collaborative distances:

^{1}, Clyde L. Monma authored at least 39 papers between 1979 and 1995.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

1995

Oper. Res. Lett., 1995

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

Oper. Res., 1995

1993

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

Oper. Res., 1993

Discret. Appl. Math., 1993

1992

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

Discret. Comput. Geom., 1992

Proceedings of the Computer Science and Operations Research, 1992

1991

Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

1990

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

SIAM J. Discret. Math., 1990

SIAM J. Discret. Math., 1990

Math. Program., 1990

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

Math. Oper. Res., 1990

INFORMS J. Comput., 1990

Algorithmica, 1990

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

Algorithmica, 1990

1989

Networks, 1989

IEEE J. Sel. Areas Commun., 1989

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

Oper. Res., 1989

Oper. Res., 1989

INFORMS J. Comput., 1989

Proceedings of the Reliability Of Computer And Communication Networks, 1989

1988

SIAM J. Comput., 1988

J. Graph Theory, 1988

1987

Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions.

Math. Oper. Res., 1987

Math. Oper. Res., 1987

1986

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

IEEE J. Sel. Areas Commun., 1986

J. Comb. Theory, Ser. B, 1986

1984

Discret. Appl. Math., 1984

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

1982

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

Oper. Res., 1982

1981

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

Networks, 1981

Discret. Appl. Math., 1981

1980

Oper. Res., 1980

1979

Math. Program., 1979

Math. Oper. Res., 1979

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

Oper. Res., 1979