Valentin E. Brimkov

Publication Activity (10 Years)

Years Active: 1996-2024
Publications (10 Years): 13

Top Topics

Sequence Analysis

Maximal Cliques

Discrete Geometry

Graph Theoretic

Top Venues

Discret. Appl. Math.

Ann. Math. Artif. Intell.

Publications

Valentin E. Brimkov
Combinatorial and geometric problems in imaging sciences. Ann. Math. Artif. Intell. 92 (1) (2024)
Boris Brimkov, Valentin E. Brimkov
Graphs with degree sequence {(m-1)m,(n-1)n} and {mn,nm}. Discret. Appl. Math. 358 (2024)
Boris Brimkov, Valentin E. Brimkov
Optimal conditions for connectedness of discretized sets. J. Comb. Optim. 43 (5) (2022)
Boris Brimkov, Valentin E. Brimkov
On Connectedness of Discretized Sets. IWCIA (2020)
Valentin E. Brimkov, Reneta P. Barneva, Kamen Kanev
Dealing with Noise in Cluster Pattern Interface. IWCIA (2020)
Reneta P. Barneva, Valentin E. Brimkov
Teaching Data Analytics to Sport Management Majors: A Practical Approach. LTEC (2019)
Valentin E. Brimkov, Reneta P. Barneva
Digital Manifolds in Computer Modeling. Inf. Sci. 499 (2019)
Valentin E. Brimkov, Reneta P. Barneva
Discrete geometry and topology and their applications to imaging sciences. J. Comput. Syst. Sci. 95 (2018)
Boris Brimkov, Valentin E. Brimkov
Optimal conditions for connectedness of discretized sets. CoRR (2018)
Valentin E. Brimkov, Konstanty Junosza-Szaniawski, Sean Kafer, Jan Kratochvíl, Martin Pergel, Pawel Rzazewski, Matthew Szczepankiewicz, Joshua Terhaar
Homothetic polygons and beyond: Maximal cliques in intersection graphs. Discret. Appl. Math. 247 (2018)
Ranita Biswas, Partha Bhowmick, Valentin E. Brimkov
On the polyhedra of graceful spheres and circular geodesics. Discret. Appl. Math. 216 (2017)
Valentin E. Brimkov, Reneta P. Barneva
Graph-theoretic and polyhedral combinatorics issues and approaches in imaging sciences. Discret. Appl. Math. 216 (2017)
Valentin E. Brimkov
Editorial. Trans. Mass Data Anal. Images Signals 7 (1) (2016)
Ranita Biswas, Partha Bhowmick, Valentin E. Brimkov
On the Connectivity and Smoothness of Discrete Spherical Circles. IWCIA (2015)
Reneta P. Barneva, Valentin E. Brimkov
Combinatorial and discrete geometric problems in image analysis. Ann. Math. Artif. Intell. 75 (1-2) (2015)
Valentin E. Brimkov, Sean Kafer, Matthew Szczepankiewicz, Joshua Terhaar
On Intersection Graphs of Convex Polygons. IWCIA (2014)
Valentin E. Brimkov
Parallel Algorithms for Combinatorial Pattern Matching. IWCIA (2014)
Boris Brimkov, Valentin E. Brimkov
Geometric Approach to Biosequence Analysis. PACBB (2014)
Valentin E. Brimkov, Konstanty Junosza-Szaniawski, Sean Kafer, Jan Kratochvíl, Martin Pergel, Pawel Rzazewski, Matthew Szczepankiewicz, Joshua Terhaar
Homothetic Polygons and Beyond: Intersection Graphs, Recognition, and Maximum Clique. CoRR (2014)
Valentin E. Brimkov
Knapsack Intersection Graphs and Efficient Computation of Their Maximal Cliques. CompIMAGE (2014)
Valentin E. Brimkov, Reneta P. Barneva
Selected topics of combinatorial image analysis. Int. J. Comput. Math. 90 (8) (2013)
Valentin E. Brimkov
Approximability issues of guarding a set of segments. Int. J. Comput. Math. 90 (8) (2013)
Valentin E. Brimkov
On Connectedness of Discretized Objects. ISVC (1) (2013)
Valentin E. Brimkov, Andrew Leach, Jimmy Wu, Michael Mastroianni
Approximation algorithms for a geometric set cover problem. Discret. Appl. Math. 160 (7-8) (2012)
Valentin E. Brimkov, Reneta P. Barneva, Petra Wiederhold
Preface. Theor. Comput. Sci. 412 (15) (2011)
Valentin E. Brimkov, Andrew Leach, Jimmy Wu, Michael Mastroianni
On the Approximability of a Geometric Set Cover Problem. Electron. Colloquium Comput. Complex. 18 (2011)
Valentin E. Brimkov, Reneta P. Barneva, Boris Brimkov
Connected distance-based rasterization of objects in arbitrary dimension. Graph. Model. 73 (6) (2011)
Valentin E. Brimkov, Andrew Leach, Michael Mastroianni, Jimmy Wu
Guarding a set of line segments in the plane. Theor. Comput. Sci. 412 (15) (2011)
Valentin E. Brimkov, Reneta P. Barneva
Computational modeling of objects represented in images. Graph. Model. 73 (6) (2011)
Valentin E. Brimkov
Complexity and Approximability Issues in Combinatorial Image Analysis. IWCIA (2011)
Valentin E. Brimkov
Connectedness of Offset Digitizations in Higher Dimensions. CompIMAGE (2010)
Valentin E. Brimkov, Reneta P. Barneva
Digital Stars and Visibility of Digital Objects. CompIMAGE (2010)
Valentin E. Brimkov, Andrew Leach, Michael Mastroianni, Jimmy Wu
Experimental Study on Approximation Algorithms for Guarding Sets of Line Segments. ISVC (1) (2010)
Valentin E. Brimkov
Patrolling a Street Network is Strongly NP-Complete but in P for Tree Structures CoRR (2010)
Valentin E. Brimkov, Reneta P. Barneva
Advances in combinatorial image analysis. Pattern Recognit. 42 (8) (2009)
Valentin E. Brimkov
Formulas for the number of (n-2)-gaps of binary objects in arbitrary dimension. Discret. Appl. Math. 157 (3) (2009)
Kamen Kanev, Reneta P. Barneva, Valentin E. Brimkov, Dimitrina Kaneva
Print-based Interaction Interfaces for Multilingual Multimedia and Sign Language Electronic Resource Integration. ICSOFT (2) (2009)
Reneta P. Barneva, Valentin E. Brimkov, Kamen Kanev
Theoretical Issues of Cluster Pattern Interfaces. IWCIA (2009)
Valentin E. Brimkov, Reneta P. Barneva
Combinatorial approach to image analysis. Discret. Appl. Math. 157 (16) (2009)
Valentin E. Brimkov
On the Convex Hull of the Integer Points in a Bi-circular Region. IWCIA (2009)
Reneta P. Barneva, Valentin E. Brimkov
Guest editorial: Contemporary challenges in combinatorial image analysis. Int. J. Imaging Syst. Technol. 19 (2) (2009)
Reneta P. Barneva, Valentin E. Brimkov, Kamen Kanev
Combining ubiquitous direction-sensitive digitizing with a multimedia electronic dictionary for enhanced understanding. Int. J. Imaging Syst. Technol. 19 (2) (2009)
Tetsuo Asano, Valentin E. Brimkov, Reneta P. Barneva
Some theoretical challenges in digital geometry: A perspective. Discret. Appl. Math. 157 (16) (2009)
Valentin E. Brimkov, Reneta P. Barneva, Boris Brimkov
D. DGCI (2009)
Valentin E. Brimkov
Digitization scheme that assures faithful reconstruction of plane figures. Pattern Recognit. 42 (8) (2009)
Valentin E. Brimkov, Reneta P. Barneva
On the polyhedral complexity of the integer points in a hyperball. Theor. Comput. Sci. 406 (1-2) (2008)
Valentin E. Brimkov, Giorgio Nordo, Reneta P. Barneva, Angelo Maimone
Genus and Dimension of Digital Images and their Time- and Space-Efficient Computation. Int. J. Shape Model. 14 (2) (2008)
Valentin E. Brimkov, Reneta P. Barneva, Boris Brimkov, François de Vieilleville
Offset Approach to Defining 3D Digital Lines. ISVC (1) (2008)
Valentin E. Brimkov, Reinhard Klette
Border and SurfaceTracing - Theoretical Foundations. IEEE Trans. Pattern Anal. Mach. Intell. 30 (4) (2008)
Reneta P. Barneva, Valentin E. Brimkov, Kamen Kanev
Electronic Multimedia Dictionary with Direct-Access Printed Interface. IWCIA Special Track on Applications (2008)
Valentin E. Brimkov
Scaling of Plane Figures That Assures Faithful Digitization. IWCIA (2008)
Valentin E. Brimkov, Reneta P. Barneva
Linear Time Constant-Working Space Algorithm for Computing the Genus of a Digital Object. ISVC (1) (2008)
Valentin E. Brimkov, Stefan S. Dantchev
Digital hyperplane recognition in arbitrary fixed dimension within an algebraic computation model. Image Vis. Comput. 25 (10) (2007)
Valentin E. Brimkov
Algorithmic and explicit determination of the Lovász number for certain circulant graphs. Discret. Appl. Math. 155 (14) (2007)
Valentin E. Brimkov, David Coeurjolly, Reinhard Klette
Digital planarity - A review. Discret. Appl. Math. 155 (4) (2007)
Valentin E. Brimkov, Angelo Maimone, Giorgio Nordo
Counting Gaps in Binary Pictures. IWCIA (2006)
David Coeurjolly, Valentin E. Brimkov
Computational Aspects of Digital Plane and Hyperplane Recognition. IWCIA (2006)
Valentin E. Brimkov
Discrete volume polyhedrization : complexity and bounds on performance. CompIMAGE (2006)
Valentin E. Brimkov, Reneta P. Barneva
Polyhedrization of Discrete Convex Volumes. ISVC (1) (2006)
Valentin E. Brimkov, Angelo Maimone, Giorgio Nordo
On the Notion of Dimension in Digital Spaces. IWCIA (2006)
Valentin E. Brimkov, Davide Moroni, Reneta P. Barneva
Combinatorial Relations for Digital Pictures. DGCI (2006)
Valentin E. Brimkov
Digital geometry for image analysis and processing. CompIMAGE (2006)
Alberto Apostolico, Valentin E. Brimkov
Optimal discovery of repetitions in 2D. Discret. Appl. Math. 151 (1-3) (2005)
Valentin E. Brimkov, Reneta P. Barneva
Exact Image Reconstruction from a Single Projection through Real Computation. Electron. Notes Discret. Math. 20 (2005)
Valentin E. Brimkov, Reneta P. Barneva
Plane digitization and related combinatorial problems. Discret. Appl. Math. 147 (2-3) (2005)
Valentin E. Brimkov, Angelo Maimone, Giorgio Nordo
An explicit formula for the number of tunnels in digital objects CoRR (2005)
Valentin E. Brimkov, Angelo Maimone, Giorgio Nordo, Reneta P. Barneva, Reinhard Klette
The Number of Gaps in Binary Pictures. ISVC (2005)
Valentin E. Brimkov, Reneta P. Barneva
Analytical Honeycomb Geometry for Raster and Volume Graphics. Comput. J. 48 (2) (2005)
Valentin E. Brimkov, Stefan S. Dantchev
Complexity Analysis for Digital Hyperplane Recognition in Arbitrary Fixed Dimension. DGCI (2005)
Valentin E. Brimkov, Reneta P. Barneva, Reinhard Klette, Joseph Straight
Efficient Computation of the Lovász Theta Function for a Class of Circulant Graphs. WG (2004)
Valentin E. Brimkov
Clique, Chromatic, and Lovász Numbers of Certain Circulant Graphs. CTW (2004)
Valentin E. Brimkov, Reneta P. Barneva
Connectivity of discrete planes. Theor. Comput. Sci. 319 (1-3) (2004)
Valentin E. Brimkov, Reinhard Klette
Curves, Hypersurfaces, and Good Pairs of Adjacency Relations. IWCIA (2004)
Valentin E. Brimkov
Clique, chromatic, and Lovász numbers of certain circulant graphs. Electron. Notes Discret. Math. 17 (2004)
Valentin E. Brimkov, Bruno Codenotti, Valentino Crespi, Reneta P. Barneva, Mauro Leoncini
Computation of the Lovász Theta Function for Circulant Graphs Electron. Colloquium Comput. Complex. (081) (2003)
Valentin E. Brimkov
Optimal Parallel Searching an Array for Certain Repetitions. Electron. Notes Discret. Math. 12 (2003)
Valentin E. Brimkov, Reneta P. Barneva
Digital Flatness. DGCI (2003)
Valentin E. Brimkov, Reneta P. Barneva
Graceful planes and lines. Theor. Comput. Sci. 283 (1) (2002)
Valentin E. Brimkov, Stefan S. Dantchev
An alternative to Ben-Or's lower bound for the knapsack problem complexity. Appl. Math. Lett. 15 (2) (2002)
Valentin E. Brimkov, Eric Andres, Reneta P. Barneva
Object discretizations in higher dimensions. Pattern Recognit. Lett. 23 (6) (2002)
Valentin E. Brimkov
Optimally Fast CRCW-PRAM Testing 2D-Arrays for Existence of Repetitive Patterns. Int. J. Pattern Recognit. Artif. Intell. 15 (7) (2001)
Valentin E. Brimkov, Reneta P. Barneva
Honeycomb vs square and cubic models. Electron. Notes Theor. Comput. Sci. 46 (2001)
Alberto Apostolico, Valentin E. Brimkov
Fibonacci arrays and their two-dimensional repetitions. Theor. Comput. Sci. 237 (1-2) (2000)
Valentin E. Brimkov, Eric Andres, Reneta P. Barneva
Object Discretization in Higher Dimensions. DGCI (2000)
Valentin E. Brimkov, Stefan S. Dantchev
On the Algebraic Complexity of Integer Programming Electron. Colloquium Comput. Complex. 7 (17) (2000)
Valentin E. Brimkov, Stefan S. Dantchev
On the Complexity of Integer Programming in the Blum-Shub-Smale Computational Model. IFIP TCS (2000)
Reneta P. Barneva, Valentin E. Brimkov, Philippe Nehlig
Thin discrete triangular meshes. Theor. Comput. Sci. 246 (1-2) (2000)
Valentin E. Brimkov, Bruno Codenotti, Valentino Crespi, Mauro Leoncini
On the Lovász Number of Certain Circulant Graphs. CIAC (2000)
Valentin E. Brimkov, Reneta P. Barneva
Graceful Planes and Thin Tunnel-Free Meshes. DGCI (1999)
Valentin E. Brimkov, Stefan S. Dantchev
Lower Bounds, "Pseudopolynomial" and Approximation Algorithms for the Knapsack Problem with Real Coefficients Electron. Colloquium Comput. Complex. 5 (15) (1998)
Valentin E. Brimkov, Stefan S. Dantchev
Real Data--Integer Solution Problems within the Blum-Shub-Smale Computational Model. J. Complex. 13 (2) (1997)
Valentin E. Brimkov, Bruno Codenotti, Mauro Leoncini, Giovanni Resta
Strong NP-Completeness of a Matrix Similarity Problem. Theor. Comput. Sci. 165 (2) (1996)