Doreen A. Thomas

Kevin Prendergast

Networks, 2011

Maximum Parsimony, Substitution Model, and Probability Phylogenetic Trees.

[BibT_eX]

[DOI]

J. Comput. Biol., 2011

Exact algorithm for the bottleneck 2-connected $k$-Steiner network problem

[BibT_eX]

[DOI]

Charl J. Ras

CoRR, 2011

The bottleneck 2-connected $k$-Steiner network problem for $k\leq 2$

[BibT_eX]

[DOI]

Charl J. Ras

CoRR, 2011

Optimal curvature-constrained paths with anisotropic costs in the plane.

[BibT_eX]

[DOI]

Proceedings of the 2011 Australian Control Conference, 2011

Extendibility and path components of admissible paths for the Dubins problem.

[BibT_eX]

[DOI]

Proceedings of the 2011 Australian Control Conference, 2011

2010

Approximating minimum Steiner point trees in Minkowski planes.

[BibT_eX]

[DOI]

Charl J. Ras

Networks, 2010

Computing Steiner points for gradient-constrained minimum networks.

[BibT_eX]

[DOI]

Discret. Optim., 2010

Emergence of network structure due to spike-timing-dependent plasticity in recurrent neuronal networks V: self-organization schemes and weight dependence.

[BibT_eX]

[DOI]

Biol. Cybern., 2010

Corrected Statistical Distance and Probability Constrained Optimization in Reconstruction of Phylogenetic Trees.

[BibT_eX]

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.

[BibT_eX]

[DOI]

Kevin Prendergast

Networks, 2009

A novel approach to phylogenetic trees: d-Dimensional geometric Steiner trees.

[BibT_eX]

[DOI]

Christian Wulff-Nilsen

Martin Zachariasen

Networks, 2009

Identifying Steiner Minimal Trees on Four Points in Space.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2009

Computing Steiner Points and Probability Steiner Points in ℓ1 and ℓ2 Metric Spaces.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2009

Emergence of network structure due to spike-timing-dependent plasticity in recurrent neuronal networks IV.

[BibT_eX]

[DOI]

Biol. Cybern., 2009

Emergence of network structure due to spike-timing-dependent plasticity in recurrent neuronal networks III: Partially connected neurons driven by spontaneous activity.

[BibT_eX]

[DOI]

Biol. Cybern., 2009

Emergence of network structure due to spike-timing-dependent plasticity in recurrent neuronal networks. II. Input selectivity - symmetry breaking.

[BibT_eX]

[DOI]

Biol. Cybern., 2009

Emergence of network structure due to spike-timing-dependent plasticity in recurrent neuronal networks. I. Input selectivity-strengthening correlated input pathways.

[BibT_eX]

[DOI]

Biol. Cybern., 2009

2008

Gradient-constrained minimum networks (II). Labelled or locally minimal Steiner points.

[BibT_eX]

[DOI]

J. Glob. Optim., 2008

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

[BibT_eX]

[DOI]

James MacGregor Smith

Fundam. Informaticae, 2008

2007

Network optimization for the design of underground mines.

[BibT_eX]

[DOI]

Networks, 2007

Network modelling of underground mine layout: two case studies.

[BibT_eX]

[DOI]

Int. Trans. Oper. Res., 2007

Distributed Self-Localisation in Sensor Networks using RIPS Measurements.

[BibT_eX]

Proceedings of the World Congress on Engineering, 2007

Constrained Path Optimisation for Underground Mine Layout.

[BibT_eX]

Peter Alexander Grossman

Proceedings of the World Congress on Engineering, 2007

Spike-Timing Dependent Plasticity in Recurrently Connected Networks with Fixed External Inputs.

[BibT_eX]

[DOI]

Proceedings of the Neural Information Processing, 14th International Conference, 2007

2006

Minimum cost flow-dependent communication networks.

[BibT_eX]

[DOI]

Networks, 2006

Locally minimal uniformly oriented shortest networks.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

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

[BibT_eX]

[DOI]

Algorithmica, 2006

2002

Forbidden subpaths for Steiner minimum networks in uniform orientation metrics.

[BibT_eX]

[DOI]

Networks, 2002

2001

A polynomial algorithm for a constrained traveling salesman problem.

[BibT_eX]

[DOI]

Nicholas C. Wormald

Networks, 2001

Gradient-constrained minimum networks. I. Fundamentals.

[BibT_eX]

[DOI]

J. Glob. Optim., 2001

2000

Minimum Networks in Uniform Orientation Metrics.

[BibT_eX]

[DOI]

SIAM J. Comput., 2000

On the Complexity of the Steiner Problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 2000

1999

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

[BibT_eX]

[DOI]

Networks, 1999

1997

Steiner Trees for Terminals Constrained to Curves.

[BibT_eX]

[DOI]

Nicholas C. Wormald

SIAM J. Discret. Math., 1997

Full Minimal Steiner Trees on Lattice Sets.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1997

Minimal Steiner Trees for Rectangular Arrays of Lattice Points.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1997

Gradient-constrained minimal Steiner trees.

[BibT_eX]

[DOI]

Proceedings of the Network Design: Connectivity and Facilities Location, 1997

Shortest networks on spheres.

[BibT_eX]

[DOI]

Proceedings of the Network Design: Connectivity and Facilities Location, 1997

1996

Minimal Steiner Trees for 2k×2k Square Lattices.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1996

Critical points for the Steiner ratio.

[BibT_eX]

[DOI]

Australas. J Comb., 1996

1993

The Steiner Minimal Network for Convex Configurations.

[BibT_eX]

[DOI]

T. Cole

Discret. Comput. Geom., 1993

1992

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

[BibT_eX]

[DOI]

Networks, 1992

The Steiner Ration Conjecture for Cocircular Points.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1992

Graham's Problem on Shortest Networks for Points on a Circle.

[BibT_eX]

[DOI]

Algorithmica, 1992

1991

The Steiner ratio conjecture for six points.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1991

A variational approach to the Steiner network problem.

[BibT_eX]

[DOI]