default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJia F. Weng
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j25]Doreen A. Thomas
, Jia F. Weng:
Euclidean Steiner trees optimal with respect to swapping 4-point subtrees. Optim. Lett. 8(4): 1337-1359 (2014)- 2012
- [j24]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) - [i1]J. Scott Provan, Marcus Brazil, Doreen A. Thomas, Jia F. Weng:
Minimum Opaque Covers for Polygonal Regions. CoRR abs/1210.8139 (2012) - 2011
- [j23]Jia F. Weng, Doreen A. Thomas, Iven Mareels:
Maximum Parsimony, Substitution Model, and Probability Phylogenetic Trees. J. Comput. Biol. 18(1): 67-80 (2011) - [j22]Doreen A. Thomas, Kevin Prendergast, Jia F. Weng:
Optimum steiner ratio for gradient-constrained networks connecting three points in 3-space, part II: The gradient-constraint m satisfies 1 <= m <= sqrt(3). Networks 57(4): 354-361 (2011) - 2010
- [j21]Doreen A. Thomas, Jia F. Weng:
Computing Steiner points for gradient-constrained minimum networks. Discret. Optim. 7(1-2): 21-31 (2010) - [c3]Doreen A. Thomas, Jia F. Weng, Iven Mareels:
Corrected Statistical Distance and Probability Constrained Optimization in Reconstruction of Phylogenetic Trees. BICoB 2010: 196-201
2000 – 2009
- 2009
- [j20]Jia F. Weng, Doreen A. Thomas, Iven Mareels:
Identifying Steiner Minimal Trees on Four Points in Space. Discret. Math. Algorithms Appl. 1(3): 401-412 (2009) - [j19]Jia F. Weng, Iven Mareels, Doreen A. Thomas:
Computing Steiner Points and Probability Steiner Points in ℓ1 and ℓ2 Metric Spaces. Discret. Math. Algorithms Appl. 1(4): 541-554 (2009) - [j18]Kevin Prendergast, Doreen A. Thomas, Jia F. Weng:
Optimum Steiner ratio for gradient-constrained networks connecting three points in 3-space, part I. Networks 53(2): 212-220 (2009) - 2008
- [j17]Jia F. Weng, James MacGregor Smith, Marcus Brazil, Doreen A. Thomas:
Equivalence, Indicators, Quasi-indicators and Optimal Steiner Topologies on Four Points in Space. Fundam. Informaticae 84(1): 135-149 (2008) - [j16]Marcus Brazil, Doreen A. Thomas, Jia F. Weng:
Gradient-constrained minimum networks (II). Labelled or locally minimal Steiner points. J. Glob. Optim. 42(1): 23-37 (2008) - 2006
- [j15]Marcus Brazil, Doreen A. Thomas, Jia F. Weng, Martin Zachariasen:
Canonical Forms and Algorithms for Steiner Trees in Uniform Orientation Metrics. Algorithmica 44(4): 281-300 (2006) - [j14]Marcus Brazil, Doreen A. Thomas, Jia F. Weng:
Locally minimal uniformly oriented shortest networks. Discret. Appl. Math. 154(18): 2545-2564 (2006) - [j13]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) - [j12]Doreen A. Thomas, Jia F. Weng:
Minimum cost flow-dependent communication networks. Networks 48(1): 39-46 (2006) - 2002
- [j11]Marcus Brazil, Doreen A. Thomas, Jia F. Weng:
Forbidden subpaths for Steiner minimum networks in uniform orientation metrics. Networks 39(4): 186-202 (2002) - 2001
- [j10]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) - 2000
- [j9]Jia F. Weng, J. Hyam Rubinstein:
A note on the compression theorem for convex surfaces. Discret. Math. 212(3): 257-260 (2000) - [j8]Marcus Brazil, Doreen A. Thomas, Jia F. Weng:
On the Complexity of the Steiner Problem. J. Comb. Optim. 4(2): 187-195 (2000) - [j7]Marcus Brazil, Doreen A. Thomas, Jia F. Weng:
Minimum Networks in Uniform Orientation Metrics. SIAM J. Comput. 30(5): 1579-1593 (2000)
1990 – 1999
- 1999
- [j6]Marcus Brazil, Doreen A. Thomas, Jia F. Weng:
A polynomial time algorithm for rectilinear Steiner trees with terminals constrained to curves. Networks 33(2): 145-155 (1999) - 1997
- [j5]J. Hyam Rubinstein, Jia F. Weng:
Compression Theorems and Steiner Ratios on Spheres. J. Comb. Optim. 1(1): 67-78 (1997) - [j4]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) - [j3]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) - [c2]Marcus Brazil, Doreen A. Thomas, Jia F. Weng:
Gradient-constrained minimal Steiner trees. Network Design: Connectivity and Facilities Location 1997: 23-38 - [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
- [j2]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 A 73(1): 91-110 (1996) - 1992
- [j1]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)
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-06-10 21:22 CEST 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:
