Research Interests: 
My research primarily focuses on problems in graph theory and, in particular, grid graphs, such as the chessboard. Eternal domination involves the placement of mobile guards on the graph with the intention of guarding against an infinite sequence of attacks by repeatedly having the guards move to be able to reach the attacked vertex in each round. After recently solving the problem for 3 x n grid graphs, we are continuing work on the 5 x n grid, as well as the more general m x n grid. Queen’s domination on a chessboard, or the n-Queens problem, has been studied extensively. We are investigating queen’s domination and variations, including adding other chess pieces, in general but more recently as a two-player strategy game.

Areas of Research:
Object-oriented database modeling and retrieval