| 1993 |
|---|
| 12 | EE | Yi-Wu Chang,
Michael S. Jacobson,
Clyde L. Monma,
Douglas B. West:
Subtree and Substar Intersection Numbers.
Discrete Applied Mathematics 44(1-3): 205-220 (1993) |
| 1992 |
|---|
| 11 | | Clyde L. Monma,
Subhash Suri:
Transitions in Geometric Minimum Spanning Trees.
Discrete & Computational Geometry 8: 265-293 (1992) |
| 1991 |
|---|
| 10 | EE | Clyde L. Monma,
Subhash Suri:
Transitions in Geometric Minimum Spanning Trees (Extended Abstract).
Symposium on Computational Geometry 1991: 239-249 |
| 1990 |
|---|
| 9 | | Daniel Bienstock,
Clyde L. Monma:
On the Complexity of Embedding Planar Graphs To Minimize Certain Distance Measures.
Algorithmica 5(1): 93-109 (1990) |
| 8 | | Clyde L. Monma,
Mike Paterson,
Subhash Suri,
F. Frances Yao:
Computing Euclidean Maximum Spanning Trees.
Algorithmica 5(3): 407-419 (1990) |
| 7 | | Clyde L. Monma,
Beth Spellman Munson,
William R. Pulleyblank:
Minimum-Weight Two-Connected Spanning Networks.
Math. Program. 46: 153-171 (1990) |
| 6 | | Daniel Bienstock,
Ernest F. Brickell,
Clyde L. Monma:
On the Structure of Minimum-Weight k-Connected Spanning Networks.
SIAM J. Discrete Math. 3(3): 320-329 (1990) |
| 5 | | Martin Grötschel,
Clyde L. Monma:
Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints.
SIAM J. Discrete Math. 3(4): 502-523 (1990) |
| 1988 |
|---|
| 4 | EE | Clyde L. Monma,
Mike Paterson,
Subhash Suri,
F. Frances Yao:
Computing Euclidean Maximum Spanning Trees.
Symposium on Computational Geometry 1988: 241-251 |
| 3 | | Daniel Bienstock,
Clyde L. Monma:
On the Complexity of Covering Vertices by Faces in a Planar Graph.
SIAM J. Comput. 17(1): 53-76 (1988) |
| 1986 |
|---|
| 2 | EE | Clyde L. Monma,
Victor K.-W. Wei:
Intersection graphs of paths in a tree.
J. Comb. Theory, Ser. B 41(2): 141-181 (1986) |
| 1982 |
|---|
| 1 | | Edgar N. Gilbert,
Clyde L. Monma:
Multigram codes.
IEEE Transactions on Information Theory 28(2): 346- (1982) |
