Benjamin D Seamone

Benjamin D Seamone is a permanent faculty member in the Mathematics Department at Dawson College (Montreal) and an adjunct research faculty in the Department of Computer Science and Operations Research at Université de Montréal. His research focuses on graph theory, including structural properties of graphs, graph searching, and surveillance. He holds a PhD in Applied Mathematics from Carleton University (2014), an MMath in Combinatorics and Optimization from the University of Waterloo, and a BSc from Canada's #1 undergraduate university. He coordinates Dawson College’s pre-university programs in Science nature and Sciences, informatique et mathématique.

Education:

• PhD in Applied Mathematics, Carleton University (2014), supervised by Brett Stevens.
• MMath in Combinatorics and Optimization, University of Waterloo, co-supervised by Penny Haxell and Jacques Verstraëte.
• BSc from #1 undergraduate university in Canada.

Research Interests: Seamone’s work centers on graph theory, particularly structural properties of graphs, graph searching algorithms, and network surveillance. His contributions include studies on acyclic colorings, eternal domination, Hamiltonian cycles, and biased combinatorial games. He collaborates widely, with affiliations to CRM and ISM Combinatorics and Algebra groups, and has conducted research at LaBRI (Université de Bordeaux).

Publications Trends: His articles span topics from planar graph colorings to combinatorial game thresholds, reflecting a strong focus on discrete mathematics and algorithmic graph theory. Recent work emphasizes eternal domination and Hamiltonian cycle dynamics.

Awards and Grants: No formal scientific awards are listed, though he has an Erdős number of 3. His research has been NSERC-funded during his postdoctoral fellowship at Université de Montréal.

Lab/Tech Affiliations: Member of CRM and ISM Combinatorics groups, and previously at LaBRI (Bordeaux).