default search action
Boris Brimkov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j22]Boris Brimkov, Valentin E. Brimkov:
Graphs with degree sequence {(m-1)m,(n-1)n} and {mn,nm}. Discret. Appl. Math. 358: 477-486 (2024) - [j21]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: 290-302 (2024) - 2022
- [j20]Illya V. Hicks
, Boris Brimkov, Louis Deaett, Ruth Haas, Derek Mikesell, David Roberson
Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph. INFORMS J. Comput. 34(6): 2868-2872 (2022) - [j19]Boris Brimkov, Valentin E. Brimkov:
Optimal conditions for connectedness of discretized sets. J. Comb. Optim. 43(5): 1493-1506 (2022) - [j18]Boris Brimkov, Jesse Geneson
Intersections and circuits in sets of line segments. J. Comb. Optim. 44(4): 2302-2323 (2022) - 2021
- [j17]Boris Brimkov, Derek Mikesell
Improved Computational Approaches and Heuristics for Zero Forcing. INFORMS J. Comput. 33(4): 1384-1399 (2021) - [j16]Illya V. Hicks
Tangle bases: Revisited. Networks 77(1): 161-172 (2021) - [j15]Aida Abiad, Boris Brimkov, Alexander Grigoriev
On the status sequences of trees. Theor. Comput. Sci. 856: 110-120 (2021) - 2020
- [j14]David Amos, John Asplund, Boris Brimkov, Randy Davila:
The Slater and sub-k-domination number of a graph with applications to domination and k-domination. Discuss. Math. Graph Theory 40(1): 209-225 (2020) - [c7]Boris Brimkov, Valentin E. Brimkov:
On Connectedness of Discretized Sets. IWCIA 2020: 20-28
2010 – 2019
- 2019
- [j13]Kirk Boyer, Boris Brimkov, Sean English
The zero forcing polynomial of a graph. Discret. Appl. Math. 258: 35-48 (2019) - [j12]Boris Brimkov, Caleb C. Fast, Illya V. Hicks
Computational approaches for zero forcing and related problems. Eur. J. Oper. Res. 273(3): 889-903 (2019) - [j11]Chassidy Bozeman, Boris Brimkov, Craig Erickson
Restricted power domination and zero forcing problems. J. Comb. Optim. 37(3): 935-956 (2019) - [j10]Boris Brimkov, Derek Mikesell, Logan A. Smith:
Connected power domination in graphs. J. Comb. Optim. 38(1): 292-315 (2019) - [j9]Boris Brimkov, Joshua Carlson, Illya V. Hicks
Power domination throttling. Theor. Comput. Sci. 795: 142-153 (2019) - [i11]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 abs/1903.10087 (2019) - 2018
- [j8]Jane Breen
Throttling for the game of Cops and Robbers on graphs. Discret. Math. 341(9): 2418-2430 (2018) - [i10]Boris Brimkov, Valentin E. Brimkov:
Optimal conditions for connectedness of discretized sets. CoRR abs/1808.03053 (2018) - 2017
- [j7]Boris Brimkov, Illya V. Hicks
Memory efficient algorithms for cactus graphs and block graphs. Discret. Appl. Math. 216: 393-407 (2017) - [j6]Boris Brimkov, Illya V. Hicks
Complexity and computation of connected zero forcing. Discret. Appl. Math. 229: 31-45 (2017) - [j5]Aida Abiad, Boris Brimkov, Aysel Erey, Lorinda Leshock
On the Wiener index, distance cospectrality and transmission-regular graphs. Discret. Appl. Math. 230: 1-10 (2017) - [j4]Boris Brimkov, Jennifer Edmond, Robert Lazar, Bernard Lidický
Injective choosability of subcubic planar graphs with girth 6. Discret. Math. 340(10): 2538-2549 (2017) - [c6]Boris Brimkov:
On Sets of Line Segments Featuring a Cactus Structure. IWCIA 2017: 30-39 - [i9]Boris Brimkov, Caleb C. Fast, Illya V. Hicks:
Graphs with Extremal Connected Forcing Numbers. CoRR abs/1701.08500 (2017) - [i8]Boris Brimkov, Caleb C. Fast, Illya V. Hicks:
Computational Approaches for Zero Forcing and Related Problems. CoRR abs/1704.02065 (2017) - 2016
- [j3]Boris Brimkov, Illya V. Hicks
Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs. Discret. Appl. Math. 204: 13-21 (2016) - [i7]Boris Brimkov, Randy Davila:
Characterizations of the Connected Forcing Number of a Graph. CoRR abs/1604.00740 (2016) - [i6]Boris Brimkov:
Complexity and Computation of Connected Zero Forcing. CoRR abs/1607.00658 (2016) - [i5]David Amos, John Asplund, Boris Brimkov, Randy Davila:
The sub-$k$-domination number of a graph with applications to $k$-domination. CoRR abs/1611.02379 (2016) - [i4]Boris Brimkov, Illya V. Hicks:
On the logspace shortest path problem. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [i3]Boris Brimkov, Illya V. Hicks:
Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs. CoRR abs/1501.04388 (2015) - [i2]Boris Brimkov:
A note on the clique number of complete k-partite graphs. CoRR abs/1507.01613 (2015) - [i1]Boris Brimkov:
A reduction of the logspace shortest path problem to biconnected graphs. CoRR abs/1511.07100 (2015) - 2014
- [j2]Boris Brimkov:
Geometric approach to string analysis for biosequence classification. J. Integr. Bioinform. 11(3) (2014) - [c5]Boris Brimkov, Valentin E. Brimkov:
Geometric Approach to Biosequence Analysis. PACBB 2014: 97-104 - 2013
- [c4]Boris Brimkov:
Memory Efficient Shortest Path Algorithms for Cactus Graphs. ISVC (1) 2013: 476-485 - 2012
- [c3]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: 205-208 - 2011
- [j1]Valentin E. Brimkov, Reneta P. Barneva, Boris Brimkov:
Connected distance-based rasterization of objects in arbitrary dimension. Graph. Model. 73(6): 323-334 (2011)
2000 – 2009
- 2009
- [c2]Valentin E. Brimkov, Reneta P. Barneva, Boris Brimkov:
Minimal Offsets That Guarantee Maximal or Minimal Connectivity of Digital Curves in nD. DGCI 2009: 337-349 - 2008
- [c1]Valentin E. Brimkov, Reneta P. Barneva, Boris Brimkov, François de Vieilleville:
Offset Approach to Defining 3D Digital Lines. ISVC (1) 2008: 678-687
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-02 01:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: