Dr Michael J Dinneen

BSc, MSc, PhD


  • University of Victoria (Canada) MSc and PhD
  • Washington State University (Pullman USA)
  • University of Idaho (Moscow USA) BSc Mathematics (Cum Laude) and BSc Computer Science (Magna Cum Laude)
  • Sessional Lecturer at University of Victoria
  • Worked at Los Alamos National Laboratory (New Mexico USA)

Research | Current

Research in

  • Combinatorial algorithms
  • Graph theory
  • Network design

Interests in

  • Distributive programming
  • Computational complexity
  • Programming trends
  • Quantum computing
  • Computer-assisted mathematics

Postgraduate supervision

Web link to a list of my former students with research topics.

Areas of expertise

  • Theoretical Computer Science
  • Graph and Combinatorial Algorithms
  • Parallel and Distributed Computing (incl. P Systems and GPGPU programming)

Committees/Professional groups/Services

  • Theory Research Group Director (Computer Science)
  • Deputy Director CDMTCS
  • Stage 3 Coordinator and Student Advisor (Computer Science Academic Committee)

Selected publications and creative works (Research Outputs)

As of 29 October 2020 there will be no automatic updating of 'selected publications and creative works' from Research Outputs. Please continue to keep your Research Outputs profile up to date.
  • Summers, C., & Dinneen, M. J. (2019). Improved mixed-example data augmentation. 2019 IEEE Winter Conference on Applications of Computer Vision (WACV), 1262-1270. Hilton Waikoloa Village, Hawaii: IEEE. 10.1109/WACV.2019.00139
  • Mahasinghe, A., Hua, R., Dinneen, M. J., & Goyal, R. (2019). Solving the Hamiltonian cycle problem using a quantum computer. ACSW 2019 Proceedings of the Australasian Computer Science Week Multiconference Sydney, NSW, Australia: ACM. 10.1145/3290688.3290703
  • Rajaati, M., Hooshmandasl, M. R., Dinneen, M. J., & Shakiba, A. (2018). On fixed-parameter tractability of the mixed domination problem for graphs with bounded tree-width. Discrete Mathematics & Theoretical Computer Science, 20 (2)10.23638/DMTCS-20-2-2
  • Calude, C. S., Dinneen, M. J., & Hua, R. (2017). QUBO formulations for the graph isomorphism problem and related problems. Theoretical Computer Science, 701, 54-69. 10.1016/j.tcs.2017.04.016
    URL: http://hdl.handle.net/2292/45157
    Other University of Auckland co-authors: Cristian Calude
  • Dinneen, M. J., & Hua, R. (2017). Formulating graph covering problems for adiabatic quantum computers. Proceedings of the Australasian Computer Science Week Multiconference, 18:1-18:10. Geelong, Australia: ACM. 10.1145/3014812.3014830
  • Heidarian, A., & Dinneen, M. J. (2016). A hybrid geometric approach for measuring similarity level among documents and document clustering. Proceedings - 2016 IEEE 2nd International Conference on Big Data Computing Service and Applications, BigDataService 2016, 142-151. Oxford, UK: IEEE. 10.1109/BigDataService.2016.14
  • Calude, C. S., Calude, E., & Dinneen, M. J. (2015). Guest column: Adiabatic quantum computing challenges. SIGACT News, 46 (1), 40-61. 10.1145/2744447.2744459
    Other University of Auckland co-authors: Cristian Calude
  • Wei, K., & Dinneen, M. J. (2014). Runtime Analysis Comparison of Two Fitness Functions on a Memetic Algorithm for the Clique Problem. 2014 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 133-140.


Contact details

Alternative contact

Primary office location

SCIENCE CENTRE 303 - Bldg 303
Level 4, Room 425
New Zealand

Social links

Web links