Valentin E. Brimkov

2009
44	EE	Valentin E. Brimkov: Formulas for the number of (n-2)-gaps of binary objects in arbitrary dimension. Discrete Applied Mathematics 157(3): 452-463 (2009)
2008
43		Valentin E. Brimkov, Reneta P. Barneva, Herbert A. Hauptman: Combinatorial Image Analysis, 12th International Workshop, IWCIA 2008, Buffalo, NY, USA, April 7-9, 2008. Proceedings Springer 2008
42	EE	Valentin E. Brimkov, Reneta P. Barneva: Linear Time Constant-Working Space Algorithm for Computing the Genus of a Digital Object. ISVC (1) 2008: 669-677
41	EE	Valentin E. Brimkov, Reneta P. Barneva, Boris Brimkov, François de Vieilleville: Offset Approach to Defining 3D Digital Lines. ISVC (1) 2008: 678-687
40	EE	Valentin E. Brimkov: Scaling of Plane Figures That Assures Faithful Digitization. IWCIA 2008: 87-98
39	EE	Valentin E. Brimkov, Reinhard Klette: Border and SurfaceTracing - Theoretical Foundations. IEEE Trans. Pattern Anal. Mach. Intell. 30(4): 577-590 (2008)
38	EE	Valentin E. Brimkov, Reneta P. Barneva: On the polyhedral complexity of the integer points in a hyperball. Theor. Comput. Sci. 406(1-2): 24-30 (2008)
2007
37	EE	Valentin E. Brimkov: Algorithmic and explicit determination of the Lovász number for certain circulant graphs. Discrete Applied Mathematics 155(14): 1812-1825 (2007)
36	EE	Valentin E. Brimkov, David Coeurjolly, Reinhard Klette: Digital planarity - A review. Discrete Applied Mathematics 155(4): 468-495 (2007)
35	EE	Valentin E. Brimkov, Stefan S. Dantchev: Digital hyperplane recognition in arbitrary fixed dimension within an algebraic computation model. Image Vision Comput. 25(10): 1631-1643 (2007)
2006
34	EE	Valentin E. Brimkov, Davide Moroni, Reneta P. Barneva: Combinatorial Relations for Digital Pictures. DGCI 2006: 189-198
33	EE	Valentin E. Brimkov, Reneta P. Barneva: Polyhedrization of Discrete Convex Volumes. ISVC (1) 2006: 548-557
32	EE	Valentin E. Brimkov, Angelo Maimone, Giorgio Nordo: Counting Gaps in Binary Pictures. IWCIA 2006: 16-24
31	EE	Valentin E. Brimkov, Angelo Maimone, Giorgio Nordo: On the Notion of Dimension in Digital Spaces. IWCIA 2006: 241-252
30	EE	David Coeurjolly, Valentin E. Brimkov: Computational Aspects of Digital Plane and Hyperplane Recognition. IWCIA 2006: 291-306
2005
29	EE	Valentin E. Brimkov, Stefan S. Dantchev: Complexity Analysis for Digital Hyperplane Recognition in Arbitrary Fixed Dimension. DGCI 2005: 287-298
28	EE	Valentin E. Brimkov, Angelo Maimone, Giorgio Nordo, Reneta P. Barneva, Reinhard Klette: The Number of Gaps in Binary Pictures. ISVC 2005: 35-42
27	EE	Valentin E. Brimkov, Angelo Maimone, Giorgio Nordo: An explicit formula for the number of tunnels in digital objects CoRR abs/cs/0505084: (2005)
26	EE	Valentin E. Brimkov, Reneta P. Barneva: Analytical Honeycomb Geometry for Raster and Volume Graphics. Comput. J. 48(2): 180-199 (2005)
25	EE	Valentin E. Brimkov, Reneta P. Barneva: Plane digitization and related combinatorial problems. Discrete Applied Mathematics 147(2-3): 169-186 (2005)
24	EE	Alberto Apostolico, Valentin E. Brimkov: Optimal discovery of repetitions in 2D. Discrete Applied Mathematics 151(1-3): 5-20 (2005)
23	EE	Valentin E. Brimkov, Reneta P. Barneva: Exact Image Reconstruction from a Single Projection through Real Computation. Electronic Notes in Discrete Mathematics 20: 233-246 (2005)
2004
22	EE	Valentin E. Brimkov, Reinhard Klette: Curves, Hypersurfaces, and Good Pairs of Adjacency Relations. IWCIA 2004: 276-290
21	EE	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: 285-295
20	EE	Valentin E. Brimkov: Clique, chromatic, and Lovász numbers of certain circulant graphs. Electronic Notes in Discrete Mathematics 17: 63-67 (2004)
19	EE	Valentin E. Brimkov, Reneta P. Barneva: Connectivity of discrete planes. Theor. Comput. Sci. 319(1-3): 203-227 (2004)
2003
18	EE	Valentin E. Brimkov, Reneta P. Barneva: Digital Flatness. DGCI 2003: 72-81
17	EE	Valentin E. Brimkov, Bruno Codenotti, Valentino Crespi, Reneta P. Barneva, Mauro Leoncini: Computation of the Lovász Theta Function for Circulant Graphs Electronic Colloquium on Computational Complexity (ECCC)(081): (2003)
16	EE	Valentin E. Brimkov: Optimal Parallel Searching an Array for Certain Repetitions. Electronic Notes in Discrete Mathematics 12: 82-93 (2003)
2002
15	EE	Valentin E. Brimkov, Stefan S. Dantchev: An alternative to Ben-Or's lower bound for the knapsack problem complexity. Appl. Math. Lett. 15(2): 187-191 (2002)
14	EE	Valentin E. Brimkov, Eric Andres, Reneta P. Barneva: Object discretizations in higher dimensions. Pattern Recognition Letters 23(6): 623-636 (2002)
13	EE	Valentin E. Brimkov, Reneta P. Barneva: Graceful planes and lines. Theor. Comput. Sci. 283(1): 151-170 (2002)
2001
12	EE	Valentin E. Brimkov, Reneta P. Barneva: Honeycomb vs square and cubic models. Electr. Notes Theor. Comput. Sci. 46: (2001)
11		Valentin E. Brimkov: Optimally Fast CRCW-PRAM Testing 2D-Arrays for Existence of Repetitive Patterns. IJPRAI 15(7): 1167-1182 (2001)
2000
10	EE	Valentin E. Brimkov, Bruno Codenotti, Valentino Crespi, Mauro Leoncini: On the Lovász Number of Certain Circulant Graphs. CIAC 2000: 291-305
9	EE	Valentin E. Brimkov, Eric Andres, Reneta P. Barneva: Object Discretization in Higher Dimensions. DGCI 2000: 210-221
8	EE	Valentin E. Brimkov, Stefan S. Dantchev: On the Complexity of Integer Programming in the Blum-Shub-Smale Computational Model. IFIP TCS 2000: 286-300
7	EE	Valentin E. Brimkov, Stefan S. Dantchev: On the Algebraic Complexity of Integer Programming Electronic Colloquium on Computational Complexity (ECCC) 7(17): (2000)
6	EE	Alberto Apostolico, Valentin E. Brimkov: Fibonacci arrays and their two-dimensional repetitions. Theor. Comput. Sci. 237(1-2): 263-273 (2000)
5	EE	Reneta P. Barneva, Valentin E. Brimkov, Philippe Nehlig: Thin discrete triangular meshes. Theor. Comput. Sci. 246(1-2): 73-105 (2000)
1999
4	EE	Valentin E. Brimkov, Reneta P. Barneva: Graceful Planes and Thin Tunnel-Free Meshes. DGCI 1999: 53-64
1998
3	EE	Valentin E. Brimkov, Stefan S. Dantchev: Lower Bounds, "Pseudopolynomial" and Approximation Algorithms for the Knapsack Problem with Real Coefficients Electronic Colloquium on Computational Complexity (ECCC) 5(15): (1998)
1997
2	EE	Valentin E. Brimkov, Stefan S. Dantchev: Real Data--Integer Solution Problems within the Blum-Shub-Smale Computational Model. J. Complexity 13(2): 279-300 (1997)
1996
1	EE	Valentin E. Brimkov, Bruno Codenotti, Mauro Leoncini, Giovanni Resta: Strong NP-Completeness of a Matrix Similarity Problem. Theor. Comput. Sci. 165(2): 483-490 (1996)

Coauthor Index

1	Eric Andres	[9] [14]
2	Alberto Apostolico	[6] [24]
3	Reneta P. Barneva	[4] [5] [9] [12] [13] [14] [17] [18] [19] [21] [23] [25] [26] [28] [33] [34] [38] [41] [42] [43]
4	Boris Brimkov	[41]
5	Bruno Codenotti	[1] [10] [17]
6	David Coeurjolly	[30] [36]
7	Valentino Crespi	[10] [17]
8	Stefan S. Dantchev	[2] [3] [7] [8] [15] [29] [35]
9	Herbert A. Hauptman	[43]
10	Reinhard Klette	[21] [22] [28] [36] [39]
11	Mauro Leoncini	[1] [10] [17]
12	Angelo Maimone	[27] [28] [31] [32]
13	Davide Moroni	[34]
14	Philippe Nehlig	[5]
15	Giorgio Nordo	[27] [28] [31] [32]
16	Giovanni Resta	[1]
17	Joseph Straight	[21]
18	François de Vieilleville	[41]

Colors in the list of coauthors