Doreen Anne Thomas

From MaRDI portal
Revision as of 14:04, 9 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Doreen Anne Thomas to Doreen Anne Thomas: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:1797055

Available identifiers

zbMath Open thomas.doreen-anneDBLP02/2619WikidataQ41048802 ScholiaQ41048802MaRDI QIDQ1797055

List of research outcomes





PublicationDate of PublicationType
Curvature-constrained Steiner networks with three terminals2024-11-01Paper
An exact algorithm for the Euclidean \(k\)-Steiner tree problem2024-07-23Paper
Network augmentation for disaster‐resilience against geographically correlated failure2023-12-18Paper
Simplifying obstacles for Steiner network problems in the plane2023-12-12Paper
Minimum Steiner trees on a set of concyclic points and their center2023-11-27Paper
Solving the prize‐collecting Euclidean Steiner tree problem2023-11-27Paper
A model for open-pit pushback design with operational constraints2023-06-20Paper
An exact algorithm for constructing minimum Euclidean skeletons of polygons2022-04-25Paper
Computational complexity of the 2-connected Steiner network problem in the \(\ell_p\) plane2020-12-16Paper
Computing skeletons for rectilinearly convex obstacles in the rectilinear plane2020-07-14Paper
Scheduling the construction of value and discount weighted trees for maximum net present value2020-01-27Paper
Optimum ramp design in open pit mines2020-01-27Paper
The $2$-connected bottleneck Steiner network problem is NP-hard in any $\ell_p$ plane2019-07-08Paper
Computing minimum 2‐edge‐connected Steiner networks in the Euclidean plane2019-03-06Paper
Minimal curvature-constrained networks2018-12-21Paper
Emergence of network structure due to spike-timing-dependent plasticity in recurrent neuronal networks V: self-organization schemes and weight dependence2018-12-07Paper
New pruning rules for the Steiner tree problem and 2-connected Steiner network problem2018-12-07Paper
Stability and active power sharing in droop controlled inverter interfaced microgrids: effect of clock mismatches2018-10-17Paper
Combined optimisation of an open-pit mine outline and the transition depth to underground mining2018-05-30Paper
A flow‐dependent quadratic steiner tree problem in the Euclidean plane2018-05-23Paper
Optimally locating a junction point for an underground mine to maximise the net present value2018-05-08Paper
Approximate Euclidean Steiner trees2017-05-22Paper
A geometric characterisation of the quadratic min-power centre2016-06-24Paper
Gradient-constrained discounted Steiner trees. I: Optimal tree configurations2016-05-10Paper
Gradient-constrained discounted Steiner trees. II: Optimally locating a discounted Steiner point2016-05-10Paper
An exact algorithm for the bottleneck 2-connected \(k\)-Steiner network problem in \(L_p\) planes2016-02-04Paper
MINIMAL CURVATURE-CONSTRAINED PATHS IN THE PLANE WITH A CONSTRAINT ON ARCS WITH OPPOSITE ORIENTATIONS2015-12-22Paper
Demonstrating efficiency gains from installing truck turntables at crushers2015-11-08Paper
Determining the open pit to underground transition: A new method2015-09-17Paper
Optimal curvature and gradient-constrained directional cost paths in 3-space2015-06-24Paper
Maximizing the net present value of a Steiner tree2015-06-22Paper
Generalised \(k\)-Steiner tree problems in normed planes2015-03-02Paper
Optimal curvature-constrained paths for general directional-cost functions2014-08-27Paper
On the history of the Euclidean Steiner tree problem2014-07-01Paper
Euclidean Steiner trees optimal with respect to swapping 4-point subtrees2014-04-30Paper
Probability Steiner trees and maximum parsimony in phylogenetic analysis2014-01-23Paper
The Gilbert arborescence problem2013-08-06Paper
Computing Steiner points for gradient-constrained minimum networks2013-05-31Paper
Gradient-constrained minimum networks. III: Fixed topology2013-01-29Paper
Curvature-constrained directional-cost paths in the plane2012-12-21Paper
The bottleneck 2-connected \(k\)-Steiner network problem for \(k \leq 2\)2012-05-30Paper
Optimum steiner ratio for gradient-constrained networks connecting three points in 3-space, part II: The gradient-constraint m satisfies \documentclass{article} \usepackage{amsmath,amsfonts,amssymb}\pagestyle{empty}\begin{document}$ 1 \leq m \leq \sqrt{3}2011-08-16Paper
Approximating minimum Steiner point trees in Minkowski planes2010-12-20Paper
COMPUTING STEINER POINTS AND PROBABILITY STEINER POINTS IN ℓ1 AND ℓ2 METRIC SPACES2010-03-11Paper
IDENTIFYING STEINER MINIMAL TREES ON FOUR POINTS IN SPACE2009-11-19Paper
Emergence of network structure due to spike-timing-dependent plasticity in recurrent neuronal networks. I: Input selectivity-strengthening correlated input pathways2009-10-12Paper
Emergence of network structure due to spike-timing-dependent plasticity in recurrent neuronal networks. II: Input selectivity-symmetry breaking2009-10-12Paper
A novel approach to phylogenetic trees: d‐Dimensional geometric Steiner trees2009-07-28Paper
Optimum Steiner ratio for gradient‐constrained networks connecting three points in 3‐space, part I2009-07-28Paper
Gradient-constrained minimum networks. II: Labelled or locally minimal Steiner points2009-06-17Paper
Designing Optimal Flow Networks2009-03-12Paper
https://portal.mardi4nfdi.de/entity/Q55063332009-01-28Paper
Network modelling of underground mine layout: two case studies2008-01-24Paper
Network optimization for the design of underground mines2007-02-02Paper
Locally minimal uniformly oriented shortest networks2007-01-09Paper
Minimum cost flow‐dependent communication networks2006-09-12Paper
Canonical forms and algorithms for Steiner trees in uniform orientation metrics2006-08-16Paper
Cost optimisation for underground mining networks2005-12-08Paper
Upper and lower bounds for the lengths of Steiner trees in 3-space2005-09-05Paper
Exactly solvable and unsolvable shortest network problems in 3D-space2004-09-10Paper
Forbidden subpaths for Steiner minimum networks in uniform orientation metrics2002-09-29Paper
A polynomial algorithm for a constrained traveling salesman problem2001-10-14Paper
Minimum Networks in Uniform Orientation Metrics2001-03-19Paper
Gradient-constrained minimum networks. I: Fundamentals.2001-01-01Paper
On the complexity of the Steiner problem2000-10-30Paper
https://portal.mardi4nfdi.de/entity/Q49457932000-09-15Paper
https://portal.mardi4nfdi.de/entity/Q49457922000-03-23Paper
A homogenizable fishy poorset2000-01-09Paper
https://portal.mardi4nfdi.de/entity/Q42427841999-08-04Paper
https://portal.mardi4nfdi.de/entity/Q43953191999-07-05Paper
https://portal.mardi4nfdi.de/entity/Q43953411999-07-05Paper
Minimal Steiner trees for rectangular arrays of lattice points1998-02-05Paper
Full minimal Steiner trees on lattice sets1997-11-09Paper
Steiner Trees for Terminals Constrained to Curves1997-08-20Paper
Minimal Steiner trees for \(2^ k \times 2^ k\) square lattices1996-05-13Paper
https://portal.mardi4nfdi.de/entity/Q48767571996-05-06Paper
The Steiner minimal network for convex configurations1993-05-16Paper
Degree-five Steiner points cannot reduce network costs for planar sets1993-01-17Paper
The Steiner ratio conjecture for cocircular points1992-06-28Paper
Graham's problem on shortest networks for points on a circle1992-06-28Paper
The Steiner ratio conjecture for six points1992-06-26Paper
A variational approach to the Steiner network problem1991-01-01Paper
ON GENERAL MATRIX MEASURES1976-01-01Paper

Research outcomes over time

This page was built for person: Doreen Anne Thomas