| Publication | Date of Publication | Type |
|---|
An exact algorithm for the Euclidean \(k\)-Steiner tree problem
Computational Geometry | 2024-07-23 | Paper |
Network augmentation for disaster‐resilience against geographically correlated failure
Networks | 2023-12-18 | Paper |
Simplifying obstacles for Steiner network problems in the plane
Networks | 2023-12-12 | Paper |
Fixed parameter tractability of a biconnected bottleneck Steiner network problem
Networks | 2023-11-15 | Paper |
Structural properties of minimum multi-source multi-sink Steiner networks in the Euclidean plane
Journal of Optimization Theory and Applications | 2023-07-07 | Paper |
An exact algorithm for constructing minimum Euclidean skeletons of polygons
Journal of Global Optimization | 2022-04-25 | Paper |
Computational complexity of the 2-connected Steiner network problem in the \(\ell_p\) plane
Theoretical Computer Science | 2020-12-16 | Paper |
Computing skeletons for rectilinearly convex obstacles in the rectilinear plane
Journal of Optimization Theory and Applications | 2020-07-14 | Paper |
| Unsupervised basis function adaptation for reinforcement learning | 2020-02-07 | Paper |
Unsupervised basis function adaptation for reinforcement learning
(available as arXiv preprint) | 2020-02-07 | Paper |
Degree bounded bottleneck spanning trees in three dimensions
Journal of Combinatorial Optimization | 2020-02-03 | Paper |
Algorithms for Euclidean degree bounded spanning tree problems
International Journal of Computational Geometry & Applications | 2019-09-24 | Paper |
| The $2$-connected bottleneck Steiner network problem is NP-hard in any $\ell_p$ plane | 2019-07-08 | Paper |
Computing minimum 2-edge-connected Steiner networks in the Euclidean plane
Networks | 2019-03-06 | Paper |
New pruning rules for the Steiner tree problem and 2-connected Steiner network problem
Computational Geometry | 2018-12-07 | Paper |
Minimum bottleneck spanning trees with degree bounds
Networks | 2018-05-23 | Paper |
A flow-dependent quadratic Steiner tree problem in the Euclidean plane
Networks | 2018-05-23 | Paper |
Approximate Euclidean Steiner trees
Journal of Optimization Theory and Applications | 2017-05-22 | Paper |
A geometric characterisation of the quadratic min-power centre
European Journal of Operational Research | 2016-06-24 | Paper |
An exact algorithm for the bottleneck 2-connected \(k\)-Steiner network problem in \(L_p\) planes
Discrete Applied Mathematics | 2016-02-04 | Paper |
Distance labellings of Cayley graphs of semigroups
Semigroup Forum | 2016-02-01 | Paper |
Survivable minimum bottleneck networks
Computational Geometry | 2016-01-15 | Paper |
| An algorithm for finding Hamiltonian Cycles in Cubic Planar Graphs | 2015-12-04 | Paper |
Generalised \(k\)-Steiner tree problems in normed planes
Algorithmica | 2015-03-02 | Paper |
The Gilbert arborescence problem
Networks | 2013-08-06 | Paper |
The bottleneck 2-connected \(k\)-Steiner network problem for \(k \leq 2\)
Discrete Applied Mathematics | 2012-05-30 | Paper |
Approximating minimum Steiner point trees in Minkowski planes
Networks | 2010-12-20 | Paper |
| A class of full \((d,1)\)-colorable trees | 2010-12-08 | Paper |
The \(L(h,1,1)\)-labelling problem for trees
European Journal of Combinatorics | 2010-06-17 | Paper |
A characterization of \(\lambda _{d,1}\)-minimal trees and other attainable classes
Discrete Mathematics | 2009-06-19 | Paper |
| The \(L(d,1)\)-hole index of paths and cycles | 2006-09-14 | Paper |
Identification of Active Subfunctions in Finite-Max Minimisation via a Smooth Reformulation
(available as arXiv preprint) | N/A | Paper |
