A class of full (d, 1)-colorable trees. - Johannes H. Hattingh; Elizabeth Jonck; Charl J. Ras (Australas. J Comb., 2009)

A characterization of lambdad, 1-minimal trees and other attainable classes. - Elizabeth Jonck; Johannes H. Hattingh; Charl J. Ras (Discret. Math., 2009)

The L(h, 1, 1)-labelling problem for trees. - Deborah King; Charl J. Ras; Sanming Zhou (Eur. J. Comb., 2010)

Approximating minimum Steiner point trees in Minkowski planes. - Marcus Brazil; Charl J. Ras; Doreen A. Thomas (Networks, 2010)

The bottleneck 2-connected $k$-Steiner network problem for $k leq 2$ - Marcus Brazil; Charl J. Ras; Doreen A. Thomas (CoRR, 2011)

Exact algorithm for the bottleneck 2-connected $k$-Steiner network problem - Marcus Brazil; Charl J. Ras; Doreen A. Thomas (CoRR, 2011)

The bottleneck 2-connected k-Steiner network problem for k≤2. - Marcus Brazil; Charl J. Ras; Doreen A. Thomas (Discret. Appl. Math., 2012)

Relay augmentation for lifetime extension of wireless sensor networks. - Marcus Brazil; Charl J. Ras; Doreen A. Thomas (IET Wirel. Sens. Syst., 2013)

The Gilbert arborescence problem. - M. G. Volz; Marcus Brazil; Charl J. Ras; Konrad J. Swanepoel; Doreen A. Thomas (Networks, 2013)

A geometric characterisation of the quadratic min-power centre. - Marcus Brazil; Charl J. Ras; Doreen A. Thomas (Eur. J. Oper. Res., 2014)

A flow-dependent quadratic steiner tree problem in the Euclidean plane. - Marcus N. Brazil; Charl J. Ras; Doreen A. Thomas (Networks, 2014)

Generalised k-Steiner Tree Problems in Normed Planes. - Marcus Brazil; Charl J. Ras; Konrad J. Swanepoel; Doreen A. Thomas (Algorithmica, 2015)

Survivable minimum bottleneck networks. - Charl J. Ras (Comput. Geom., 2015)

An exact algorithm for the bottleneck 2-connected k-Steiner network problem in Lp planes. - Marcus Brazil; Charl J. Ras; Doreen A. Thomas (Discret. Appl. Math., 2016)

Minimum bottleneck spanning trees with degree bounds. - Patrick J. Andersen; Charl J. Ras (Networks, 2016)

Approximate Euclidean Steiner Trees. - Charl J. Ras; Konrad J. Swanepoel; Doreen Anne Thomas (J. Optim. Theory Appl., 2017)

Algorithms for the power-p Steiner tree problem in the Euclidean plane. - Christina N. Burt; Alysson M. Costa; Charl J. Ras (RITA, 2018)

New pruning rules for the Steiner tree problem and 2-connected Steiner network problem. - Marcus Brazil; Marcus Volz; Martin Zachariasen; Charl J. Ras; Doreen A. Thomas (Comput. Geom., 2019)

The 2-connected bottleneck Steiner network problem is NP-hard in any 𝓁p plane. - Marcus Brazil; Charl J. Ras; Doreen A. Thomas; G. Xu (CoRR, 2019)

Algorithms for Euclidean Degree Bounded Spanning Tree Problems. - Patrick J. Andersen; Charl J. Ras (Int. J. Comput. Geom. Appl., 2019)

Unsupervised Basis Function Adaptation for Reinforcement Learning. - Edward Barker 001; Charl J. Ras (J. Mach. Learn. Res., 2019)

Computing minimum 2-edge-connected Steiner networks in the Euclidean plane. - Marcus Brazil; Marcus Volz; Martin Zachariasen; Charl J. Ras; Doreen A. Thomas (Networks, 2019)

Overlaid oriented Voronoi diagrams and the 1-Steiner tree problem. - Michael S. Payne; Charl J. Ras; Marcus Volz (CoRR, 2020)

Degree bounded bottleneck spanning trees in three dimensions. - Patrick J. Andersen; Charl J. Ras (J. Comb. Optim., 2020)

Computing Skeletons for Rectilinearly Convex Obstacles in the Rectilinear Plane. - Marcus Volz; Marcus Brazil; Charl J. Ras; Doreen A. Thomas (J. Optim. Theory Appl., 2020)

Fixed parameter tractability of a biconnected bottleneck Steiner network problem. - Charl J. Ras (Networks, 2020)

Computational complexity of the 2-connected Steiner network problem in the ℓp plane. - Charl J. Ras; Marcus Brazil; Doreen A. Thomas (Theor. Comput. Sci., 2021)

An exact algorithm for constructing minimum Euclidean skeletons of polygons. - Nicolau Andrés-Thió; Marcus Brazil; Charl J. Ras; Doreen A. Thomas; Marcus Volz (J. Glob. Optim., 2022)

Simplifying obstacles for Steiner network problems in the plane. - Marcus Volz; Marcus Brazil; Charl J. Ras; Doreen A. Thomas (Networks, 2022)

Structural Properties of Minimum Multi-source Multi-Sink Steiner Networks in the Euclidean Plane. - Alexander Westcott; Marcus Brazil; Charl J. Ras (J. Optim. Theory Appl., 2023)

Network augmentation for disaster-resilience against geographically correlated failure. - Nicolau Andrés-Thió; Marcus Brazil; Charl J. Ras; Doreen A. Thomas (Networks, 2023)

An exact algorithm for the Euclidean k-Steiner tree problem. - Marcus Brazil; Michael Hendriksen; Jae Lee; Michael S. Payne; Charl J. Ras; Doreen A. Thomas (Comput. Geom., 2024)

An exact algorithm for disaster-resilience augmentation of planar straight-line graphs. - Alexander Westcott; Charl J. Ras (J. Glob. Optim., 2025)