Boris Brimkov

Computer Science · Physical Sciences

8h-index233citations69works0.52yr avg
OpenAlex↗ORCID↗Google Scholar↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Advanced Graph Theory Research(36), Graph theory and applications(21), Complexity and Algorithms in Graphs(15), Graph Labeling and Dimension Problems(15), Interconnection Networks and Systems(9)

Publications69 total

Connected forcing density and related problems
SSRN Electronic Journal·2026Open Access
Throttling for metric dimension and its variants
arXiv (Cornell University)·2025Open Access
In Reverie Together: Ten Years of Mathematical Discovery with a Machine Collaborator
arXiv (Cornell University)·2025Open Access
Connected forcing density and related problems
arXiv (Cornell University)·2025Open Access
On the forts and related parameters of the hypercube graph
arXiv (Cornell University)·2025Open Access
Graphs with degree sequence <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e247" altimg="si7.svg"><mml:mrow><mml:mo>{</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>m</mml:mi><mml:mo>−</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>n</mml:mi><mml:mo>−</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup><mml:mo>}</mml:mo></mml:mrow></mml:math> and <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e289" altimg="si8.svg"><mml:mrow><mml:mo>{</mml:mo><mml:msup><mml:mrow><mml:mi>m</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:msup><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msup><mml:mo>}</mml:mo></mml:mrow></mml:math>
Discrete Applied Mathematics·2024
On a conjecture of TxGraffiti: Relating zero forcing and vertex covers in graphs
Discrete Applied Mathematics·2024· 2 cited
The Many Face(t)s of Zero Forcing
Notices of the American Mathematical Society·2024· 2 citedOpen Access
Graphs with degree sequence $\{m^{m-1},n^{n-1}\}$ and $\{m^n,n^m\}$
arXiv (Cornell University)·2023Open Access
Coloring Intersection Points of Line Segments
2023Open Access
Extending a conjecture of Graham and Lovász on the distance characteristic polynomial
Linear Algebra and its Applications·2023· 5 citedOpen Access
Computer assisted discovery: Zero forcing vs vertex cover
arXiv (Cornell University)·2022· 1 citedOpen Access
Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph
INFORMS journal on computing·2022· 6 citedOpen Access
Extending a conjecture of Graham and Lovász on the distance characteristic polynomial
arXiv (Cornell University)·2022Open Access
Constructions of cospectral graphs with different zero forcing numbers
Electronic Journal of Linear Algebra·2022· 1 citedOpen Access
Minimal Zero Forcing Sets
arXiv (Cornell University)·2022· 1 citedOpen Access
Optimizing the trade-off between number of cops and capture time in Cops and Robbers
Journal of Combinatorics·2022· 7 cited
Constructions of cospectral graphs with different zero forcing numbers
arXiv (Cornell University)·2021Open Access
Intersections and circuits in sets of line segments
Journal of Combinatorial Optimization·2021
Improved Computational Approaches and Heuristics for Zero Forcing
INFORMS journal on computing·2021· 9 cited
page 1 of 4Next →

Frequent Co-authors

Illya V. Hicks(9), Aida Abiad(8), Valentin E. Brimkov(7), Carolyn Reinhart(5), Randy Davila(5), Leslie Hogben(5), Xavier Martínez-Rivera(4), O Suil(4), Reneta P. Barneva(4), Sean English(4), Jane Breen(4), Jesse Geneson(4), Sung‐Yell Song(3), Derek Mikesell(3), Anthony Bonato(3), Joshua Carlson(3), Logan A. Smith(3), Aysel Erey(2), Lorinda Leshock(2), Jason Williford(2)