2009 |
27 | EE | 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 |
26 | EE | 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) |
2006 |
25 | EE | 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) |
24 | EE | Marcus Brazil,
D. A. Thomas,
J. F. Weng:
Locally minimal uniformly oriented shortest networks.
Discrete Applied Mathematics 154(18): 2545-2564 (2006) |
23 | EE | D. A. Thomas,
J. F. Weng:
Minimum cost flow-dependent communication networks.
Networks 48(1): 39-46 (2006) |
2002 |
22 | EE | Shu Hung Leung,
Y. Xiong,
J. F. Weng,
C. F. So,
W. H. Lau:
Performance analysis of nonlinear RLS in mixture noise.
ISCAS (5) 2002: 357-360 |
21 | EE | 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 |
20 | EE | J. F. Weng,
J. MacGregor Smith:
Steiner Minimal Trees with One Polygonal Obstacle.
Algorithmica 29(4): 638-648 (2001) |
19 | EE | J. F. Weng:
Steiner Trees on Curved Surfaces.
Graphs and Combinatorics 17(2): 353-363 (2001) |
2000 |
18 | EE | J. F. Weng,
J. H. Rubinstein:
A note on the compression theorem for convex surfaces.
Discrete Mathematics 212(3): 257-260 (2000) |
17 | | Marcus Brazil,
D. A. Thomas,
J. F. Weng:
On the Complexity of the Steiner Problem.
J. Comb. Optim. 4(2): 187-195 (2000) |
16 | EE | Marcus Brazil,
D. A. Thomas,
J. F. Weng:
Minimum Networks in Uniform Orientation Metrics.
SIAM J. Comput. 30(5): 1579-1593 (2000) |
1999 |
15 | EE | 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) |
14 | EE | Dan Trietsch,
J. F. Weng:
Pseudo-Gilbert-Steiner trees.
Networks 33(3): 175-178 (1999) |
1997 |
13 | | J. F. Weng:
Expansion of Linear Steiner Trees.
Algorithmica 19(3): 318-330 (1997) |
12 | | J. H. Rubinstein,
J. F. Weng:
Compression Theorems and Steiner Ratios on Spheres.
J. Comb. Optim. 1(1): 67-78 (1997) |
11 | 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) |
10 | 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) |
9 | EE | J. F. Weng:
Linear Steiner Trees for Infinite Spirals.
SIAM J. Discrete Math. 10(3): 388-398 (1997) |
1996 |
8 | 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) |
1995 |
7 | EE | J. F. Weng,
R. S. Booth:
Steiner minimal trees on regular polygons with centre.
Discrete Mathematics 141(1-3): 259-274 (1995) |
1994 |
6 | EE | J. F. Weng:
Variational approach and Steiner minimal trees on four points.
Discrete Mathematics 132(1-3): 349-362 (1994) |
1992 |
5 | | R. S. Booth,
J. F. Weng:
Steiner Minimal Trees for a Class of Zigzag Lines.
Algorithmica 7(2&3): 231-246 (1992) |
4 | | Frank K. Hwang,
J. F. Weng:
The Shortest Network under a Given Topology.
J. Algorithms 13(3): 468-488 (1992) |
1988 |
3 | | Xian M. Chang,
Frank K. Hwang,
J. F. Weng:
Optimal Detection of Two Defectives with a Parity Check Device.
SIAM J. Discrete Math. 1(1): 38-44 (1988) |
1987 |
2 | | Ding-Zhu Du,
Frank K. Hwang,
J. F. Weng:
Steiner Minimal Trees for Regular Polygons.
Discrete & Computational Geometry 2: 65-84 (1987) |
1986 |
1 | EE | Frank K. Hwang,
J. F. Weng:
Hexagonal coordinate systems and steiner minimal trees.
Discrete Mathematics 62(1): 49-57 (1986) |