My research focuses on graph searching, graph protection, and dynamic processes on graphs and these problems all focus on the following question:
How can the activity of an adversary be neutralized in a network?
A collection of agents move around a network according to a rule set. In graph searching, the goal is generally to locate a hidden mobile adversary, while for dynamic domination problems, the goal is generally to defend against a sequence of adversarial attacks. The study of such network security problems has largely been inspired by foundational issues in discrete mathematics and theoretical computer science. For more information on my research and publications, please visit https://sites.google.com/view/mmessinger.