default search action
Joachim Hyam Rubinstein
Person information
- affiliation: University of Melbourne, Department of Mathematics and Statistics
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j35]Peter Alexander Grossman
, David Kirszenblat, Marcus Brazil, J. Hyam Rubinstein, Doreen A. Thomas:
Curvature-constrained Steiner networks with three terminals. J. Glob. Optim. 90(3): 691-710 (2024) - 2022
- [j34]David Whittle
Solving the prize-collecting Euclidean Steiner tree problem. Int. Trans. Oper. Res. 29(3): 1479-1501 (2022) - [j33]David Whittle
Minimum Steiner trees on a set of concyclic points and their center. Int. Trans. Oper. Res. 29(4): 2201-2225 (2022) - [c7]Joachim Hyam Rubinstein, Benjamin I. P. Rubinstein:
Unlabelled Sample Compression Schemes for Intersection-Closed Classes and Extremal Classes. NeurIPS 2022 - [i3]J. Hyam Rubinstein, Benjamin I. P. Rubinstein
Unlabelled Sample Compression Schemes for Intersection-Closed Classes and Extremal Classes. CoRR abs/2210.05455 (2022) - 2020
- [j32]Peter Alexander Grossman
Scheduling the construction of value and discount weighted trees for maximum net present value. Comput. Oper. Res. 115: 104578 (2020) - [j31]Juan L. Yarmuch
Optimum ramp design in open pit mines. Comput. Oper. Res. 115: 104739 (2020)
2010 – 2019
- 2018
- [j30]David Whittle
Combined optimisation of an open-pit mine outline and the transition depth to underground mining. Eur. J. Oper. Res. 268(2): 624-634 (2018) - [j29]David Kirszenblat
Minimal curvature-constrained networks. J. Glob. Optim. 72(1): 71-87 (2018) - 2016
- [j28]K. G. Sirinanda, Marcus Brazil
Gradient-constrained discounted Steiner trees I: optimal tree configurations. J. Glob. Optim. 64(3): 497-513 (2016) - [j27]K. G. Sirinanda, Marcus Brazil
Gradient-constrained discounted Steiner trees II: optimally locating a discounted Steiner point. J. Glob. Optim. 64(3): 515-532 (2016) - 2015
- [j26]K. G. Sirinanda, Marcus Brazil
Maximizing the net present value of a Steiner tree. J. Glob. Optim. 62(2): 391-407 (2015) - [j25]Alan J. Chang, Marcus Brazil
Optimal curvature and gradient-constrained directional cost paths in 3-space. J. Glob. Optim. 62(3): 507-527 (2015) - 2014
- [j24]Marcus Brazil
Improving Underground Mine Access Layouts Using Software Tools. Interfaces 44(2): 195-203 (2014) - [i2]J. Hyam Rubinstein, Benjamin I. P. Rubinstein, Peter L. Bartlett:
Bounding Embeddings of VC Classes into Maximum Classes. CoRR abs/1401.7388 (2014) - 2013
- [j23]Peter Alexander Grossman
Minimal Curvature-Constrained Paths in the Plane with a Constraint on arcs with Opposite orientations. Int. J. Comput. Geom. Appl. 23(3): 171-196 (2013) - 2012
- [j22]Alan J. Chang, Marcus Brazil
Curvature-constrained directional-cost paths in the plane. J. Glob. Optim. 53(4): 663-681 (2012) - [j21]Benjamin I. P. Rubinstein, J. Hyam Rubinstein:
A Geometric Approach to Sample Compression. J. Mach. Learn. Res. 13: 1221-1261 (2012) - [j20]Marcus Brazil
Gradient-Constrained Minimum Networks. III. Fixed Topology. J. Optim. Theory Appl. 155(1): 336-354 (2012) - 2011
- [c6]Alan J. Chang, Marcus Brazil, Doreen A. Thomas, J. Hyam Rubinstein:
Optimal curvature-constrained paths with anisotropic costs in the plane. AuCC 2011: 112-117 - [c5]José Ayala-Hoffmann, Marcus Brazil, J. Hyam Rubinstein, Doreen A. Thomas:
Extendibility and path components of admissible paths for the Dubins problem. AuCC 2011: 440-444 - 2010
- [j19]Benjamin I. P. Rubinstein
Corrigendum to "Shifting: One-inclusion mistake bounds and sample compression" [J. Comput. System Sci 75 (1) (2009) 37-59]. J. Comput. Syst. Sci. 76(3-4): 278-280 (2010)
2000 – 2009
- 2009
- [j18]Benjamin I. P. Rubinstein
Shifting: One-inclusion mistake bounds and sample compression. J. Comput. Syst. Sci. 75(1): 37-59 (2009) - [i1]Benjamin I. P. Rubinstein, J. Hyam Rubinstein:
A Geometric Approach to Sample Compression. CoRR abs/0911.3633 (2009) - 2008
- [c4]J. Hyam Rubinstein, Benjamin I. P. Rubinstein:
Geometric & Topological Representations of Maximum Classes with Applications to Sample Compression. COLT 2008: 299-310 - 2007
- [c3]Marcus Brazil, Peter Alexander Grossman, David H. Lee, J. Hyam Rubinstein, Doreen A. Thomas, Nicholas C. Wormald:
Constrained Path Optimisation for Underground Mine Layout. World Congress on Engineering 2007: 856-861 - 2006
- [j17]J. Hyam Rubinstein
Approximations and Lower Bounds for the Length of Minimal Euclidean Steiner Trees. J. Glob. Optim. 35(4): 573-592 (2006) - [c2]Benjamin I. P. Rubinstein, Peter L. Bartlett, J. Hyam Rubinstein:
Shifting, One-Inclusion Mistake Bounds and Tight Multiclass Expected Risk Bounds. NIPS 2006: 1193-1200 - 2005
- [j16]J. Hyam Rubinstein, Robert Sinclair
Visualizing Ricci Flow of Manifolds of Revolution. Exp. Math. 14(3): 285-298 (2005) - 2001
- [j15]Marcus Brazil
Gradient-constrained minimum networks. I. Fundamentals. J. Glob. Optim. 21(2): 139-155 (2001) - [j14]J. Hyam Rubinstein
A polynomial algorithm for a constrained traveling salesman problem. Networks 38(2): 68-75 (2001) - 2000
- [j13]Jia F. Weng, J. Hyam Rubinstein:
A note on the compression theorem for convex surfaces. Discret. Math. 212(3): 257-260 (2000)
1990 – 1999
- 1997
- [j12]Iain R. Aitchison, J. Hyam Rubinstein:
Geodesic Surfaces in Knot Complements. Exp. Math. 6(2): 137-150 (1997) - [j11]J. Hyam Rubinstein, Jia F. Weng:
Compression Theorems and Steiner Ratios on Spheres. J. Comb. Optim. 1(1): 67-78 (1997) - [j10]Marcus Brazil, J. Hyam Rubinstein, Doreen A. Thomas, Jia F. Weng, Nicholas C. Wormald:
Full Minimal Steiner Trees on Lattice Sets. J. Comb. Theory A 78(1): 51-91 (1997) - [j9]Marcus Brazil, J. Hyam Rubinstein, Doreen A. Thomas, Jia F. Weng, Nicholas C. Wormald:
Minimal Steiner Trees for Rectangular Arrays of Lattice Points. J. Comb. Theory A 79(2): 181-208 (1997) - [j8]J. Hyam Rubinstein, Doreen A. Thomas, Nicholas C. Wormald:
Steiner Trees for Terminals Constrained to Curves. SIAM J. Discret. Math. 10(1): 1-17 (1997) - [c1]Marcus Brazil, J. Hyam Rubinstein, Doreen A. Thomas, Jia F. Weng, Nicholas C. Wormald:
Shortest networks on spheres. Network Design: Connectivity and Facilities Location 1997: 453-461 - 1996
- [j7]Marcus Brazil
Minimal Steiner Trees for 2k×2k Square Lattices. J. Comb. Theory A 73(1): 91-110 (1996) - 1993
- [j6]Doreen A. Thomas
The Steiner Minimal Network for Convex Configurations. Discret. Comput. Geom. 9: 323-333 (1993) - 1992
- [j5]J. Hyam Rubinstein
Graham's Problem on Shortest Networks for Points on a Circle. Algorithmica 7(2&3): 193-218 (1992) - [j4]J. Hyam Rubinstein
The Steiner Ration Conjecture for Cocircular Points. Discret. Comput. Geom. 7: 77-86 (1992) - [j3]J. Hyam Rubinstein, Doreen A. Thomas, Jia F. Weng:
Degree-five Steiner points cannot reduce network costs for planar sets. Networks 22(6): 531-537 (1992) - 1991
- [j2]J. Hyam Rubinstein
A variational approach to the Steiner network problem. Ann. Oper. Res. 33(6): 481-499 (1991) - [j1]J. Hyam Rubinstein
The Steiner ratio conjecture for six points. J. Comb. Theory A 58(1): 54-77 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: