Doreen A. Thomas

According to our database1, Doreen A. Thomas authored at least 83 papers between 1991 and 2021.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Computational complexity of the 2-connected Steiner network problem in the <i>ℓ</i><sub><i>p</i></sub> plane.
Theor. Comput. Sci., 2021

2020
A Physarum-Inspired Algorithm for Minimum-Cost Relay Node Placement in Wireless Sensor Networks.
IEEE/ACM Trans. Netw., 2020

Computing Skeletons for Rectilinearly Convex Obstacles in the Rectilinear Plane.
J. Optim. Theory Appl., 2020

Optimum ramp design in open pit mines.
Comput. Oper. Res., 2020

Scheduling the construction of value and discount weighted trees for maximum net present value.
Comput. Oper. Res., 2020

2019
The Fast Heuristic Algorithms and Post-Processing Techniques to Design Large and Low-Cost Communication Networks.
IEEE/ACM Trans. Netw., 2019

Computing minimum 2-edge-connected Steiner networks in the Euclidean plane.
Networks, 2019

The 2-connected bottleneck Steiner network problem is NP-hard in any 𝓁<sub>p</sub> plane.
CoRR, 2019

New pruning rules for the Steiner tree problem and 2-connected Steiner network problem.
Comput. Geom., 2019

2018
Minimal curvature-constrained networks.
J. Glob. Optim., 2018

Combined optimisation of an open-pit mine outline and the transition depth to underground mining.
Eur. J. Oper. Res., 2018

Stability and active power sharing in droop controlled inverter interfaced microgrids: Effect of clock mismatches.
Autom., 2018

2017
Approximate Euclidean Steiner Trees.
J. Optim. Theory Appl., 2017

Siting and sizing distributed storage for microgrid applications.
Proceedings of the 2017 IEEE International Conference on Smart Grid Communications, 2017

2016
A Market Mechanism for Electric Vehicle Charging Under Network Constraints.
IEEE Trans. Smart Grid, 2016

Gradient-constrained discounted Steiner trees II: optimally locating a discounted Steiner point.
J. Glob. Optim., 2016

Gradient-constrained discounted Steiner trees I: optimal tree configurations.
J. Glob. Optim., 2016

An exact algorithm for the bottleneck 2-connected k-Steiner network problem in L<sub>p</sub> planes.
Discret. Appl. Math., 2016

2015
Maximizing the net present value of a Steiner tree.
J. Glob. Optim., 2015

Optimal curvature and gradient-constrained directional cost paths in 3-space.
J. Glob. Optim., 2015

Generalised k-Steiner Tree Problems in Normed Planes.
Algorithmica, 2015

Modelling voltage-demand relationship on power distribution grid for distributed demand management.
Proceedings of the 2015 5th Australian Control Conference (AUCC), Gold Coast, 2015

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

A flow-dependent quadratic steiner tree problem in the Euclidean plane.
Networks, 2014

Improving Underground Mine Access Layouts Using Software Tools.
Interfaces, 2014

A geometric characterisation of the quadratic min-power centre.
Eur. J. Oper. Res., 2014

On making energy demand and network constraints compatible in the last mile of the power grid.
Annu. Rev. Control., 2014

A distributed electric vehicle charging management algorithm using only local measurements.
Proceedings of the IEEE PES Innovative Smart Grid Technologies Conference, 2014

2013
Delay Selection by Spike-Timing-Dependent Plasticity in Recurrent Networks of Spiking Neurons Receiving Oscillatory Inputs.
PLoS Comput. Biol., 2013

The Gilbert arborescence problem.
Networks, 2013

Minimal Curvature-Constrained Paths in the Plane with a Constraint on arcs with Opposite orientations.
Int. J. Comput. Geom. Appl., 2013

Relay augmentation for lifetime extension of wireless sensor networks.
IET Wirel. Sens. Syst., 2013

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

Curvature-constrained directional-cost paths in the plane.
J. Glob. Optim., 2012

The bottleneck 2-connected k-Steiner network problem for k≤2.
Discret. Appl. Math., 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

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

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

Optimal curvature-constrained paths with anisotropic costs in the plane.
Proceedings of the 2011 Australian Control Conference, 2011

Extendibility and path components of admissible paths for the Dubins problem.
Proceedings of the 2011 Australian Control Conference, 2011

2010
Approximating minimum Steiner point trees in Minkowski planes.
Networks, 2010

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

Emergence of network structure due to spike-timing-dependent plasticity in recurrent neuronal networks V: self-organization schemes and weight dependence.
Biol. Cybern., 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

A novel approach to phylogenetic trees: <i>d</i>-Dimensional geometric Steiner trees.
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

Emergence of network structure due to spike-timing-dependent plasticity in recurrent neuronal networks IV.
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.
Biol. Cybern., 2009

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

Emergence of network structure due to spike-timing-dependent plasticity in recurrent neuronal networks. I. Input selectivity-strengthening correlated input pathways.
Biol. Cybern., 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

2007
Network optimization for the design of underground mines.
Networks, 2007

Network modelling of underground mine layout: two case studies.
Int. Trans. Oper. Res., 2007

Distributed Self-Localisation in Sensor Networks using RIPS Measurements.
Proceedings of the World Congress on Engineering, 2007

Constrained Path Optimisation for Underground Mine Layout.
Proceedings of the World Congress on Engineering, 2007

Spike-Timing Dependent Plasticity in Recurrently Connected Networks with Fixed External Inputs.
Proceedings of the Neural Information Processing, 14th International Conference, 2007

2006
Minimum cost flow-dependent communication networks.
Networks, 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
A polynomial algorithm for a constrained traveling salesman problem.
Networks, 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

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

1997
Steiner Trees for Terminals Constrained to Curves.
SIAM J. Discret. Math., 1997

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

Minimal Steiner Trees for Rectangular Arrays of Lattice Points.
J. Comb. Theory, Ser. A, 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, Ser. A, 1996

Critical points for the Steiner ratio.
Australas. J Comb., 1996

1993
The Steiner Minimal Network for Convex Configurations.
Discret. Comput. Geom., 1993

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

The Steiner Ration Conjecture for Cocircular Points.
Discret. Comput. Geom., 1992

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

1991
The Steiner ratio conjecture for six points.
J. Comb. Theory, Ser. A, 1991

A variational approach to the Steiner network problem.
Ann. Oper. Res., 1991


  Loading...