A Polynomial Time Algorithm for Computing the Strong Rainbow Connection Numbers of Odd Cacti. - Logan A. Smith; David T. Mildebrath; Illya V. Hicks (CoRR, 2019)

Connected power domination in graphs. - Boris Brimkov; Derek Mikesell; Logan A. Smith (J. Comb. Optim., 2019)

Power domination throttling. - Boris Brimkov; Joshua Carlson; Illya V. Hicks; Rutvik Patel; Logan A. Smith (Theor. Comput. Sci., 2019)

Optimal Sensor Placement in Power Grids: Power Domination, Set Covering, and the Neighborhoods of Zero Forcing Forts. - Logan A. Smith; Illya V. Hicks (CoRR, 2020)

An integer program for positive semidefinite zero forcing in graphs. - Logan A. Smith; Derek Mikesell; Illya V. Hicks (Networks, 2020)

Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph. - Illya V. Hicks; Boris Brimkov; Louis Deaett; Ruth Haas; Derek Mikesell; David E. Roberson; Logan A. Smith (INFORMS J. Comput., 2022)

New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts. - Logan A. Smith; Illya V. Hicks (Networks, 2022)

An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs. - Logan A. Smith; David T. Mildebrath; Illya V. Hicks (Networks, 2022)