The following pages link to Doreen Anne Thomas (Q1797055):
Displaying 50 items.
- Gradient-constrained discounted Steiner trees. I: Optimal tree configurations (Q280980) (← links)
- Gradient-constrained discounted Steiner trees. II: Optimally locating a discounted Steiner point (Q280981) (← links)
- A geometric characterisation of the quadratic min-power centre (Q297177) (← links)
- Probability Steiner trees and maximum parsimony in phylogenetic analysis (Q393567) (← links)
- (Q402218) (redirect page) (← links)
- Optimal curvature-constrained paths for general directional-cost functions (Q402219) (← links)
- The bottleneck 2-connected \(k\)-Steiner network problem for \(k \leq 2\) (Q423908) (← links)
- Curvature-constrained directional-cost paths in the plane (Q695343) (← links)
- (Q779859) (redirect page) (← links)
- Computing skeletons for rectilinearly convex obstacles in the rectilinear plane (Q779860) (← links)
- A variational approach to the Steiner network problem (Q810521) (← links)
- Emergence of network structure due to spike-timing-dependent plasticity in recurrent neuronal networks. I: Input selectivity-strengthening correlated input pathways (Q843253) (← links)
- Emergence of network structure due to spike-timing-dependent plasticity in recurrent neuronal networks. II: Input selectivity-symmetry breaking (Q843254) (← links)
- Locally minimal uniformly oriented shortest networks (Q858304) (← links)
- An exact algorithm for the bottleneck 2-connected \(k\)-Steiner network problem in \(L_p\) planes (Q908293) (← links)
- Gradient-constrained minimum networks. II: Labelled or locally minimal Steiner points (Q1024825) (← links)
- The Steiner ratio conjecture for six points (Q1177947) (← links)
- The Steiner ratio conjecture for cocircular points (Q1186084) (← links)
- Graham's problem on shortest networks for points on a circle (Q1186796) (← links)
- The Steiner minimal network for convex configurations (Q1207800) (← links)
- A homogenizable fishy poorset (Q1283950) (← links)
- Full minimal Steiner trees on lattice sets (Q1356020) (← links)
- Minimal Steiner trees for rectangular arrays of lattice points (Q1364229) (← links)
- On the complexity of the Steiner problem (Q1583698) (← links)
- Emergence of network structure due to spike-timing-dependent plasticity in recurrent neuronal networks V: self-organization schemes and weight dependence (Q1631751) (← links)
- New pruning rules for the Steiner tree problem and 2-connected Steiner network problem (Q1631775) (← links)
- Combined optimisation of an open-pit mine outline and the transition depth to underground mining (Q1754360) (← links)
- Minimal curvature-constrained networks (Q1756754) (← links)
- Stability and active power sharing in droop controlled inverter interfaced microgrids: effect of clock mismatches (Q1797056) (← links)
- Exactly solvable and unsolvable shortest network problems in 3D-space (Q1878968) (← links)
- Minimal Steiner trees for \(2^ k \times 2^ k\) square lattices (Q1906121) (← links)
- Gradient-constrained minimum networks. III: Fixed topology (Q1934615) (← links)
- Computing Steiner points for gradient-constrained minimum networks (Q1952503) (← links)
- An exact algorithm for constructing minimum Euclidean skeletons of polygons (Q2131144) (← links)
- Computational complexity of the 2-connected Steiner network problem in the \(\ell_p\) plane (Q2216434) (← links)
- On the history of the Euclidean Steiner tree problem (Q2249438) (← links)
- Generalised \(k\)-Steiner tree problems in normed planes (Q2258073) (← links)
- Scheduling the construction of value and discount weighted trees for maximum net present value (Q2289887) (← links)
- Optimum ramp design in open pit mines (Q2289903) (← links)
- Maximizing the net present value of a Steiner tree (Q2349527) (← links)
- Optimal curvature and gradient-constrained directional cost paths in 3-space (Q2351526) (← links)
- Upper and lower bounds for the lengths of Steiner trees in 3-space (Q2387794) (← links)
- Approximate Euclidean Steiner trees (Q2397467) (← links)
- Euclidean Steiner trees optimal with respect to swapping 4-point subtrees (Q2448203) (← links)
- Canonical forms and algorithms for Steiner trees in uniform orientation metrics (Q2498405) (← links)
- Cost optimisation for underground mining networks (Q2575250) (← links)
- Minimum Networks in Uniform Orientation Metrics (Q2706126) (← links)
- A polynomial algorithm for a constrained traveling salesman problem (Q2748381) (← links)
- Approximating minimum Steiner point trees in Minkowski planes (Q3064040) (← links)
- 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} (Q3087623) (← links)
