Search the dblp DataBase

Publications of Author

1. Marcus Brazil, D. A. Thomas, J. F. Weng, Martin Zachariasen
   Canonical Forms and Algorithms for Steiner Trees in Uniform Orientation Metrics. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 2006, v:44, n:4, pp:281-300 [Journal]
   
2. 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]
   
3. Marcus Brazil, D. A. Thomas, J. F. Weng
   Locally minimal uniformly oriented shortest networks. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2006, v:154, n:18, pp:2545-2564 [Journal]
   
4. 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]
   
5. 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]
   
6. Marcus Brazil, D. A. Thomas, J. F. Weng
   On the Complexity of the Steiner Problem. [Citation Graph (0, 0)][DBLP]
   J. Comb. Optim., 2000, v:4, n:2, pp:187-195 [Journal]
   
7. Marcus Brazil, T. Cole, J. H. Rubinstein, D. A. Thomas, J. F. Weng, Nicholas C. Wormald
   Minimal Steiner Trees for 2^k×2^k Square Lattices. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. A, 1996, v:73, n:1, pp:91-110 [Journal]
   
8. 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]
   
9. 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]
   
10. 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]
    
11. Marcus Brazil, D. A. Thomas, J. F. Weng
    Forbidden subpaths for Steiner minimum networks in uniform orientation metrics. [Citation Graph (0, 0)][DBLP]
    Networks, 2002, v:39, n:4, pp:186-202 [Journal]
    
12. Marcus Brazil, D. A. Thomas, J. F. Weng
    A polynomial time algorithm for rectilinear Steiner trees with terminals constrained to curves. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:33, n:2, pp:145-155 [Journal]
    
13. 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]
    
14. D. A. Thomas, J. F. Weng
    Minimum cost flow-dependent communication networks. [Citation Graph (0, 0)][DBLP]
    Networks, 2006, v:48, n:1, pp:39-46 [Journal]
    
15. Marcus Brazil, D. A. Thomas, J. F. Weng
    Minimum Networks in Uniform Orientation Metrics. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:5, pp:1579-1593 [Journal]
    
16. 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]
    
17. D. A. Thomas, B. Pagurek, Raymond J. A. Buhr
    Validation Algorithms for Pointer Values in DBTG DataBases. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Database Syst., 1977, v:2, n:4, pp:352-369 [Journal]
    
18. 
    Constrained Path Optimisation for Underground Mine Layout. [Citation Graph (, )][DBLP]
    
    
19. 
    Distributed Self-Localisation in Sensor Networks using RIPS Measurements. [Citation Graph (, )][DBLP]