Design and analysis of algorithms
Scheduling algorithms; online and approximation algorithms; energy-efficient computing; routing algorithms; and job scheduling in computing systems.
- Scheduling
- Online decisions
- Approximation
- Computing systems
Associate Professor
Department of Computer Science
George Mason University
I study the design and analysis of algorithms, with a focus on scheduling, online and approximation algorithms, and hybrid quantum approaches to combinatorial optimization.
Scheduling algorithms; online and approximation algorithms; energy-efficient computing; routing algorithms; and job scheduling in computing systems.
Hybrid quantum algorithms for combinatorial optimization problems, exploring the interplay between classical algorithm design and quantum computation.
Our research group at George Mason University studies scheduling, online and approximation algorithms, and quantum algorithms. Meet the people behind the work and explore our publications.
Mailing address
Department of Computer SciencePhone
(703) 993-1540