Logan A. Smith

A Polynomial Time Algorithm for Computing the Strong Rainbow Connection Numbers of Odd Cacti pdf

Illya V. Hicks, Logan A. Smith, David T. Mildebrath, 2019, ArXiv.

An integer program for positive semidefinite zero forcing in graphs

Illya V. Hicks, Logan A. Smith, Derek Mikesell, 2020, Networks.

Optimal Sensor Placement in Power Grids: Power Domination, Set Covering, and the Neighborhoods of Zero Forcing Forts pdf

Illya V. Hicks, Logan A. Smith, 2020, ArXiv.

An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs pdf

Illya V. Hicks, Logan A. Smith, David T. Mildebrath, 2020, ArXiv.

New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts

Illya V. Hicks, Logan A. Smith, 2021 .

An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs

Logan A. Smith, David T. Mildebrath, I. Hicks, 2020, Networks.

Power domination throttling

Boris Brimkov, Illya V. Hicks, Logan Smith, 2018, Theor. Comput. Sci..

Connected power domination in graphs

Boris Brimkov, Logan Smith, Logan A. Smith, 2017, Journal of Combinatorial Optimization.