Остановите войну!
for scientists:
default search action
Nicholas C. Wormald
- > Home > Persons > Nicholas C. Wormald
Publications
- 2012
- [j132]Marcus Brazil, J. Hyam Rubinstein, Doreen A. Thomas, Jia F. Weng, Nicholas C. Wormald:
Gradient-Constrained Minimum Networks. III. Fixed Topology. J. Optim. Theory Appl. 155(1): 336-354 (2012) - 2007
- [j109]Doreen A. Thomas, Marcus Brazil, David H. Lee, Nicholas C. Wormald:
Network modelling of underground mine layout: two case studies. Int. Trans. Oper. Res. 14(2): 143-158 (2007) - [c10]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
- [j101]J. Hyam Rubinstein, Jia F. Weng, Nicholas C. Wormald:
Approximations and Lower Bounds for the Length of Minimal Euclidean Steiner Trees. J. Glob. Optim. 35(4): 573-592 (2006) - 2001
- [j75]Marcus Brazil, J. Hyam Rubinstein, Doreen A. Thomas, Jia F. Weng, Nicholas C. Wormald:
Gradient-constrained minimum networks. I. Fundamentals. J. Glob. Optim. 21(2): 139-155 (2001) - [j73]J. Hyam Rubinstein, Doreen A. Thomas, Nicholas C. Wormald:
A polynomial algorithm for a constrained traveling salesman problem. Networks 38(2): 68-75 (2001) - 1997
- [j59]Marcus Brazil, J. Hyam Rubinstein, Doreen A. Thomas, Jia F. Weng, Nicholas C. Wormald:
Full Minimal Steiner Trees on Lattice Sets. J. Comb. Theory, Ser. A 78(1): 51-91 (1997) - [j58]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, Ser. A 79(2): 181-208 (1997) - [j54]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) - [c3]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
- [j48]Marcus Brazil, T. Cole, J. Hyam Rubinstein, Doreen A. Thomas, Jia F. Weng, Nicholas C. Wormald:
Minimal Steiner Trees for 2k×2k Square Lattices. J. Comb. Theory, Ser. A 73(1): 91-110 (1996)
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 2023-10-23 23:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint