Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.

Clyde L. Monma

1990 – 1999

see FAQ

What is the meaning of the colors in the publication list?

1993
[j16]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/dam/ChangJMW93
- ask others
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
[j15]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/dcg/MonmaS92
- ask others
Clyde L. Monma, Subhash Suri: Transitions in Geometric Minimum Spanning Trees. Discrete & Computational Geometry 8: 265-293 (1992)
1991
[c2]
- view
  - electronic edition @ acm.org
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/compgeom/MonmaS91
- ask others
Clyde L. Monma, Subhash Suri: Transitions in Geometric Minimum Spanning Trees (Extended Abstract). Symposium on Computational Geometry 1991: 239-249
1990
[j14]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/algorithmica/BienstockM90
- ask others
Daniel Bienstock, Clyde L. Monma: On the Complexity of Embedding Planar Graphs To Minimize Certain Distance Measures. Algorithmica 5(1): 93-109 (1990)
[j13]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/algorithmica/MonmaPSY90
- ask others
Clyde L. Monma, Mike Paterson, Subhash Suri, F. Frances Yao: Computing Euclidean Maximum Spanning Trees. Algorithmica 5(3): 407-419 (1990)
[j12]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/informs/ChoiMS90
- ask others
In Chan Choi, Clyde L. Monma, David F. Shanno: Further Development of a Primal-Dual Interior Point Method. INFORMS Journal on Computing 2(4): 304-311 (1990)
[j11]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/mp/MonmaMP90
- ask others
Clyde L. Monma, Beth Spellman Munson, William R. Pulleyblank: Minimum-Weight Two-Connected Spanning Networks. Math. Program. 46: 153-171 (1990)
[j10]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/siamdm/BienstockBM90
- ask others
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)
[j9]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/siamdm/GrotschelM90
- ask others
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)

1980 – 1989

see FAQ

What is the meaning of the colors in the publication list?

1989
[j8]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/informs/McShaneMS89
- ask others
Kevin A. McShane, Clyde L. Monma, David F. Shanno: An Implementation of a Primal-Dual Interior Point Method for Linear Programming. INFORMS Journal on Computing 1(2): 70-83 (1989)
[j7]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/networks/BienstockM89
- ask others
Daniel Bienstock, Clyde L. Monma: Optimal enclosing regions in planar graphs. Networks 19(1): 79-94 (1989)
1988
[j6]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/jgt/MonmaRT88
- ask others
Clyde L. Monma, Bruce Reed, William T. Trotter: Threshold tolerance graphs. Journal of Graph Theory 12(3): 343-362 (1988)
[j5]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/siamcomp/BienstockM88
- ask others
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)
[c1]
- view
  - electronic edition @ acm.org
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/compgeom/MonmaPSY89
- ask others
Clyde L. Monma, Mike Paterson, Subhash Suri, F. Frances Yao: Computing Euclidean Maximum Spanning Trees. Symposium on Computational Geometry 1988: 241-251
1986
[j4]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/jct/MonmaW86
- ask others
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
[j3]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/networks/Monma82
- ask others
Clyde L. Monma: 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 12(3): 351 (1982)
[j2]
- no documents available
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/tit/GilbertM82
- ask others
Edgar N. Gilbert, Clyde L. Monma: Multigram codes. IEEE Transactions on Information Theory 28(2): 346- (1982)
1981
[j1]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/networks/Monma81
- ask others
Clyde L. Monma: Operations Research Support Methodology, Albert G. Holzman, Ed., Marcel Dekker, New York, 1979, 648 pp. Price $39.75. Networks 11(3): 321-322 (1981)