Dr Tony Wirth is Professor in the School of Computing and Information Systems at The University of Melbourne.
He completed a BSc(Hons) and MSc at the University of Melbourne; supported by a Gordon Wu Fellowship, he completed an MA and PhD at Princeton University.
Wirth has previously been the Seminar and Excellence Coordinator in the Department of Computer Science and Software Engineering. Wirth has a significant publication record in, amongst others, approximation and graph algorithms, bioinformatics, and data mining. He has refereed for numerous international journals and served on several conference program committees. Wirth's teaching has been commended both at the department and school level.
Find out more about Tony Wirth's experience
Tony Wirth's highlights
Tony Wirth's selected work
Exploring The Ethical Implications Of Ai Bias As A Result Of Workforce Gender Imbalance
Displaying the 14 most recent projects by Tony Wirth.
Internal Research Grant
Displaying the 65 most recent scholarly works by Tony Wirth.
Metric-Constrained Optimization for Graph Clustering Algorithms
Nate Veldt, David F Gleich, Anthony Wirth, James Saunderson
Journal article | 2019 | SIAM Journal on Mathematics of Data Science
We outline a new approach for solving linear programming relaxations of NP-hard graph clustering problems that enforce triangle in..
Learning resolution parameters for graph clustering
N Veldt, DF Gleich, A Wirth
Conference Proceedings | 2019 | WEB CONFERENCE 2019: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW 2019)
Finding clusters of well-connected nodes in a graph is an extensively studied problem in graph-based data analysis. Because of its..
A Correlation Clustering Framework for Community Detection
Nate Veldt, David F Gleich, Anthony Wirth
Conference Proceedings | 2018 | WEB CONFERENCE 2018: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW2018)
Graph clustering, or community detection, is the task of identifying groups of closely related objects in a large network. In this..
A cost model for long-term compressed data retention
K Liao, A Moffat, M Petri, A Wirth
Conference Proceedings | 2017 | Proceedings of the Tenth ACM International Conference on Web Search and Data Mining - WSDM '17
© 2017 ACM. Vast amounts of data are collected and stored every day, as part of corporate knowledge bases and as a response to leg..
Practical adaptive search trees with performance bounds
K Fray, K Morgan, A Wirth, J Zobel
Conference Proceedings | 2017 | Proceedings of the Australasian Computer Science Week Multiconference on - ACSW '17
© 2017 Copyright held by the owner/author(s). Publication rights licensed to ACM. Dynamic binary search trees are a fundamental cl..
Analyzing shared mental models
J Langan-Fox, A Wirth, S Code, K Langfield-Smith, A Wirth
Conference Proceedings | 2000 | Proceedings of the XIVth Triennial Congress of the International Ergonomics Association and 44th Annual Meeting of the Human Factors and Ergonomics Association, 'Ergonomics for the New Millennium'
Honours, Awards and Fellowships
Gordon Wu Fellowship
Professor - Computer Science
Computing And Information Systems
Association for Computing Machinery
ACM SIG Algorithms and Computation Theory
ACM SIG Computer Science Education
Doctor of Philosophy
Master of Arts
Master of Science
University of Melbourne
Bachelor of Science (Honours)
University of Melbourne