Boris Brimkov

According to our database1, Boris Brimkov authored at least 30 papers between 2008 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 




The Slater and sub-<i>k</i>-domination number of a graph with applications to domination and <i>k</i>-domination.
Discuss. Math. Graph Theory, 2020

On Connectedness of Discretized Sets.
Proceedings of the Combinatorial Image Analysis - 20th International Workshop, 2020

Power domination throttling.
Theor. Comput. Sci., 2019

Connected power domination in graphs.
J. Comb. Optim., 2019

Restricted power domination and zero forcing problems.
J. Comb. Optim., 2019

Computational approaches for zero forcing and related problems.
Eur. J. Oper. Res., 2019

The zero forcing polynomial of a graph.
Discret. Appl. Math., 2019

Cop throttling number: Bounds, values, and variants.
CoRR, 2019

Throttling for the game of Cops and Robbers on graphs.
Discret. Math., 2018

Optimal conditions for connectedness of discretized sets.
CoRR, 2018

Injective choosability of subcubic planar graphs with girth 6.
Discret. Math., 2017

Complexity and computation of connected zero forcing.
Discret. Appl. Math., 2017

Memory efficient algorithms for cactus graphs and block graphs.
Discret. Appl. Math., 2017

On the Wiener index, distance cospectrality and transmission-regular graphs.
Discret. Appl. Math., 2017

Graphs with Extremal Connected Forcing Numbers.
CoRR, 2017

On Sets of Line Segments Featuring a Cactus Structure.
Proceedings of the Combinatorial Image Analysis - 18th International Workshop, 2017

On the logspace shortest path problem.
Electron. Colloquium Comput. Complex., 2016

Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs.
Discret. Appl. Math., 2016

Characterizations of the Connected Forcing Number of a Graph.
CoRR, 2016

Complexity and Computation of Connected Zero Forcing.
CoRR, 2016

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

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

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

Geometric approach to string analysis for biosequence classification.
J. Integr. Bioinform., 2014

Geometric Approach to Biosequence Analysis.
Proceedings of the 8th International Conference on Practical Applications of Computational Biology & Bioinformatics, 2014

Memory Efficient Shortest Path Algorithms for Cactus Graphs.
Proceedings of the Advances in Visual Computing - 9th International Symposium, 2013

A spectral and radial basis function hybrid method for visualizing vascular flows.
Proceedings of the Computational Modelling of Objects Represented in Images, 2012

Connected distance-based rasterization of objects in arbitrary dimension.
Graph. Model., 2011

Minimal Offsets That Guarantee Maximal or Minimal Connectivity of Digital Curves in <i>n</i>D.
Proceedings of the Discrete Geometry for Computer Imagery, 2009

Offset Approach to Defining 3D Digital Lines.
Proceedings of the Advances in Visual Computing, 4th International Symposium, 2008