J. F. Weng - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 34 from 34

2010

Computing Steiner points for gradient-constrained minimum networksD. A. Thomas, J. F. Weng. disopt, 7(1-2):21-31, 2010. [doi]

2009

Optimum Steiner ratio for gradient-constrained networks connecting three points in 3-space, part IK. Prendergast, D. A. Thomas, J. F. Weng. networks, 53(2):212-220, 2009. [doi]

2008

Gradient-constrained minimum networks (II). Labelled or locally minimal Steiner pointsMarcus Brazil, D. A. Thomas, J. F. Weng. jgo, 42(1):23-37, 2008. [doi]

Equivalence, Indicators, Quasi-indicators and Optimal Steiner Topologies on Four Points in SpaceJ. F. Weng, James MacGregor Smith, Marcus Brazil, D. A. Thomas. FUIN, 84(1):135-149, 2008. [doi]

2006

Canonical Forms and Algorithms for Steiner Trees in Uniform Orientation MetricsMarcus Brazil, D. A. Thomas, J. F. Weng, Martin Zachariasen. algorithmica, 44(4):281-300, 2006. [doi]

Locally minimal uniformly oriented shortest networksMarcus Brazil, D. A. Thomas, J. F. Weng. DAM, 154(18):2545-2564, 2006. [doi]

Minimum cost flow-dependent communication networksD. A. Thomas, J. F. Weng. networks, 48(1):39-46, 2006. [doi]

2002

Forbidden subpaths for Steiner minimum networks in uniform orientation metricsMarcus Brazil, D. A. Thomas, J. F. Weng. networks, 39(4):186-202, 2002. [doi]

Performance analysis of nonlinear RLS in mixture noiseShu Hung Leung, Y. Xiong, J. F. Weng, C. F. So, W. H. Lau. iscas 2002: 357-360 [doi]

2001

Steiner Minimal Trees with One Polygonal ObstacleJ. F. Weng, J. MacGregor Smith. algorithmica, 29(4):638-648, 2001. [doi]

Steiner Trees on Curved SurfacesJ. F. Weng. gc, 17(2):353-363, 2001. [doi]

2000

On the Complexity of the Steiner ProblemMarcus Brazil, D. A. Thomas, J. F. Weng. jco, 4(2):187-195, 2000.

Minimum Networks in Uniform Orientation MetricsMarcus Brazil, D. A. Thomas, J. F. Weng. SICOMP, 30(5):1579-1593, 2000. [doi]

A note on the compression theorem for convex surfacesJ. F. Weng, J. H. Rubinstein. DM, 212(3):257-260, 2000. [doi]

1999

A polynomial time algorithm for rectilinear Steiner trees with terminals constrained to curvesMarcus Brazil, D. A. Thomas, J. F. Weng. networks, 33(2):145-155, 1999. [doi]

Pseudo-Gilbert-Steiner treesDan Trietsch, J. F. Weng. networks, 33(3):175-178, 1999. [doi]

1997

Minimal Steiner Trees for Rectangular Arrays of Lattice PointsMarcus Brazil, J. H. Rubinstein, D. A. Thomas, J. F. Weng, Nicholas C. Wormald. JCT, 79(2):181-208, 1997. [doi]

Full Minimal Steiner Trees on Lattice SetsMarcus Brazil, J. H. Rubinstein, D. A. Thomas, J. F. Weng, Nicholas C. Wormald. JCT, 78(1):51-91, 1997. [doi]

Compression Theorems and Steiner Ratios on SpheresJ. H. Rubinstein, J. F. Weng. jco, 1(1):67-78, 1997.

Expansion of Linear Steiner TreesJ. F. Weng. algorithmica, 19(3):318-330, 1997.

Linear Steiner Trees for Infinite SpiralsJ. F. Weng. siamdm, 10(3):388-398, 1997. [doi]

A new model of generalized Steiner trees and 3-coordinate systemsJ. F. Weng. dimacs 1998: 415-424

1996

1995

Steiner minimal trees on regular polygons with centreJ. F. Weng, R. S. Booth. DM, 141(1-3):259-274, 1995. [doi]

1994

Variational approach and Steiner minimal trees on four pointsJ. F. Weng. DM, 132(1-3):349-362, 1994. [doi]

1993

An optimal group testing algorithm on k disjoint setsJ. F. Weng, Frank K. Hwang. orl, 13(1):43-44, 1993. [doi]

1992

Steiner Minimal Trees for a Class of Zigzag LinesR. S. Booth, J. F. Weng. algorithmica, 7(2&3):231-246, 1992.

The Shortest Network under a Given TopologyFrank K. Hwang, J. F. Weng. jal, 13(3):468-488, 1992.

Degenerate Gilbert - Steiner treesJ. F. Weng. networks, 22(4):335-348, 1992. [doi]

1988

Optimal Detection of Two Defectives with a Parity Check DeviceXian M. Chang, Frank K. Hwang, J. F. Weng. siamdm, 1(1):38-44, 1988.

1987

Steiner Minimal Trees for Regular PolygonsDing-Zhu Du, Frank K. Hwang, J. F. Weng. dcg, 2:65-84, 1987.

1986

Hexagonal coordinate systems and steiner minimal treesFrank K. Hwang, J. F. Weng. DM, 62(1):49-57, 1986. [doi]

Sign in or sign up to see more results.

runs on WebDSL