Publications

* indicates student author

Accepted / Published

[31] M. Huggan, M.E. Messinger, A. Porter*, The damage number of the Cartesian product of graphs, Australasian Journal of Combinatorics 88(3) (2024) 362-384.

[30] D. Cox, E. Meger, M.E. Messinger, Eternal k-domination on graphs, La Matematica, 2, 283-302 (2023). [arXiv:2104.03835]

[29] N.E. Clarke, S. Finbow, M.E. Messinger, A. Porter*, A note on hyperopic cops and robber, Discrete Mathematics, Algorithms, and Applications, Vol 15, No 05 (2023). [arXiv:2107.07368 ]

[28] K. Adaricheva, H. Smith Blake, C. Bozeman, N.E. Clarke, R. Haas, M.E. Messinger, K. Seyffarth, Hamilton paths in dominating graphs of trees and cycles, Graph and Combinatorics (2022) 38:174 https://doi.org/10.1007/s00373-022-02579-8. [arXiv.2112.04448].

[27] K. Adaricheva, C. Bozeman, N.E. Clarke, R. Haas, M.E. Messinger, K. Seyffarth, H. Smith, Reconfiguration graphs for dominating sets, Chapter 6 in Research Trends in Graph Theory and Applications, D. Ferrero, L. Hogben, S.R. Kingan, and G.L. Matthews Eds., Springer International Publishing (2021).

[25] A. Angeli Ayello*, M.E. Messinger, A Note on the Parallel Cleaning of Cliques, Journal of Combinatorial Mathematics and Combinatorial Computing, 116 (2021) 315-326.

[25] D. Cox, N. Clarke, D. Dyer, S. Fitzpatrick, M. Messinger, Limited Visibility Cops and Robber, Discrete Applied Mathematics 282 (2020) 53-64 [arXiv.1708.07179].

[24] A. Bonato, N.E. Clarke, D. Cox, S. Finbow, F. Mc Inerney, M.E. Messinger, Hyperopic Cops and Robbers, Theoretical Computer Science 794 (2019) 59-69 [arXiV.1710.10112].

[23] N.E. Clarke, M.E. Messinger, G. Power*, Bounding the Search Number of Graph Products, Kyungpook Mathematical Journal, Vol 59, No 1 (2019) 175-190.

[22] C. Duffy, T.F. Lidbetter*, M.E. Messinger, R.J. Nowakowski, A Variation on Chip-Firing: the diffusion game, Discrete Mathematics and Theoretical Computer Science, Vol 20:1, #4 (2018) [arXiv:1609.05792].

[21] W.F. Klostermeyer, M.E. Messinger, A. Yeo, Dominating Vertex Covers: The Vertex-Edge Domination Problem, Discussiones Mathematicae Graph Theory 41 (2020) 123-132.

[20] S. Finbow, S. Gaspers, M.E. Messinger, P. Ottaway, A Note on the Eternal Dominating Set Problem, International Journal of Game Theory, Vol 47, Issue 2 (2018) 543-555.

[19] W.F. Klostermeyer, M.E. Messinger, A. Angeli Ayello*, Disjoint Dominating Sets with a Perfect Matching, Discrete Mathematics, Algorithms and Application, Vol. 9: Num. 5, 2017.

[18] W. F. Klostermeyer, M.E. Messinger, A. Angeli Ayello*, An Eternal Domination Problem in Grids, Theory and Applications of Graphs, Vol. 4 : Issue 1, Article 2, 2017.

[17] S.L. Fitzpatrick, J. Howell, M.E. Messinger, D.A. Pike, A Deterministic Version of the Game of Zombies and Survivors on Graphs, Discrete Applied Mathematics 213 (2016) 1-12.

[16] M.E. Messinger, A.Z. Delaney*, Closing the Gap: Eternal domination on 3 x n Grids, Contributions to Discrete Mathematics 12(1) (2017) 47-61.

[15] N.E. Clarke, S. Finbow, S. Fitzpatrick, M.E. Messinger, R. Milley, R.J. Nowakowski, Grundy Number and Graph Products, Discrete Applied Mathematics 202 (2016) 1-7.

[14] S. Finbow, M.E. Messinger, M. van Bommel, Eternal domination on 3 x n grid graphs, Australasian Journal of Combinatorics (61)2 (2015) 156-174.

[13] M.E. Messinger, R.J. Nowakowski, P. Prałat, Elimination schemes and Lattices, Discrete Mathematics 328 (2014) 63-70. 

[12] A. Bonato, N.E. Clarke, S. Finbow, S. Fitzpatrick, M.E. Messinger, A Note on Bounds for the Cop Number using Tree Decompositions, Contributions to Discrete Mathematics, (9)2 (2014) 50-56.

[11] A. Bonato, M.E. Messinger, P. Prałat, Fighting Constrained Fires in Graphs, Theoretical Computer Science 434 (2012) 11-22.

[10] M.E. Messinger, R.J. Nowakowski, P. Prałat, Cleaning with Brooms, Graphs and Combinatorics 28 (2011) 251-267.

[9] S. Gaspers, M.E. Messinger, R.J. Nowakowski, P. Prałat, Parallel Cleaning of a Network with Brushes, Discrete Applied Mathematics,158 (5) (2010) 467-478.

[8] N.E. Clarke, S. Finbow, S.L. Fitzpatrick, M.E. Messinger, R.J. Nowakowski, Seepage in directed acyclic graphs, Australasian Journal of Combinatorics 43 (2009) 91-102.

[7] S. Gaspers, M.E. Messinger, R.J. Nowakowski, P. Pralat Clean the Graph Before You Draw It!, Information Processing Letters 109 (2009) 463-467.

[6] M.E. Messinger, R.J. Nowakowski,  The Robot Cleans Up, Journal of Combinatorial Optimization, 18 (4) (2009) 350-361.

[5] M.E. Messinger,  Average Firefighting on Infinite Grids, Australasian Journal of Combinatorics, 41 (2008) 15-28.

[4] M.E. Messinger, R.J. Nowakowski,  The Robot Cleans Up, Proceedings of the 2nd Annual International Conference on Combinatorial Optimization and Applications (COCOA '08), Lecture Notes in Computer Science, Springer (2008) 309-318.

[3] M.E. Messinger, R.J. Nowakowski, P. Pralat, Cleaning a Network with Brushes, Theoretical Computer Science, 399 (2008)  191-205.

[2] M.E. Messinger,  Firefighting on the Triangular Grid, Journal of Combinatorial Mathematics and Combinatorial Computing, 63 (2007) 37-45.

[1] M.E. Messinger, R.J. Nowakowski, P. Prałat, N.C. Wormald, Cleaning random d-regular graphs with brushes using a degree-greedy algorithm, Proceedings of the 4th Workshop on Combinatorial andAlgorithmic Aspects of Networking (CAAN2007), Lecture Notes in  Computer Science, Springer (2007) 13-26.  

Non-Refereed Reports

[2] K. Galway, M.E. Messinger, Teaching Mathematics in Elementary and High Schools, Canadian Mathematics Society: Student Committee (2004) 21 pp.

[1] M.E. Messinger, Extra-Curricular Mathematics in High Schools, Canadian Mathematics Society:Student Committee (2004) 7 pp.

Theses

[3] M.E. Messinger, Methods of Decontaminating Networks, Ph.D. thesis, Dalhousie University, 2008.

[2] M.E. Messinger, Firefighting on the Infinite Grids, M.Sc. thesis, Dalhousie University 2004.

[1] M.E. Messinger, The Transportation Problem, B.Sc. honours thesis, University of Prince Edward Island, 2003.