19 citations · 20 across the 5 of their papers we have counts for
6 papers
Graphs with degree sequence and
Boris Brimkov, Valentin Brimkov
In this paper we study the class of graphs that have the same degree sequence as two disjoint cliques and , as well as the class of the com…
Optimal conditions for connectedness of discretized sets
Boris Brimkov, Valentin E. Brimkov
Constructing a discretization of a given set is a major problem in various theoretical and applied disciplines. An offset discretization of a set is obtained by taking the inte…
Homothetic Polygons and Beyond: Intersection Graphs, Recognition, and Maximum Clique
Valentin E. Brimkov, Konstanty Junosza-Szaniawski, Sean Kafer +5
We study the {\sc Clique} problem in classes of intersection graphs of convex sets in the plane. The problem is known to be NP-complete in convex-set intersection graphs and straig…
Geometric approach to string analysis: deviation from linearity and its use for biosequence classification
Boris Brimkov, Valentin E. Brimkov
Tools that effectively analyze and compare sequences are of great importance in various areas of applied computational research, especially in the framework of molecular biology. I…
Patrolling a Street Network is Strongly NP-Complete but in P for Tree Structures
Valentin E. Brimkov
We consider the following problem: Given a finite set of straight line segments in the plane, determine the positions of a minimal number of points on the segments, from which guar…
An explicit formula for the number of tunnels in digital objects
Valentin Brimkov, Angelo Maimone, Giorgio Nordo
An important concept in digital geometry for computer imagery is that of tunnel. In this paper we obtain a formula for the number of tunnels as a function of the number of the obje…