Faculty profile
Daya Gaur
Back to facultyResearch
Read how they describe their research on their University of Lethbridge profile.
Latest papers
Exploring quantum active learning for materials design and discovery.
Physical chemistry chemical physics : PCCP · 2026
Seeking metal-organic frameworks for hydrogen storage using classical and quantum active learning.
Physical chemistry chemical physics : PCCP · 2025
A Hybrid Quantum Solver for the Lorenz System.
Entropy (Basel, Switzerland) · 2024
Latest funding
- $24,934
Quantum Approaches to Optimize Electrical Grid Operations
NSERC · 2022 · Principal investigator
- $24,987
Algorithms and lower bounds for monotone dualization and tensor decomposition of constraint satisfaction hypergraphs
NSERC · 2022 · Principal investigator
- $96,000
Development and analysis of methods of approximation for NP-hard optimization problems
NSERC · 2021 · Principal investigator
4 publications.
Exploring quantum active learning for materials design and discovery.
Lourenço MP, Zadeh-Haghighi H, Hostaš J, Naseri M, Gaur D, Simon C, Salahub DR
Seeking metal-organic frameworks for hydrogen storage using classical and quantum active learning.
Lourenço MP, Shukla R, Naseri M, Gaur D, Singh U, Gusarov S, Salahub DR
A Hybrid Quantum Solver for the Lorenz System.
Fathi Hafshejani S, Gaur D, Dasgupta A, Benkoczi R, Gosala NR, Iorio A
Quantum Bitcoin Mining.
Benkoczi R, Gaur D, Nagy N, Nagy M, Hossain S
Quantum Approaches to Optimize Electrical Grid Operations
Principal investigators: Gaur, Daya DR
Algorithms and lower bounds for monotone dualization and tensor decomposition of constraint satisfaction hypergraphs
Principal investigators: Gaur, Daya DR
Development and analysis of methods of approximation for NP-hard optimization problems
Principal investigators: Gaur, Daya
Keywords: algorithm design and analysis; approximation algorithms; linear programming; combinatorial optimization; computational complexity; vehicle routing; travelling salesman; minimum satisfiability
Approximation Algorithms for NP-hard Optimization Problems
Principal investigators: Gaur, Daya
MPrime Network (formerly MITACS) / Réseau MPrime (autrefois MITACS)
Principal investigators: Gupta, Arvind
Linear programming based approximation algorithms for optimization problems
Principal investigators: Gaur, Daya
Approximation algorithms for optimization problems
Principal investigators: Gaur, Daya
Mathematics of Information Technology and Complex Systems/Les mathématiques des technologies de l'information et des systèmes complexes
Principal investigators: Gupta, Arvind
Approximation algorithms for combinatorial optimization problems
Principal investigators: Gaur, Daya
From CIHR, NSERC and SSHRC funding decisions: CIHR since 2008, NSERC since 1991 and SSHRC since 1998, including their latest published competition results.
Frequent collaborators
- Robert Benkoczi and Daya Gaur: 2 shared papers
- Robert Benkoczi and Arundhati Dasgupta: 1 shared paper
- Daya Gaur and Arundhati Dasgupta: 1 shared paper
- Daya Gaur and Christoph Simon: 1 shared paper
- Mathematics ＆ Computer Science
- Physics and Astronomy
- Other
Co-authors at University of Lethbridge, colored by department. Thicker lines mean more shared papers; select anyone to open their profile and their own map.
A short, specific email works best. This draft uses one of their recent papers; replace the parts in brackets with your own details before sending.
Profile data last refreshed on September 27, 2026 from the university directory, publication records and CIHR, NSERC and SSHRC funding.