2007 |
12 | | 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 |
2001 |
11 | EE | 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 |
10 | EE | J. F. Weng,
J. H. Rubinstein:
A note on the compression theorem for convex surfaces.
Discrete Mathematics 212(3): 257-260 (2000) |
1997 |
9 | | J. H. Rubinstein,
J. F. Weng:
Compression Theorems and Steiner Ratios on Spheres.
J. Comb. Optim. 1(1): 67-78 (1997) |
8 | EE | 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) |
7 | EE | 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) |
6 | EE | 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 |
5 | EE | 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 |
4 | | D. A. Thomas,
J. H. Rubinstein,
T. Cole:
The Steiner Minimal Network for Convex Configurations.
Discrete & Computational Geometry 9: 323-333 (1993) |
1992 |
3 | | J. H. Rubinstein,
D. A. Thomas:
Graham's Problem on Shortest Networks for Points on a Circle.
Algorithmica 7(2&3): 193-218 (1992) |
2 | | J. H. Rubinstein,
D. A. Thomas:
The Steiner Ration Conjecture for Cocircular Points.
Discrete & Computational Geometry 7: 77-86 (1992) |
1991 |
1 | EE | J. H. Rubinstein,
D. A. Thomas:
The Steiner ratio conjecture for six points.
J. Comb. Theory, Ser. A 58(1): 54-77 (1991) |