Boris Brimkov

According to our database, Boris Brimkov authored at least 37 papers between 2008 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

On a conjecture of TxGraffiti: Relating zero forcing and vertex covers in graphs.

Boris Brimkov, Randy Davila, Houston Schuerger, Michael Young

Discret. Appl. Math., 2024

Graphs with degree sequence {(m-1)m,(n-1)n} and {mn,nm}.

Boris Brimkov, Valentin E. Brimkov

Discret. Appl. Math., 2024

2022

Intersections and circuits in sets of line segments.

Boris Brimkov, Jesse Geneson, Alathea Jensen, Jordan Broussard, Pouria Salehi Nowbandegani

J. Comb. Optim., 2022

Optimal conditions for connectedness of discretized sets.

Boris Brimkov, Valentin E. Brimkov

J. Comb. Optim., 2022

Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph.

Illya V. Hicks, Boris Brimkov, Louis Deaett, Ruth Haas, Derek Mikesell, David Roberson, Logan A. Smith

INFORMS J. Comput., 2022

2021

On the status sequences of trees.

Aida Abiad, Boris Brimkov, Alexander Grigoriev

Theor. Comput. Sci., 2021

Tangle bases: Revisited.

Illya V. Hicks, Boris Brimkov

Networks, 2021

Improved Computational Approaches and Heuristics for Zero Forcing.

Boris Brimkov, Derek Mikesell, Illya V. Hicks

INFORMS J. Comput., 2021

2020

The Slater and sub-<i>k</i>-domination number of a graph with applications to domination and <i>k</i>-domination.

David Amos, John Asplund, Boris Brimkov, Randy Davila

Discuss. Math. Graph Theory, 2020

On Connectedness of Discretized Sets.

Boris Brimkov, Valentin E. Brimkov

Proceedings of the Combinatorial Image Analysis - 20th International Workshop, 2020

2019

Power domination throttling.

Boris Brimkov, Joshua Carlson, Illya V. Hicks, Rutvik Patel, Logan A. Smith

Theor. Comput. Sci., 2019

Connected power domination in graphs.

Boris Brimkov, Derek Mikesell, Logan A. Smith

J. Comb. Optim., 2019

Restricted power domination and zero forcing problems.

Chassidy Bozeman, Boris Brimkov, Craig Erickson, Daniela Ferrero, Mary Flagg, Leslie Hogben

J. Comb. Optim., 2019

Computational approaches for zero forcing and related problems.

Boris Brimkov, Caleb C. Fast, Illya V. Hicks

Eur. J. Oper. Res., 2019

The zero forcing polynomial of a graph.

Kirk Boyer, Boris Brimkov, Sean English, Daniela Ferrero, Ariel Keller, Rachel Kirsch, Michael Phillips, Carolyn Reinhart

Discret. Appl. Math., 2019

Cop throttling number: Bounds, values, and variants.

Anthony Bonato, Jane Breen, Boris Brimkov, Joshua Carlson, Sean English, Jesse Geneson, Leslie Hogben, K. E. Perry, Carolyn Reinhart

CoRR, 2019

2018

Throttling for the game of Cops and Robbers on graphs.

Jane Breen, Boris Brimkov, Joshua Carlson, Leslie Hogben, K. E. Perry, Carolyn Reinhart

Discret. Math., 2018

2017

Injective choosability of subcubic planar graphs with girth 6.

Boris Brimkov, Jennifer Edmond, Robert Lazar, Bernard Lidický, Kacy Messerschmidt, Shanise Walker

Discret. Math., 2017

Complexity and computation of connected zero forcing.

Boris Brimkov, Illya V. Hicks

Discret. Appl. Math., 2017

Memory efficient algorithms for cactus graphs and block graphs.

Boris Brimkov, Illya V. Hicks

Discret. Appl. Math., 2017

On the Wiener index, distance cospectrality and transmission-regular graphs.

Aida Abiad, Boris Brimkov, Aysel Erey, Lorinda Leshock, Xavier Martínez-Rivera, Suil O, Sung-Yell Song, Jason Williford

Discret. Appl. Math., 2017

Graphs with Extremal Connected Forcing Numbers.

Boris Brimkov, Caleb C. Fast, Illya V. Hicks

CoRR, 2017

On Sets of Line Segments Featuring a Cactus Structure.

Boris Brimkov

Proceedings of the Combinatorial Image Analysis - 18th International Workshop, 2017

2016

On the logspace shortest path problem.

Boris Brimkov, Illya V. Hicks

Electron. Colloquium Comput. Complex., 2016

Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs.

Boris Brimkov, Illya V. Hicks

Discret. Appl. Math., 2016

Characterizations of the Connected Forcing Number of a Graph.

Boris Brimkov, Randy Davila

CoRR, 2016

Complexity and Computation of Connected Zero Forcing.

Boris Brimkov

CoRR, 2016

The sub-$k$-domination number of a graph with applications to $k$-domination.

David Amos, John Asplund, Boris Brimkov, Randy Davila

CoRR, 2016

2015

A reduction of the logspace shortest path problem to biconnected graphs.

Boris Brimkov

CoRR, 2015

A note on the clique number of complete k-partite graphs.

Boris Brimkov

CoRR, 2015

2014

Geometric approach to string analysis for biosequence classification.

Boris Brimkov

J. Integr. Bioinform., 2014

Geometric Approach to Biosequence Analysis.

Boris Brimkov, Valentin E. Brimkov

Proceedings of the 8th International Conference on Practical Applications of Computational Biology & Bioinformatics, 2014

2013

Memory Efficient Shortest Path Algorithms for Cactus Graphs.

Boris Brimkov

Proceedings of the Advances in Visual Computing - 9th International Symposium, 2013

2012

A spectral and radial basis function hybrid method for visualizing vascular flows.

Boris Brimkov, Jae-Hun Jung, Jim Kotary, Xinwei Liu, Jing Zheng

Proceedings of the Computational Modelling of Objects Represented in Images, 2012

2011

Connected distance-based rasterization of objects in arbitrary dimension.

Valentin E. Brimkov, Reneta P. Barneva, Boris Brimkov

Graph. Model., 2011

2009

Minimal Offsets That Guarantee Maximal or Minimal Connectivity of Digital Curves in <i>n</i>D.

Valentin E. Brimkov, Reneta P. Barneva, Boris Brimkov

Proceedings of the Discrete Geometry for Computer Imagery, 2009

2008

Offset Approach to Defining 3D Digital Lines.

Valentin E. Brimkov, Reneta P. Barneva, Boris Brimkov, François de Vieilleville

Proceedings of the Advances in Visual Computing, 4th International Symposium, 2008