Jia F. Weng

According to our database1, Jia F. Weng authored at least 29 papers between 1992 and 2014.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2014
Euclidean Steiner trees optimal with respect to swapping 4-point subtrees.
Optim. Lett., 2014

2012
Gradient-Constrained Minimum Networks. III. Fixed Topology.
J. Optim. Theory Appl., 2012

Minimum Opaque Covers for Polygonal Regions
CoRR, 2012

2011
Optimum steiner ratio for gradient-constrained networks connecting three points in 3-space, part II: The gradient-constraint <i>m</i> satisfies 1 <= m <= sqrt(3).
Networks, 2011

Maximum Parsimony, Substitution Model, and Probability Phylogenetic Trees.
J. Comput. Biol., 2011

2010
Computing Steiner points for gradient-constrained minimum networks.
Discret. Optim., 2010

Corrected Statistical Distance and Probability Constrained Optimization in Reconstruction of Phylogenetic Trees.
Proceedings of the ISCA 2nd International Conference on Bioinformatics and Computational Biology, 2010

2009
Optimum Steiner ratio for gradient-constrained networks connecting three points in 3-space, part I.
Networks, 2009

Identifying Steiner Minimal Trees on Four Points in Space.
Discret. Math. Algorithms Appl., 2009

Computing Steiner Points and Probability Steiner Points in ℓ<sub>1</sub> and ℓ<sub>2</sub> Metric Spaces.
Discret. Math. Algorithms Appl., 2009

2008
Gradient-constrained minimum networks (II). Labelled or locally minimal Steiner points.
J. Glob. Optim., 2008

Equivalence, Indicators, Quasi-indicators and Optimal Steiner Topologies on Four Points in Space.
Fundam. Informaticae, 2008

2006
Minimum cost flow-dependent communication networks.
Networks, 2006

Approximations and Lower Bounds for the Length of Minimal Euclidean Steiner Trees.
J. Glob. Optim., 2006

Locally minimal uniformly oriented shortest networks.
Discret. Appl. Math., 2006

Canonical Forms and Algorithms for Steiner Trees in Uniform Orientation Metrics.
Algorithmica, 2006

2002
Forbidden subpaths for Steiner minimum networks in uniform orientation metrics.
Networks, 2002

2001
Gradient-constrained minimum networks. I. Fundamentals.
J. Glob. Optim., 2001

2000
Minimum Networks in Uniform Orientation Metrics.
SIAM J. Comput., 2000

On the Complexity of the Steiner Problem.
J. Comb. Optim., 2000

A note on the compression theorem for convex surfaces.
Discret. Math., 2000

1999
A polynomial time algorithm for rectilinear Steiner trees with terminals constrained to curves.
Networks, 1999

1997
Full Minimal Steiner Trees on Lattice Sets.
J. Comb. Theory A, 1997

Minimal Steiner Trees for Rectangular Arrays of Lattice Points.
J. Comb. Theory A, 1997

Compression Theorems and Steiner Ratios on Spheres.
J. Comb. Optim., 1997

Gradient-constrained minimal Steiner trees.
Proceedings of the Network Design: Connectivity and Facilities Location, 1997

Shortest networks on spheres.
Proceedings of the Network Design: Connectivity and Facilities Location, 1997

1996
Minimal Steiner Trees for 2<sup>k</sup>×2<sup>k</sup> Square Lattices.
J. Comb. Theory A, 1996

1992
Degree-five Steiner points cannot reduce network costs for planar sets.
Networks, 1992


  Loading...