J. H. Rubinstein - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 20 from 20

2018

Minimal curvature-constrained networksD. Kirszenblat, K. G. Sirinanda, Marcus Brazil, Peter A. Grossman, J. H. Rubinstein, Doreen A. Thomas. jgo, 72(1):71-87, 2018. [doi]

2016

Gradient-constrained discounted Steiner trees II: optimally locating a discounted Steiner pointK. G. Sirinanda, Marcus Brazil, Peter A. Grossman, J. H. Rubinstein, Doreen A. Thomas. jgo, 64(3):515-532, 2016. [doi]

Gradient-constrained discounted Steiner trees I: optimal tree configurationsK. G. Sirinanda, Marcus Brazil, Peter A. Grossman, J. H. Rubinstein, Doreen A. Thomas. jgo, 64(3):497-513, 2016. [doi]

2013

Minimal Curvature-Constrained Paths in the Plane with a Constraint on arcs with Opposite orientationsP. A. Grossman, Marcus Brazil, J. H. Rubinstein, Doreen A. Thomas. ijcga, 23(3):171-196, 2013. [doi]

2012

Gradient-Constrained Minimum Networks. III. Fixed TopologyMarcus Brazil, J. H. Rubinstein, Doreen A. Thomas, Jia F. Weng, Nicholas C. Wormald. jota, 155(1):336-354, 2012. [doi]

2007

Constrained Path Optimisation for Underground Mine LayoutMarcus Brazil, P. A. Grossman, D. H. Lee, J. H. Rubinstein, D. A. Thomas, Nicholas C. Wormald. wce 2007: 856-861

2006

Approximations and Lower Bounds for the Length of Minimal Euclidean Steiner TreesJ. H. Rubinstein, Jia F. Weng, Nicholas C. Wormald. jgo, 35(4):573-592, 2006. [doi]

2001

A polynomial algorithm for a constrained traveling salesman problemJ. H. Rubinstein, D. A. Thomas, Nicholas C. Wormald. networks, 38(2):68-75, 2001. [doi]

2000

A note on the compression theorem for convex surfacesJ. F. Weng, J. H. Rubinstein. DM, 212(3):257-260, 2000. [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]

Steiner Trees for Terminals Constrained to CurvesJ. H. Rubinstein, D. A. Thomas, Nicholas C. Wormald. siamdm, 10(1):1-17, 1997. [doi]

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

1996

Minimal Steiner Trees for 2:::k:::×2:::k::: Square LatticesMarcus Brazil, T. Cole, J. H. Rubinstein, D. A. Thomas, J. F. Weng, Nicholas C. Wormald. JCT, 73(1):91-110, 1996. [doi]

1993

The Steiner Minimal Network for Convex ConfigurationsD. A. Thomas, J. H. Rubinstein, T. Cole. dcg, 9:323-333, 1993.

1992

Graham s Problem on Shortest Networks for Points on a CircleJ. H. Rubinstein, D. A. Thomas. algorithmica, 7(2&3):193-218, 1992.

The Steiner Ration Conjecture for Cocircular PointsJ. H. Rubinstein, D. A. Thomas. dcg, 7:77-86, 1992.

Degree-five Steiner points cannot reduce network costs for planar setsJ. H. Rubinstein, Doreen A. Thomas, Jia F. Weng. networks, 22(6):531-537, 1992. [doi]

1991

The Steiner ratio conjecture for six pointsJ. H. Rubinstein, D. A. Thomas. JCT, 58(1):54-77, 1991. [doi]

A variational approach to the Steiner network problemJ. H. Rubinstein, D. A. Thomas. anor, 33(6):481-499, 1991. [doi]

Sign in or sign up to see more results.

runs on WebDSL