Dr CHARL RAS
Position:
Senior Lecturer
Email:
Room:
141
Ext. Number:
58877
Webpage:
Research Groups:
Interests:
- Biological networks
- Combinatorial optimisation
- Discrete and computational geometry
- Shortest network design
- Survivable networks
Recent Publications:
- Approximate Euclidean Steiner Trees (2017) more
- Approximate Euclidean Steiner Trees (2017) more
- An exact algorithm for the bottleneck 2-connected k-Steiner network problem in L-p planes (2016) more
- Minimum Bottleneck Spanning Trees with Degree Bounds (2016) more
- Generalised k-Steiner Tree Problems in Normed Planes (2015) more
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.
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:
Patrick ANDERSEN | "Coverage and connectivity in wireless sensor networks" |
Chathranee ATHTHANAPOLA ARACHCHILAGE | |
Chathranee JAYATHILAKE |
Current MSc Students:
Past MSc Students:
Subject(s) Currently Teaching:
MAST20009 (620-231) | Vector Calculus (Semester 1, 2017) |
Responsibilities:
Open Day Co-Ordinator |
Committees:
Recruitment and Publicity Committee (Open Day Coordinator) |