Independent dominating sets and hamiltonian cycles. - Penny E. Haxell; Ben Seamone; Jacques Verstraëte (J. Graph Theory, 2007)

pi/2-Angle Yao Graphs Are Spanners. - Prosenjit Bose; Mirela Damian; Karim Douïeb; Joseph O'Rourke; Ben Seamone; Michiel H. M. Smid; Stefanie Wuhrer (ISAAC (2), 2010)

Pi/2-Angle Yao Graphs are Spanners - Prosenjit Bose; Mirela Damian; Karim Douïeb; Joseph O'Rourke; Ben Seamone; Michiel H. M. Smid; Stefanie Wuhrer (CoRR, 2010)

Digraphs are 2-Weight Choosable. - Mahdad Khatirinejad; Reza Naserasr; Mike Newman; Ben Seamone; Brett Stevens (Electron. J. Comb., 2011)

The 1-2-3 Conjecture and related problems: a survey - Ben Seamone (CoRR, 2012)

Spanning trees with specified differences in Cayley graphs. - Ben Seamone; Brett Stevens (Discret. Math., 2012)

Vertex-colouring edge-weightings with two edge weights. - Mahdad Khatirinejad; Reza Naserasr; Mike Newman; Ben Seamone; Brett Stevens (Discret. Math. Theor. Comput. Sci., 2012)

π/2-Angle Yao Graphs are Spanners. - Prosenjit Bose; Mirela Damian; Karim Douïeb; Joseph O'Rourke; Ben Seamone; Michiel H. M. Smid; Stefanie Wuhrer (Int. J. Comput. Geom. Appl., 2012)

Hamiltonian chordal graphs are not cycle extendible. - Manuel Lafond; Ben Seamone (CoRR, 2013)

Sequence variations of the 1-2-3 Conjecture and irregularity strength. - Ben Seamone; Brett Stevens (Discret. Math. Theor. Comput. Sci., 2013)

Bounding the monomial index and (1, l)-weight choosability of a graph. - Ben Seamone (Discret. Math. Theor. Comput. Sci., 2014)

Hamiltonian Chordal Graphs are not Cycle Extendable. - Manuel Lafond; Ben Seamone (SIAM J. Discret. Math., 2015)

Cops and robbers on oriented graphs. - Devvrit Khatri; Natasha Komarov; Aaron Krim-Yee; Nithish Kumar; Ben Seamone; Virgélot Virgile; Anqi Xu (CoRR, 2018)

Fully active cops and robbers. - Ilya Gromovikov; William B. Kinnersley; Ben Seamone (Australas. J Comb., 2020)

Eternal domination on prisms of graphs. - Aaron Krim-Yee; Ben Seamone; Virgélot Virgile (Discret. Appl. Math., 2020)

A method for eternally dominating strong grids. - Alizée Gagnon; Alexander Hassler; Jerry Huang; Aaron Krim-Yee; Fionn Mc Inerney; Andrés Zacarías; Ben Seamone; Virgélot Virgile (Discret. Math. Theor. Comput. Sci., 2020)

The Speed and Threshold of the Biased Perfect Matching Game. - Noah Brüstle; Sarah Clusiau; Vishnu V. Narayan; Ndiamé Ndiaye; Bruce A. Reed; Ben Seamone (LAGOS, 2021)

The Speed and Threshold of the Biased Hamilton Cycle Game. - Noah Brüstle; Sarah Clusiau; Vishnu V. Narayan; Ndiamé Ndiaye; Bruce A. Reed; Ben Seamone (LAGOS, 2021)

Edge clique covers in graphs with independence number two. - Pierre Charbit; Gena Hahn; Marcin Kaminski 001; Manuel Lafond; Nicolas Lichiardopol; Reza Naserasr; Ben Seamone; Rezvan Sherkati (J. Graph Theory, 2021)

Few hamiltonian cycles in graphs with one or two vertex degrees. - Jan Goedgebeur; Jorik Jooken; On-Hei Solomon Lo; Ben Seamone; Carol T. Zamfirescu (CoRR, 2022)

Further results on Hendry's Conjecture. - Manuel Lafond; Ben Seamone; Rezvan Sherkati (Discret. Math. Theor. Comput. Sci., 2022)

The speed and threshold of the biased perfect matching and Hamilton cycle games. - Noah Brüstle; Sarah Clusiau; Vishnu V. Narayan; Ndiamé Ndiaye; Bruce A. Reed; Ben Seamone (Discret. Appl. Math., 2023)

Fractional eternal domination: securely distributing resources across a network. - Devvrit; Aaron Krim-Yee; Nithish Kumar; Gary MacGillivray; Ben Seamone; Virgélot Virgile; Anqi Xu (Discuss. Math. Graph Theory, 2024)

Defective acyclic colorings of planar graphs. - On-Hei Solomon Lo; Ben Seamone; Xuding Zhu (J. Graph Theory, 2024)