Clyde L. Monma - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 40 from 40

1995

NETPAD: An interactive graphics system for network modeling and optimizationNathaniel Dean, Monika Mevenkamp, Clyde L. Monma. orl, 17(2):89-101, 1995. [doi]

Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability RequirementsMartin Grötschel, Clyde L. Monma, Mechthild Stoer. ior, 43(6):1012-1024, 1995. [doi]

1993

Subtree and Substar Intersection NumbersYi-Wu Chang, Michael S. Jacobson, Clyde L. Monma, Douglas B. West. DAM, 44(1-3):205-220, 1993. [doi]

Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup TimesClyde L. Monma, Chris N. Potts. ior, 41(5):981-993, 1993. [doi]

1992

1991

Transitions in Geometric Minimum Spanning Trees (Extended Abstract)Clyde L. Monma, Subhash Suri. compgeom 1991: 239-249 [doi]

1990

On the Structure of Minimum-Weight ::::k::::-Connected Spanning NetworksDaniel Bienstock, Ernest F. Brickell, Clyde L. Monma. siamdm, 3(3):320-329, 1990.

On the Complexity of Embedding Planar Graphs To Minimize Certain Distance MeasuresDaniel Bienstock, Clyde L. Monma. algorithmica, 5(1):93-109, 1990.

Further Development of a Primal-Dual Interior Point MethodIn-Chan Choi, Clyde L. Monma, David F. Shanno. informs, 2(4):304-311, 1990. [doi]

Integer Polyhedra Arising from Certain Network Design Problems with Connectivity ConstraintsMartin Grötschel, Clyde L. Monma. siamdm, 3(4):502-523, 1990.

Minimum-Weight Two-Connected Spanning NetworksClyde L. Monma, Beth Spellman Munson, William R. Pulleyblank. mp, 46:153-171, 1990.

Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and ExtensionsClyde L. Monma, Alexander Schrijver, Michael J. Todd, Victor K.-W. Wei. mor, 15(4):736-748, 1990. [doi]

Computing Euclidean Maximum Spanning TreesClyde L. Monma, Mike Paterson, Subhash Suri, F. Frances Yao. algorithmica, 5(3):407-419, 1990.

1989

1988

On the Complexity of Covering Vertices by Faces in a Planar GraphDaniel Bienstock, Clyde L. Monma. SICOMP, 17(1):53-76, 1988.

Threshold tolerance graphsClyde L. Monma, Bruce Reed, William T. Trotter. jgt, 12(3):343-362, 1988. [doi]

Computing Euclidean Maximum Spanning TreesClyde L. Monma, Mike Paterson, Subhash Suri, F. Frances Yao. compgeom 1988: 241-251 [doi]

1987

Send-and-Split Method for Minimum-Concave-Cost Network FlowsRanel E. Erickson, Clyde L. Monma, Arthur F. Veinott Jr.. mor, 12(4):634-664, 1987. [doi]

Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing FunctionsClyde L. Monma, Jeffrey B. Sidney. mor, 12(1):22-31, 1987. [doi]

1986

Intersection graphs of paths in a treeClyde L. Monma, Victor K.-W. Wei. JCT, 41(2):141-181, 1986. [doi]

Backbone Network Design and Performance Analysis: A Methodology for Packet Switching NetworksClyde L. Monma, Diane Sheng. jsac, 4(6):946-965, 1986. [doi]

1984

Tolerance graphsMartin Charles Golumbic, Clyde L. Monma, William T. Trotter. DAM, 9(2):157-170, 1984. [doi]

Probabilistic analysis of interframe tie requirements for cross-connect systemsClyde L. Monma, Donald R. Smith. bstj, 63(4):643-664, 1984. [doi]

1982

Multigram codesEdgar N. Gilbert, Clyde L. Monma. TIT, 28(2):346, 1982.

Network flow programming, by P. A. Jensen and J. W. Barnes, John Wiley and Sons, Inc., New York, 1980, 408 pp. Price: $28.95Clyde L. Monma. networks, 12(3):351, 1982. [doi]

Linear-Time Algorithms for Scheduling on Parallel ProcessorsClyde L. Monma. ior, 30(1):116-124, 1982. [doi]

1981

Operations Research Support Methodology, Albert G. Holzman, Ed., Marcel Dekker, New York, 1979, 648 pp. Price $39.75Clyde L. Monma. networks, 11(3):321-322, 1981. [doi]

Sequencing with general precedence constraintsClyde L. Monma. DAM, 3(2):137-150, 1981. [doi]

1980

Sequencing to Minimize the Maximum Job CostClyde L. Monma. ior, 28(4):942-951, 1980. [doi]

1979

On perfect graphs and polyhedra with (0, 1)-valued extreme pointsClyde L. Monma, Leslie E. Trotter Jr.. mp, 17(1):239-242, 1979. [doi]

Sequencing with Series-Parallel Precedence ConstraintsClyde L. Monma, Jeffrey B. Sidney. mor, 4(3):215-224, 1979. [doi]

The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and ExtensionsClyde L. Monma. ior, 27(4):792-798, 1979. [doi]

Sign in or sign up to see more results.

runs on WebDSL