## Current Research

I have several ongoing projects related to the zero forcing number of a graph. In particular, I am in a group with Leslie Hogben (Iowa State University), Franklin Kenter (US Naval Academy), and several others in which we are using the forts of a graph to derive lower bounds on the zero forcing number of a cartesian product of two graphs. Also, I am writing a paper in which I derive IP models for the zero forcing number, propagation time, throttling number, fractional zero forcing number, and fort number of a graph. This paper will include an open-source repository of C++ code so that other researchers can benefit from these models. Finally, I am also continuing my work with Stef Graillat (University of Paris) to develop methods for polynomial evaluation that are as accurate as if computed in k-fold precision, for any k greater than or equal to 2, and then rounded into the working precision. We have submitted our work for publication in the journal BIT Numerical Mathematics.