- Combinatorial optimisation
- Discrete and computational geometry
- Shortest network design
- Survivable networks
Publications, Grants and Awards
You can find all publications, grants and awards on their Find an Expert page.
Find an Expert
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
| Edward BARKER
| Jae Myeong LEE
| Adalberto SATO MICHELS
||"Assembly line balancing problem with heterogeneous resources"
Past Postgraduate Supervision
||"Degree bounded geometric spanning trees with a bottleneck objective function"
||"A study of optimised network flows for prediction of force transmission and crack propagation in bonded granular media"
Past Honours & MSc Students
|Jae Myeong LEE
||"Heuristics for designing resilient networks in earthquake prone environments"
||"A Graph Theoretic Approach to Maximising Wireless Network Lifetime"
||"Preprocessing heuristics for integer programming formulations of an ad hoc wireless network"
||"Algorithms for mapping vertices and edges to a polyhedral decomposition"
||"Optimal design of survivable wireless networks under regional failure"
||"The Variable-cost Node-weighted Steiner Tree Problem in the Euclidean Plane"
||"Min-power clustering in ad-hoc wireless sensor networks"
||"Regional disaster and regional min-cut max-flow problem in networks"
||"On augmenting the survivability of geometric graphs with respect to regional connectivity"
- Exchange Student Advisor/Evaluator