| On the Wiener index, distance cospectrality and transmission-regular graphs A Abiad, B Brimkov, A Erey, L Leshock, X Martínez-Rivera, O Suil, ... Discrete Applied Mathematics 230, 1-10, 2017 | 53 | 2017 |
| Computational approaches for zero forcing and related problems B Brimkov, CC Fast, IV Hicks European Journal of Operational Research 273 (3), 889-903, 2019 | 50 | 2019 |
| Complexity and computation of connected zero forcing B Brimkov, IV Hicks Discrete Applied Mathematics 229, 31-45, 2017 | 41 | 2017 |
| Throttling for the game of Cops and Robbers on graphs J Breen, B Brimkov, J Carlson, L Hogben, KE Perry, C Reinhart Discrete Mathematics 341 (9), 2418-2430, 2018 | 34 | 2018 |
| Restricted power domination and zero forcing problems C Bozeman, B Brimkov, C Erickson, D Ferrero, M Flagg, L Hogben Journal of Combinatorial Optimization 37, 935-956, 2019 | 32 | 2019 |
| Integrating technology-enhanced collaborative surfaces and gamification for the next generation classroom RP Barneva, K Kanev, B Kapralos, M Jenkin, B Brimkov Journal of Educational Technology Systems 45 (3), 309-325, 2017 | 28 | 2017 |
| Connected power domination in graphs B Brimkov, D Mikesell, L Smith Journal of Combinatorial Optimization 38, 292-315, 2019 | 21 | 2019 |
| The zero forcing polynomial of a graph K Boyer, B Brimkov, S English, D Ferrero, A Keller, R Kirsch, M Phillips, ... Discrete Applied Mathematics 258, 35-48, 2019 | 21 | 2019 |
| Characterizations of the connected forcing number of a graph B Brimkov, R Davila arXiv preprint arXiv:1604.00740, 2016 | 20 | 2016 |
| Spectral bounds for the connectivity of regular graphs with given order A Abiad, B Brimkov, X Martinez-Rivera, O Suil, J Zhang arXiv preprint arXiv:1703.02748, 2017 | 19 | 2017 |
| Graphs that are cospectral for the distance Laplacian B Brimkov, K Duna, L Hogben, K Lorenzen, C Reinhart, SY Song, ... arXiv preprint arXiv:1812.05734, 2018 | 18 | 2018 |
| Power domination throttling B Brimkov, J Carlson, IV Hicks, R Patel, L Smith Theoretical Computer Science 795, 142-153, 2019 | 16 | 2019 |
| Memory efficient algorithms for cactus graphs and block graphs B Brimkov, IV Hicks Discrete Applied Mathematics 216, 393-407, 2017 | 15 | 2017 |
| Connected distance-based rasterization of objects in arbitrary dimension VE Brimkov, RP Barneva, B Brimkov Graphical models 73 (6), 323-334, 2011 | 14 | 2011 |
| Optimizing the trade-off between number of cops and capture time in Cops and Robbers A Bonato, J Breen, B Brimkov, J Carlson, S English, J Geneson, L Hogben, ... arXiv preprint arXiv:1903.10087, 2019 | 11 | 2019 |
| Minimal Offsets That Guarantee Maximal or Minimal Connectivity of Digital Curves in nD VE Brimkov, RP Barneva, B Brimkov International Conference on Discrete Geometry for Computer Imagery, 337-349, 2009 | 11 | 2009 |
| Improved computational approaches and heuristics for zero forcing B Brimkov, D Mikesell, IV Hicks INFORMS Journal on Computing 33 (4), 1384-1399, 2021 | 9 | 2021 |
| Computer assisted discovery: Zero forcing vs vertex cover B Brimkov, R Davila, H Schuerger, M Young arXiv preprint arXiv:2209.04552, 2022 | 8 | 2022 |
| On the status sequences of trees A Abiad, B Brimkov, A Grigoriev Theoretical Computer Science 856, 110-120, 2021 | 8 | 2021 |
| Graphs with extremal connected forcing numbers B Brimkov, CC Fast, IV Hicks arXiv preprint arXiv:1701.08500, 2017 | 8 | 2017 |
