Julian Mestre

Dr. Julian Mestre is an Associate Professor in the School of Computer Science at the University of Sydney. He holds a BE from the Universidad Católica de Argentina (UCA), and MSc and PhD degrees in Computer Science from the University of Maryland (UMD, USA). His research focuses on theoretical computer science, particularly the design and analysis of efficient algorithms for combinatorial optimization problems such as scheduling, routing, and matching. He previously served as a postdoctoral fellow at the Max Planck Institute for Informatics in Germany.

**Education**:

• PhD in Computer Science, University of Maryland (2000s)
• MSc in Computer Science, University of Maryland
• Bachelor of Engineering (BE), Universidad Católica de Argentina

**Research Interests**: Julian specializes in algorithms for combinatorial optimization, including approximation algorithms, scheduling, graph theory, and discrete mathematics. His work often bridges theoretical foundations with practical applications in areas like mobile app optimization, sensor networks, and distributed systems.

**Grants**:

• 2015: Local Reoptimization for Turbocharging Heuristics (ARC Discovery Project)
• 2013: Universal Solutions for Scheduling Problems (ARC DECRA)
• 2012: Algorithms for Combinatorial Optimization on Uncertain Inputs (Group of Eight/Germany Grant)