 | 2009 |
| 24 |  | Marcus Brazil,
D. A. Thomas,
Benny K. Nielsen,
Pawel Winter,
Christian Wulff-Nilsen,
Martin Zachariasen:
A novel approach to phylogenetic trees: d-Dimensional geometric Steiner trees.
Networks 53(2): 104-111 (2009) |
| 23 |  | K. Prendergast,
D. A. Thomas,
J. F. Weng:
Optimum Steiner ratio for gradient-constrained networks connecting three points in 3-space, part I.
Networks 53(2): 212-220 (2009) |
| 2008 |
| 22 |  | J. F. Weng,
James MacGregor Smith,
Marcus Brazil,
D. A. Thomas:
Equivalence, Indicators, Quasi-indicators and Optimal Steiner Topologies on Four Points in Space.
Fundam. Inform. 84(1): 135-149 (2008) |
| 21 |  | Marcus Brazil,
D. A. Thomas,
J. F. Weng:
Gradient-constrained minimum networks (II). Labelled or locally minimal Steiner points.
J. Global Optimization 42(1): 23-37 (2008) |
| 2007 |
| 20 |  | Marcus Brazil,
Mark Morelande,
B. Moran,
D. A. Thomas:
Distributed Self-Localisation in Sensor Networks using RIPS Measurements.
World Congress on Engineering 2007: 1476-1481 |
| 19 |  | Marcus Brazil,
P. A. Grossman,
D. H. Lee,
J. H. Rubinstein,
D. A. Thomas,
Nicholas C. Wormald:
Constrained Path Optimisation for Underground Mine Layout.
World Congress on Engineering 2007: 856-861 |
| 18 |  | Marcus Brazil,
D. A. Thomas:
Network optimization for the design of underground mines.
Networks 49(1): 40-50 (2007) |
| 2006 |
| 17 |  | Marcus Brazil,
D. A. Thomas,
J. F. Weng,
Martin Zachariasen:
Canonical Forms and Algorithms for Steiner Trees in Uniform Orientation Metrics.
Algorithmica 44(4): 281-300 (2006) |
| 16 |  | Marcus Brazil,
D. A. Thomas,
J. F. Weng:
Locally minimal uniformly oriented shortest networks.
Discrete Applied Mathematics 154(18): 2545-2564 (2006) |
| 15 |  | D. A. Thomas,
J. F. Weng:
Minimum cost flow-dependent communication networks.
Networks 48(1): 39-46 (2006) |
| 2002 |
| 14 |  | Marcus Brazil,
D. A. Thomas,
J. F. Weng:
Forbidden subpaths for Steiner minimum networks in uniform orientation metrics.
Networks 39(4): 186-202 (2002) |
| 2001 |
| 13 |  | J. H. Rubinstein,
D. A. Thomas,
Nicholas C. Wormald:
A polynomial algorithm for a constrained traveling salesman problem.
Networks 38(2): 68-75 (2001) |
| 2000 |
| 12 |  | Marcus Brazil,
D. A. Thomas,
J. F. Weng:
On the Complexity of the Steiner Problem.
J. Comb. Optim. 4(2): 187-195 (2000) |
| 11 |  | Marcus Brazil,
D. A. Thomas,
J. F. Weng:
Minimum Networks in Uniform Orientation Metrics.
SIAM J. Comput. 30(5): 1579-1593 (2000) |
| 1999 |
| 10 |  | Marcus Brazil,
D. A. Thomas,
J. F. Weng:
A polynomial time algorithm for rectilinear Steiner trees with terminals constrained to curves.
Networks 33(2): 145-155 (1999) |
| 1997 |
| 9 |  | Marcus Brazil,
J. H. Rubinstein,
D. A. Thomas,
J. F. Weng,
Nicholas C. Wormald:
Full Minimal Steiner Trees on Lattice Sets.
J. Comb. Theory, Ser. A 78(1): 51-91 (1997) |
| 8 |  | Marcus Brazil,
J. H. Rubinstein,
D. A. Thomas,
J. F. Weng,
Nicholas C. Wormald:
Minimal Steiner Trees for Rectangular Arrays of Lattice Points.
J. Comb. Theory, Ser. A 79(2): 181-208 (1997) |
| 7 |  | J. H. Rubinstein,
D. A. Thomas,
Nicholas C. Wormald:
Steiner Trees for Terminals Constrained to Curves.
SIAM J. Discrete Math. 10(1): 1-17 (1997) |
| 1996 |
| 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.
J. Comb. Theory, Ser. A 73(1): 91-110 (1996) |
| 1993 |
| 5 |  | D. A. Thomas,
J. H. Rubinstein,
T. Cole:
The Steiner Minimal Network for Convex Configurations.
Discrete & Computational Geometry 9: 323-333 (1993) |
| 1992 |
| 4 |  | J. H. Rubinstein,
D. A. Thomas:
Graham's Problem on Shortest Networks for Points on a Circle.
Algorithmica 7(2&3): 193-218 (1992) |
| 3 |  | J. H. Rubinstein,
D. A. Thomas:
The Steiner Ration Conjecture for Cocircular Points.
Discrete & Computational Geometry 7: 77-86 (1992) |
| 1991 |
| 2 |  | J. H. Rubinstein,
D. A. Thomas:
The Steiner ratio conjecture for six points.
J. Comb. Theory, Ser. A 58(1): 54-77 (1991) |
| 1977 |
| 1 |  | D. A. Thomas,
B. Pagurek,
Raymond J. A. Buhr:
Validation Algorithms for Pointer Values in DBTG DataBases.
ACM Trans. Database Syst. 2(4): 352-369 (1977) |