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

  • C. Ras. Fixed parameter tractability of a biconnected bottleneck Steiner network problem. Networks, 310-320, 2020. doi: 10.1002/net.21926.

  • P. Andersen, C. Ras. Degree bounded bottleneck spanning trees in three dimensions. Journal of Combinatorial Optimization, 457-491, 2019. doi: 10.1007/s10878-019-00490-2.

  • 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.

View all

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

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

Past MSc Students

Name Project title
Alexandra SIMPSON
Billy TANG
Ashild TELLE


  • Exchange Student Advisor/Evaluator