The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Clyde L. Monma: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.012secs, Finished in 0.013secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002