![]() | ![]() |
| 2012 | ||
|---|---|---|
| 67 | Valentin E. Brimkov, Andrew Leach, Jimmy Wu, Michael Mastroianni: Approximation algorithms for a geometric set cover problem. Discrete Applied Mathematics 160(7-8): 1039-1052 (2012) | |
| 2011 | ||
| 66 | Jake K. Aggarwal, Reneta P. Barneva, Valentin E. Brimkov, Kostadin Koroutchev, Elka Korutcheva: Combinatorial Image Analysis - 14th International Workshop, IWCIA 2011, Madrid, Spain, May 23-25, 2011. Proceedings Springer 2011 | |
| 65 | Valentin E. Brimkov: Complexity and Approximability Issues in Combinatorial Image Analysis. IWCIA 2011: 5-8 | |
| 64 | Valentin E. Brimkov, Andrew Leach, Jimmy Wu, Michael Mastroianni: On the Approximability of a Geometric Set Cover Problem. Electronic Colloquium on Computational Complexity (ECCC) 18: 19 (2011) | |
| 63 | Valentin E. Brimkov, Reneta P. Barneva: Computational modeling of objects represented in images. Graphical Models 73(6): 311-312 (2011) | |
| 62 | Valentin E. Brimkov, Reneta P. Barneva, Boris Brimkov: Connected distance-based rasterization of objects in arbitrary dimension. Graphical Models 73(6): 323-334 (2011) | |
| 61 | Valentin E. Brimkov, Reneta P. Barneva, Petra Wiederhold: Preface. Theor. Comput. Sci. 412(15): 1299-1300 (2011) | |
| 60 | Valentin E. Brimkov, Andrew Leach, Michael Mastroianni, Jimmy Wu: Guarding a set of line segments in the plane. Theor. Comput. Sci. 412(15): 1313-1324 (2011) | |
| 2010 | ||
| 59 | Reneta P. Barneva, Valentin E. Brimkov, Herbert A. Hauptman, Renato M. Natal Jorge, João Manuel R. S. Tavares: Computational Modeling of Objects Represented in Images, Second International Symposium, CompIMAGE 2010, Buffalo, NY, USA, May 5-7, 2010. Proceedings Springer 2010 | |
| 58 | Valentin E. Brimkov, Reneta P. Barneva: Digital Stars and Visibility of Digital Objects. CompIMAGE 2010: 11-23 | |
| 57 | Valentin E. Brimkov: Connectedness of Offset Digitizations in Higher Dimensions. CompIMAGE 2010: 36-46 | |
| 56 | Valentin E. Brimkov, Andrew Leach, Michael Mastroianni, Jimmy Wu: Experimental Study on Approximation Algorithms for Guarding Sets of Line Segments. ISVC (1) 2010: 592-601 | |
| 55 | Valentin E. Brimkov: Patrolling a Street Network is Strongly NP-Complete but in P for Tree Structures CoRR abs/1004.0744: (2010) | |
| 2009 | ||
| 54 | 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 | |
| 53 | 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: 223-228 | |
| 52 | Valentin E. Brimkov: On the Convex Hull of the Integer Points in a Bi-circular Region. IWCIA 2009: 16-29 | |
| 51 | Reneta P. Barneva, Valentin E. Brimkov, Kamen Kanev: Theoretical Issues of Cluster Pattern Interfaces. IWCIA 2009: 302-315 | |
| 50 | Valentin E. Brimkov, Reneta P. Barneva: Combinatorial approach to image analysis. Discrete Applied Mathematics 157(16): 3359-3361 (2009) | |
| 49 | Tetsuo Asano, Valentin E. Brimkov, Reneta P. Barneva: Some theoretical challenges in digital geometry: A perspective. Discrete Applied Mathematics 157(16): 3362-3371 (2009) | |
| 48 | 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) | |
| 47 | Valentin E. Brimkov, Reneta P. Barneva: Advances in combinatorial image analysis. Pattern Recognition 42(8): 1623-1625 (2009) | |
| 46 | Valentin E. Brimkov: Digitization scheme that assures faithful reconstruction of plane figures. Pattern Recognition 42(8): 1637-1649 (2009) | |
| 2008 | ||
| 45 | 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 | |
| 44 | 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 | |
| 43 | Valentin E. Brimkov, Reneta P. Barneva, Boris Brimkov, François de Vieilleville: Offset Approach to Defining 3D Digital Lines. ISVC (1) 2008: 678-687 | |
| 42 | Valentin E. Brimkov: Scaling of Plane Figures That Assures Faithful Digitization. IWCIA 2008: 87-98 | |
| 41 | Valentin E. Brimkov, Reinhard Klette: Border and SurfaceTracing - Theoretical Foundations. IEEE Trans. Pattern Anal. Mach. Intell. 30(4): 577-590 (2008) | |
| 40 | Valentin E. Brimkov, Giorgio Nordo, Reneta P. Barneva, Angelo Maimone: Genus and Dimension of Digital Images and their Time- and Space-Efficient Computation. International Journal of Shape Modeling 14(2): 147-168 (2008) | |
| 39 | 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 | ||
| 38 | Valentin E. Brimkov: Algorithmic and explicit determination of the Lovász number for certain circulant graphs. Discrete Applied Mathematics 155(14): 1812-1825 (2007) | |
| 37 | Valentin E. Brimkov, David Coeurjolly, Reinhard Klette: Digital planarity - A review. Discrete Applied Mathematics 155(4): 468-495 (2007) | |
| 36 | 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 | ||
| 35 | Valentin E. Brimkov, Davide Moroni, Reneta P. Barneva: Combinatorial Relations for Digital Pictures. DGCI 2006: 189-198 | |
| 34 | Valentin E. Brimkov, Reneta P. Barneva: Polyhedrization of Discrete Convex Volumes. ISVC (1) 2006: 548-557 | |
| 33 | Valentin E. Brimkov, Angelo Maimone, Giorgio Nordo: Counting Gaps in Binary Pictures. IWCIA 2006: 16-24 | |
| 32 | Valentin E. Brimkov, Angelo Maimone, Giorgio Nordo: On the Notion of Dimension in Digital Spaces. IWCIA 2006: 241-252 | |
| 31 | David Coeurjolly, Valentin E. Brimkov: Computational Aspects of Digital Plane and Hyperplane Recognition. IWCIA 2006: 291-306 | |
| 2005 | ||
| 30 | Valentin E. Brimkov, Stefan S. Dantchev: Complexity Analysis for Digital Hyperplane Recognition in Arbitrary Fixed Dimension. DGCI 2005: 287-298 | |
| 29 | Valentin E. Brimkov, Angelo Maimone, Giorgio Nordo, Reneta P. Barneva, Reinhard Klette: The Number of Gaps in Binary Pictures. ISVC 2005: 35-42 | |
| 28 | Valentin E. Brimkov, Angelo Maimone, Giorgio Nordo: An explicit formula for the number of tunnels in digital objects CoRR abs/cs/0505084: (2005) | |
| 27 | Valentin E. Brimkov, Reneta P. Barneva: Analytical Honeycomb Geometry for Raster and Volume Graphics. Comput. J. 48(2): 180-199 (2005) | |
| 26 | Valentin E. Brimkov, Reneta P. Barneva: Plane digitization and related combinatorial problems. Discrete Applied Mathematics 147(2-3): 169-186 (2005) | |
| 25 | Alberto Apostolico, Valentin E. Brimkov: Optimal discovery of repetitions in 2D. Discrete Applied Mathematics 151(1-3): 5-20 (2005) | |
| 24 | 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 | ||
| 23 | Valentin E. Brimkov: Clique, Chromatic, and Lovász Numbers of Certain Circulant Graphs. CTW 2004: 61-65 | |
| 22 | Valentin E. Brimkov, Reinhard Klette: Curves, Hypersurfaces, and Good Pairs of Adjacency Relations. IWCIA 2004: 276-290 | |
| 21 | 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 | Valentin E. Brimkov: Clique, chromatic, and Lovász numbers of certain circulant graphs. Electronic Notes in Discrete Mathematics 17: 63-67 (2004) | |
| 19 | Valentin E. Brimkov, Reneta P. Barneva: Connectivity of discrete planes. Theor. Comput. Sci. 319(1-3): 203-227 (2004) | |
| 2003 | ||
| 18 | Valentin E. Brimkov, Reneta P. Barneva: Digital Flatness. DGCI 2003: 72-81 | |
| 17 | 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 | Valentin E. Brimkov: Optimal Parallel Searching an Array for Certain Repetitions. Electronic Notes in Discrete Mathematics 12: 82-93 (2003) | |
| 2002 | ||
| 15 | 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 | Valentin E. Brimkov, Eric Andres, Reneta P. Barneva: Object discretizations in higher dimensions. Pattern Recognition Letters 23(6): 623-636 (2002) | |
| 13 | Valentin E. Brimkov, Reneta P. Barneva: Graceful planes and lines. Theor. Comput. Sci. 283(1): 151-170 (2002) | |
| 2001 | ||
| 12 | Valentin E. Brimkov, Reneta P. Barneva: Honeycomb vs square and cubic models. Electr. Notes Theor. Comput. Sci. 46: 321-338 (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 | Valentin E. Brimkov, Bruno Codenotti, Valentino Crespi, Mauro Leoncini: On the Lovász Number of Certain Circulant Graphs. CIAC 2000: 291-305 | |
| 9 | Valentin E. Brimkov, Eric Andres, Reneta P. Barneva: Object Discretization in Higher Dimensions. DGCI 2000: 210-221 | |
| 8 | 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 | Valentin E. Brimkov, Stefan S. Dantchev: On the Algebraic Complexity of Integer Programming Electronic Colloquium on Computational Complexity (ECCC) 7(17): (2000) | |
| 6 | Alberto Apostolico, Valentin E. Brimkov: Fibonacci arrays and their two-dimensional repetitions. Theor. Comput. Sci. 237(1-2): 263-273 (2000) | |
| 5 | Reneta P. Barneva, Valentin E. Brimkov, Philippe Nehlig: Thin discrete triangular meshes. Theor. Comput. Sci. 246(1-2): 73-105 (2000) | |
| 1999 | ||
| 4 | Valentin E. Brimkov, Reneta P. Barneva: Graceful Planes and Thin Tunnel-Free Meshes. DGCI 1999: 53-64 | |
| 1998 | ||
| 3 | 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 | 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 | 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) | |
Colors in the list of coauthors
Last update Sun May 27 04:04:01 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page