Boris Brimkov

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 30

Top Topics

Computational Approaches

Top Venues

Discret. Appl. Math.

J. Comb. Optim.

INFORMS J. Comput.

Publications

Boris Brimkov, Randy Davila, Houston Schuerger, Michael Young
On a conjecture of TxGraffiti: Relating zero forcing and vertex covers in graphs. Discret. Appl. Math. 359 (2024)
Boris Brimkov, Valentin E. Brimkov
Graphs with degree sequence {(m-1)m,(n-1)n} and {mn,nm}. Discret. Appl. Math. 358 (2024)
Illya V. Hicks, Boris Brimkov, Louis Deaett, Ruth Haas, Derek Mikesell, David Roberson, Logan A. Smith
Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph. INFORMS J. Comput. 34 (6) (2022)
Boris Brimkov, Valentin E. Brimkov
Optimal conditions for connectedness of discretized sets. J. Comb. Optim. 43 (5) (2022)
Boris Brimkov, Jesse Geneson, Alathea Jensen, Jordan Broussard, Pouria Salehi Nowbandegani
Intersections and circuits in sets of line segments. J. Comb. Optim. 44 (4) (2022)
Aida Abiad, Boris Brimkov, Alexander Grigoriev
On the status sequences of trees. Theor. Comput. Sci. 856 (2021)
Illya V. Hicks, Boris Brimkov
Tangle bases: Revisited. Networks 77 (1) (2021)
Boris Brimkov, Derek Mikesell, Illya V. Hicks
Improved Computational Approaches and Heuristics for Zero Forcing. INFORMS J. Comput. 33 (4) (2021)
Boris Brimkov, Valentin E. Brimkov
On Connectedness of Discretized Sets. IWCIA (2020)
David Amos, John Asplund, Boris Brimkov, Randy Davila
-domination. Discuss. Math. Graph Theory 40 (1) (2020)
Boris Brimkov, Joshua Carlson, Illya V. Hicks, Rutvik Patel, Logan A. Smith
Power domination throttling. Theor. Comput. Sci. 795 (2019)
Boris Brimkov, Derek Mikesell, Logan A. Smith
Connected power domination in graphs. J. Comb. Optim. 38 (1) (2019)
Boris Brimkov, Caleb C. Fast, Illya V. Hicks
Computational approaches for zero forcing and related problems. Eur. J. Oper. Res. 273 (3) (2019)
Kirk Boyer, Boris Brimkov, Sean English, Daniela Ferrero, Ariel Keller, Rachel Kirsch, Michael Phillips, Carolyn Reinhart
The zero forcing polynomial of a graph. Discret. Appl. Math. 258 (2019)
Anthony Bonato, Jane Breen, Boris Brimkov, Joshua Carlson, Sean English, Jesse Geneson, Leslie Hogben, K. E. Perry, Carolyn Reinhart
Cop throttling number: Bounds, values, and variants. CoRR (2019)
Chassidy Bozeman, Boris Brimkov, Craig Erickson, Daniela Ferrero, Mary Flagg, Leslie Hogben
Restricted power domination and zero forcing problems. J. Comb. Optim. 37 (3) (2019)
Jane Breen, Boris Brimkov, Joshua Carlson, Leslie Hogben, K. E. Perry, Carolyn Reinhart
Throttling for the game of Cops and Robbers on graphs. Discret. Math. 341 (9) (2018)
Boris Brimkov, Valentin E. Brimkov
Optimal conditions for connectedness of discretized sets. CoRR (2018)
Boris Brimkov, Caleb C. Fast, Illya V. Hicks
Graphs with Extremal Connected Forcing Numbers. CoRR (2017)
Boris Brimkov, Caleb C. Fast, Illya V. Hicks
Computational Approaches for Zero Forcing and Related Problems. CoRR (2017)
Boris Brimkov, Illya V. Hicks
Complexity and computation of connected zero forcing. Discret. Appl. Math. 229 (2017)
Aida Abiad, Boris Brimkov, Aysel Erey, Lorinda Leshock, Xavier Martínez-Rivera, Suil O, Sung-Yell Song, Jason Williford
On the Wiener index, distance cospectrality and transmission-regular graphs. Discret. Appl. Math. 230 (2017)
Boris Brimkov
On Sets of Line Segments Featuring a Cactus Structure. IWCIA (2017)
Boris Brimkov, Jennifer Edmond, Robert Lazar, Bernard Lidický, Kacy Messerschmidt, Shanise Walker
Injective choosability of subcubic planar graphs with girth 6. Discret. Math. 340 (10) (2017)
Boris Brimkov, Illya V. Hicks
Memory efficient algorithms for cactus graphs and block graphs. Discret. Appl. Math. 216 (2017)
Boris Brimkov, Illya V. Hicks
On the logspace shortest path problem. Electron. Colloquium Comput. Complex. 23 (2016)
David Amos, John Asplund, Boris Brimkov, Randy Davila
The sub-$k$-domination number of a graph with applications to $k$-domination. CoRR (2016)
Boris Brimkov
Complexity and Computation of Connected Zero Forcing. CoRR (2016)
Boris Brimkov, Randy Davila
Characterizations of the Connected Forcing Number of a Graph. CoRR (2016)
Boris Brimkov, Illya V. Hicks
Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs. Discret. Appl. Math. 204 (2016)
Boris Brimkov
A reduction of the logspace shortest path problem to biconnected graphs. CoRR (2015)
Boris Brimkov, Illya V. Hicks
Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs. CoRR (2015)
Boris Brimkov
A note on the clique number of complete k-partite graphs. CoRR (2015)
Boris Brimkov, Valentin E. Brimkov
Geometric Approach to Biosequence Analysis. PACBB (2014)
Boris Brimkov
Geometric approach to string analysis for biosequence classification. J. Integr. Bioinform. 11 (3) (2014)
Boris Brimkov
Memory Efficient Shortest Path Algorithms for Cactus Graphs. ISVC (1) (2013)
Boris Brimkov, Jae-Hun Jung, Jim Kotary, Xinwei Liu, Jing Zheng
A spectral and radial basis function hybrid method for visualizing vascular flows. CompIMAGE (2012)
Valentin E. Brimkov, Reneta P. Barneva, Boris Brimkov
Connected distance-based rasterization of objects in arbitrary dimension. Graph. Model. 73 (6) (2011)
Valentin E. Brimkov, Reneta P. Barneva, Boris Brimkov
D. DGCI (2009)
Valentin E. Brimkov, Reneta P. Barneva, Boris Brimkov, François de Vieilleville
Offset Approach to Defining 3D Digital Lines. ISVC (1) (2008)