Dr Charl RAS
Senior Lecturer
School of Mathematics and Statistics
- Room: 141
- Building: Peter Hall Building
- Campus: Parkville
Research Interests
- Survivable networks
- Shortest network design
- Discrete and computational geometry
- Combinatorial optimisation
Research Groups
Recent Publications
M. Brazil, M Volz, M Zachariasen, C. Ras, D Thomas. Computing minimum 2-edge-connected Steiner networks in the Euclidean plane. Networks, 89-103, 2018. doi: 10.1002/net.21835.
M. Brazil, M Volz, M Zachariasen, C. Ras, D Thomas. New pruning rules for the Steiner tree problem and 2-connected Steiner network problem. Computational Geometry: Theory and Applications, 37-49, 2018. doi: 10.1016/j.comgeo.2018.10.003.
C. Ras, C. Burt, A. Costa. Algorithms for the power-p Steiner tree problem in the Euclidean plane. Revista de informatica teorica e aplicada, 25, 28-42, 2018.
C. Ras, Konrad Swanepoel, Doreen Anne Thomas. Approximate Euclidean Steiner Trees. Journal of Optimization Theory and Applications, 172, 845-873, 2017. doi: 10.1007/s10957-016-1036-5.
Patrick J Andersen, C. Ras. Minimum Bottleneck Spanning Trees with Degree Bounds. Networks, 68, 302-314, 2016. doi: 10.1002/net.21710.
Extra Information
My research primarily involves the use of techniques from graph theory, optimisation, and computational geometry for designing networks that are minimal under various edge-length objectives. I am interested in the design and asymptotic analysis of geometric network optimisation algorithms, including aspects such as computational complexity, fixed-parameter tractability, and NP-completeness. Some of the applications of my work are the optimisation of energy consumption in wireless ad-hoc networks, VLSI design, and phylogenetic tree construction. One of my current projects seeks to find mathematical tools and algorithms for the deployment and augmentation of optimal survivable networks. In this problem one is required to introduce a set of nodes and links into a geometric space so that the resultant network is multi-connected and is optimal with respect to some objective (for instance the sum of all edge-lengths). Finding good solutions to this problem will contribute to the economical construction of robust infrastructure and telecommunications networks, including transportation networks, utility networks, and fibre-optic networks such as the NBN.
Current Postgraduate Supervision
Name | Thesis title |
---|---|
Edward BARKER | |
Chathranee JAYATHILAKE | |
Adalberto SATO MICHELS |
Past Postgraduate Supervision
Name | Thesis title |
---|---|
Patrick ANDERSEN | "Degree bounded geometric spanning trees with a bottleneck objective function" |
Current MSc Students
Name | Project title |
---|---|
Daniel UTEDA | |
Nicolau ANDRES THIO |
Past MSc Students
Name | Project title |
---|---|
Alexandra SIMPSON | |
Billy TANG | |
Ashild TELLE | |
Aashima THUKRAL | |
Mark TURNER |
Responsibilities
- Exchange Student Advisor/Evaluator