معرفی
Andrew Bloch-Hansen is an Assistant Professor in the Department of Mathematics & Computing at Mount Royal University. He joined the department in 2024 and teaches courses on algorithms and data structures. His research focuses on designing efficient approximation algorithms for NP-hard optimization problems, particularly in network and packing optimization.
- PhD in Theoretical Computer Science, Western University (2024)
- MSc in Theoretical Computer Science, Western University (2019)
- BSc in Computer Science, Western University (2017)
His research interests include approximation algorithms, combinatorial optimization, and efficient algorithm design. Notable areas of focus include the thief orienteering problem on series-parallel graphs and high-multiplicity strip packing. His work has been supported by an NSERC grant.
Recent publications explore algorithmic advancements in graph theory, packing optimization, and combinatorial problems. Andrew emphasizes practical implementations of theoretical results, balancing computational efficiency with solution quality.
He has no listed scientific awards but has contributed to significant research in approximation algorithms. His advising and grant activities are currently unspecified. Andrew is affiliated with Mount Royal University's mathematics and computing programs, contributing to both education and cutting-edge research in theoretical computer science.
