André van Renssen

Dr André van Renssen is a researcher at The University of Sydney, Department of CS. His work focuses on data structures and algorithms, particularly in the context of networks. His research involves calculating the shortest possible paths through various types of networks, including computer, communications, road, and transport networks. He aims to design efficient routing algorithms that can help alleviate information and vehicle traffic congestion without requiring additional infrastructure. His research has applications in systems like Google Maps, which updates routes based on real-time network conditions.

André van Renssen is a researcher at the University of Sydney with expertise in Algorithms, Computational Geometry, Discrete Geometry, and Graph Theory. His work focuses on the design and analysis of efficient algorithms for geometric and graph problems, including spanner construction, routing, and simplification of polygonal subdivisions. He has contributed to the study of theta-graphs, Yao graphs, and Delaunay triangulations, with an emphasis on their spanning ratios and competitive routing properties. His research also explores the complexity of problems such as dynamic graph coloring and constrained triangulations, aiming to improve computational efficiency and geometric accuracy.