Papers

In preparation

  1. The total cost of capturing a robber (with D. Khatri, A. Krim-Yee, N. Komarov, N. Kumar, V. Virgile, A. Xu).
  2. Fractional eternal domination (with D. Khatri, A. Krim-Yee, N. Kumar, G. MacGillivray, V. Virgile, A. Xu).
  3. Non-extendible cycles in strongly chordal graphs (with M. Lafond, R. Sherkati)
  4. Extending cycles in claw-light graphs

Submitted

  1. A study of cops and robbers in oriented graphs (with D. Khatri, N. Komarov, A. Krim-Yee, N. Kumar, V. Virgile, A. Xu) arXiv
  2. Edge clique covers in graphs with independence number two (with P. Charbit, G. Hahn, M. Kamiński, M. Lafond, N. Lichiardopol, R. Naserasr, R. Sherkati)

Published journal articles

  1. A method for eternally dominating strong grids, Discrete Math. Theor. Comput. Sci., 22:1, #8, 2020 (with A. Gagnon, A. Hassler, J. Huang, A. Krim-Yee, F. Mc Inerney, A. Mejía Zacarías, V. Virgile)Journal | HAL
  2. Eternal domination on prisms of graphs, Discrete Appl. Math, 283, 734–736, 2020 (with A. Krim-Yee, V. Virgile)Journal | arXiv
  3. Fully active cops and robbers, Australas. J. Combin, 76:2, 248–265, 2020 (with I. Gromovikov, B. Kinnersley).Journal | arXiv
  4. Hamiltonian chordal graphs are not cycle extendible, SIAM J. Disc. Math, 29:2, 877–887, 2015 (with M. Lafond). Journal | arXiv
  5. On uniquely Hamiltonian claw-free and triangle-free graphs, Discuss. Math. Graph Theory, 35:2, 207–214, 2015. Journal
  6. Bounding the monomial index and (1,l)-weight choosability of a graph, Discrete Math. Theor. Comput. Sci., 16:3, 173–188, 2104. Journal | arXiv
  7. Sequence variations of the 1-2-3 Conjecture and irregularity strength. Discrete Math. Theor. Comput. Sci., 15:1, 15–28, 2013 (with B. Stevens). Journal | arXiv
  8. Vertex-colouring edge-weightings with two edge weights. Discrete Math. Theor. Comput. Sci.,14:1, 1–20, 2012 (with M. Khatirinejad, R. Naserasr, M. Newman, B. Stevens). Journal
  9. Spanning Trees with Specified Differences in Cayley Graphs. Discrete Math., 312:17, 2561–2565, 2012 (with B. Stevens) Journal
  10. π/2-Angle Yao Graphs are Spanners. Internat. J. Comput. Geom. Appl., 22:1, 61-82, 2012 (with P. Bose, M. Damian, K. Douïeb, J. O’Rourke, M. Smid, S. Wuhrer). Journal | arXiv
  11. Digraphs are 2-weight choosable. Electron. J. Combin., 18, #P21, 2011 (with M. Khatirinejad,R. Naserasr, M. Newman, B. Stevens). Journal
  12. Independent dominating sets and hamiltonian cycles. J. Graph Theory, 54:3, 233-244, 2007 (with P. Haxell, J. Verstraëte). Journal

In conference proceedings

  1. π/2-Angle Yao Graphs are Spanners. Algorithms and Computation, Part II, 446–457, Lecture Notes in Comput. Sci., 6507, Springer, Berlin (with P. Bose, M. Damian, K. Douïeb, J. O’Rourke, M. Smid, S. Wuhrer). Journal | arXiv

Unpublished

  1. The 1-2-3 Conjecture and related problems: a survey, 2012 arXiv
  2. Derived Colourings of Graphs (Ph.D. Thesis), 2012 PDF
  3. Sheehan’s Conjecture and Parity Results on Regular, Hamiltonian Graphs (M.Math Thesis), 2004
  4. Skolem Tree Labeling (Research Report, Mount Allison University), 2002
  5. Extended near-Skolem sequences (Research Report, Mount Allison University), 2001