Research Topics:

Approximation Algorithms
Efficient Algorithms
Data Structures
Combinatorial Optimization

Andrew joined the School of Computing Sciences and Mathematics in 2024 and currently teaches courses on algorithms and data structures. Andrew received his PhD and Master's in Theoretical Computer Science from Western University under the supervision of Professor Roberto Solis-Oba.

Andrew's research interests center on the design, analysis, and implementation of efficient approximation algorithms for NP-hard optimization problems, and he has conducted research on network and packing optimization problems. Andrew's PhD research was supported by an NSERC grant.