Algorithms and computation in four-dimensional topology. This project will establish Australia as a world leader in computational topology, particularly in the all-important areas of topology in three and four dimensions. In four dimensions this work will be truly groundbreaking; until now the field has seen little development due to the complexity of the algorithms and computations required, and the applicant is in the unique position of having the necessary tools to make significant progress ....Algorithms and computation in four-dimensional topology. This project will establish Australia as a world leader in computational topology, particularly in the all-important areas of topology in three and four dimensions. In four dimensions this work will be truly groundbreaking; until now the field has seen little development due to the complexity of the algorithms and computations required, and the applicant is in the unique position of having the necessary tools to make significant progress in a feasible time frame. In three dimensions this project will strengthen the distinguished computational topology community in Melbourne, led by pioneers such as Rubinstein, Goodman, Hodgson as well as the applicant himself.Read moreRead less
Symmetry and computation. The overall objective of the project is to explore connections between symmetry and computation, especially the theory and algorithms that facilitate the use of groups in computational science. The main outcome will be theoretically fast algorithms and implementations to drive applications in the sciences and for secure communication.
Generic complexity in computational topology: breaking through the bottlenecks. The project will focus on key computational problems in three-dimensional topology, with the aims of illuminating the theoretical limitations of such problems, developing new computational tools for solving them, and applying these tools to a variety of applications. The project will generate theoretical research, practical software, and rich experimental data.
Beyond Planarity: Algorithms for Visualisation of Sparse Non-Planar Graphs. This project aims to develop new efficient algorithms to enable analysts to visually understand complex data and detect anomalies or patterns. It aims to develop visualisation algorithms for sparse non-planar graphs arising from real-world networks. Specifically, the project plans to investigate structural properties of sparse non-planar topological graphs such as k-planar graphs, k-skew graphs, and k-quasi-planar graphs ....Beyond Planarity: Algorithms for Visualisation of Sparse Non-Planar Graphs. This project aims to develop new efficient algorithms to enable analysts to visually understand complex data and detect anomalies or patterns. It aims to develop visualisation algorithms for sparse non-planar graphs arising from real-world networks. Specifically, the project plans to investigate structural properties of sparse non-planar topological graphs such as k-planar graphs, k-skew graphs, and k-quasi-planar graphs, and design efficient testing algorithms, embedding algorithms, and drawing algorithms. These algorithms will be evaluated with real-world social networks and biological networks. New insights into the mathematical interplay between combinatorial and geometric structures would provide a theoretical foundation for a new generation of complex network visualisation methods with potential applications in social networks, systems biology, health informatics, finance and security.Read moreRead less