| Connected power domination in graphs B Brimkov, D Mikesell, L Smith Journal of Combinatorial Optimization 38, 292-315, 2019 | 21 | 2019 |
| Power domination throttling B Brimkov, J Carlson, IV Hicks, R Patel, L Smith Theoretical Computer Science 795, 142-153, 2019 | 16 | 2019 |
| Computational and theoretical challenges for computing the minimum rank of a graph IV Hicks, B Brimkov, L Deaett, R Haas, D Mikesell, D Roberson, L Smith INFORMS Journal on Computing 34 (6), 2868-2872, 2022 | 7 | 2022 |
| Optimal sensor placement in power grids: Power domination, set covering, and the neighborhoods of zero forcing forts LA Smith, IV Hicks arXiv preprint arXiv:2006.03460, 2020 | 6 | 2020 |
| An integer program for positive semidefinite zero forcing in graphs LA Smith, DJ Mikesell, IV Hicks Networks 76 (3), 366-380, 2020 | 4 | 2020 |
| Fort neighborhoods: A set cover formulation for power domination L Smith | 3 | 2018 |
| An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs LA Smith, D Mildebrath, IV Hicks Networks 79 (1), 3-19, 2022 | 2 | 2022 |
| New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts LA Smith, IV Hicks Networks 79 (2), 202-219, 2022 | 1 | 2022 |
| Integer Programming Techniques for Propagation and Rainbow Connection Problems in Graphs LA Smith Rice University, 2021 | | 2021 |
| A Polynomial Time Algorithm for Computing the Strong Rainbow Connection Numbers of Odd Cacti LA Smith, DT Mildebrath, IV Hicks arXiv preprint arXiv:1912.11906, 2019 | | 2019 |
| Partitioning a graph into low-diameter clusters J Zhang, L Silveira, H Validi, L Smith, A Buchanan, IV Hicks | | |
Illya V. HicksProfessor of Computational and Applied Mathematics, Rice University在 rice.edu 的电子邮件经过验证
