The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

J. H. Rubinstein: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. J. H. Rubinstein, D. A. Thomas
    Graham's Problem on Shortest Networks for Points on a Circle. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1992, v:7, n:2&3, pp:193-218 [Journal]
  2. J. H. Rubinstein, D. A. Thomas
    The Steiner Ration Conjecture for Cocircular Points. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:7, n:, pp:77-86 [Journal]
  3. D. A. Thomas, J. H. Rubinstein, T. Cole
    The Steiner Minimal Network for Convex Configurations. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:9, n:, pp:323-333 [Journal]
  4. J. F. Weng, J. H. Rubinstein
    A note on the compression theorem for convex surfaces. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:212, n:3, pp:257-260 [Journal]
  5. J. H. Rubinstein, J. F. Weng
    Compression Theorems and Steiner Ratios on Spheres. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1997, v:1, n:1, pp:67-78 [Journal]
  6. Marcus Brazil, T. Cole, J. H. Rubinstein, D. A. Thomas, J. F. Weng, Nicholas C. Wormald
    Minimal Steiner Trees for 2k×2k Square Lattices. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1996, v:73, n:1, pp:91-110 [Journal]
  7. Marcus Brazil, J. H. Rubinstein, D. A. Thomas, J. F. Weng, Nicholas C. Wormald
    Minimal Steiner Trees for Rectangular Arrays of Lattice Points. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1997, v:79, n:2, pp:181-208 [Journal]
  8. Marcus Brazil, J. H. Rubinstein, D. A. Thomas, J. F. Weng, Nicholas C. Wormald
    Full Minimal Steiner Trees on Lattice Sets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1997, v:78, n:1, pp:51-91 [Journal]
  9. J. H. Rubinstein, D. A. Thomas
    The Steiner ratio conjecture for six points. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1991, v:58, n:1, pp:54-77 [Journal]
  10. J. H. Rubinstein, D. A. Thomas, Nicholas C. Wormald
    A polynomial algorithm for a constrained traveling salesman problem. [Citation Graph (0, 0)][DBLP]
    Networks, 2001, v:38, n:2, pp:68-75 [Journal]
  11. J. H. Rubinstein, D. A. Thomas, Nicholas C. Wormald
    Steiner Trees for Terminals Constrained to Curves. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1997, v:10, n:1, pp:1-17 [Journal]

  12. Constrained Path Optimisation for Underground Mine Layout. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.002secs
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