Valentin E. Brimkov - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Combinatorial Image Analysis - 14th International Workshop, IWCIA 2011, Madrid, Spain, May 23-25, 2011. ProceedingsJake K. Aggarwal, Reneta P. Barneva, Valentin E. Brimkov, Kostadin Koroutchev, Elka Korutcheva, editors, Volume 6636 of Lecture Notes in Computer Science, Springer, 2011. [doi]

On the Approximability of a Geometric Set Cover ProblemValentin E. Brimkov, Andrew Leach, Jimmy Wu, Michael Mastroianni. eccc, 18:19, 2011. [doi]

PrefaceValentin E. Brimkov, Reneta P. Barneva, Petra Wiederhold. TCS, 412(15):1299-1300, 2011. [doi]

Guarding a set of line segments in the planeValentin E. Brimkov, Andrew Leach, Michael Mastroianni, Jimmy Wu. TCS, 412(15):1313-1324, 2011. [doi]

Complexity and Approximability Issues in Combinatorial Image AnalysisValentin E. Brimkov. iwcia 2011: 5-8 [doi]

2010

2009

Some theoretical challenges in digital geometry: A perspectiveTetsuo Asano, Valentin E. Brimkov, Reneta P. Barneva. DAM, 157(16):3362-3371, 2009. [doi]

Theoretical Issues of Cluster Pattern InterfacesReneta P. Barneva, Valentin E. Brimkov, Kamen Kanev. iwcia 2009: 302-315 [doi]

Minimal Offsets That Guarantee Maximal or Minimal Connectivity of Digital Curves in ::::n::::DValentin E. Brimkov, Reneta P. Barneva, Boris Brimkov. dgci 2009: 337-349 [doi]

On the Convex Hull of the Integer Points in a Bi-circular RegionValentin E. Brimkov. iwcia 2009: 16-29 [doi]

Digitization scheme that assures faithful reconstruction of plane figuresValentin E. Brimkov. PR, 42(8):1637-1649, 2009. [doi]

Formulas for the number of (n-2)-gaps of binary objects in arbitrary dimensionValentin E. Brimkov. DAM, 157(3):452-463, 2009. [doi]

Advances in combinatorial image analysisValentin E. Brimkov, Reneta P. Barneva. PR, 42(8):1623-1625, 2009. [doi]

Combinatorial approach to image analysisValentin E. Brimkov, Reneta P. Barneva. DAM, 157(16):3359-3361, 2009. [doi]

Print-based Interaction Interfaces for Multilingual Multimedia and Sign Language Electronic Resource IntegrationKamen Kanev, Reneta P. Barneva, Valentin E. Brimkov, Dimitrina Kaneva. ICSOFT 2009: 223-228

2008

Offset Approach to Defining 3D Digital LinesValentin E. Brimkov, Reneta P. Barneva, Boris Brimkov, François de Vieilleville. isvc 2008: 678-687 [doi]

Linear Time Constant-Working Space Algorithm for Computing the Genus of a Digital ObjectValentin E. Brimkov, Reneta P. Barneva. isvc 2008: 669-677 [doi]

Scaling of Plane Figures That Assures Faithful DigitizationValentin E. Brimkov. iwcia 2008: 87-98 [doi]

Genus and Dimension of Digital Images and their Time- and Space-Efficient ComputationValentin E. Brimkov, Giorgio Nordo, Reneta P. Barneva, Angelo Maimone. ijsm, 14(2):147-168, 2008. [doi]

Border and SurfaceTracing - Theoretical FoundationsValentin E. Brimkov, Reinhard Klette. pami, 30(4):577-590, 2008. [doi]

On the polyhedral complexity of the integer points in a hyperballValentin E. Brimkov, Reneta P. Barneva. TCS, 406(1-2):24-30, 2008. [doi]

Combinatorial Image Analysis, 12th International Workshop, IWCIA 2008, Buffalo, NY, USA, April 7-9, 2008. ProceedingsValentin E. Brimkov, Reneta P. Barneva, Herbert A. Hauptman, editors, Volume 4958 of Lecture Notes in Computer Science, Springer, 2008.

2007

Digital planarity - A reviewValentin E. Brimkov, David Coeurjolly, Reinhard Klette. DAM, 155(4):468-495, 2007. [doi]

Digital hyperplane recognition in arbitrary fixed dimension within an algebraic computation modelValentin E. Brimkov, Stefan S. Dantchev. ivc, 25(10):1631-1643, 2007. [doi]

Algorithmic and explicit determination of the Lovász number for certain circulant graphsValentin E. Brimkov. DAM, 155(14):1812-1825, 2007. [doi]

2006

2005

2004

2003

Digital FlatnessValentin E. Brimkov, Reneta P. Barneva. dgci 2003: 72-81 [doi]

Optimal Parallel Searching an Array for Certain RepetitionsValentin E. Brimkov. endm, 12:82-93, 2003. [doi]

Computation of the Lovász Theta Function for Circulant GraphsValentin E. Brimkov, Bruno Codenotti, Valentino Crespi, Reneta P. Barneva, Mauro Leoncini. eccc, (081), 2003. [doi]

2002

Graceful planes and linesValentin E. Brimkov, Reneta P. Barneva. TCS, 283(1):151-170, 2002. [doi]

Object discretizations in higher dimensionsValentin E. Brimkov, Eric Andres, Reneta P. Barneva. prl, 23(6):623-636, 2002. [doi]

An alternative to Ben-Or s lower bound for the knapsack problem complexityValentin E. Brimkov, Stefan S. Dantchev. appml, 15(2):187-191, 2002. [doi]

2001

Honeycomb vs square and cubic modelsValentin E. Brimkov, Reneta P. Barneva. ENTCS, 46, 2001. [doi]

Optimally Fast CRCW-PRAM Testing 2D-Arrays for Existence of Repetitive PatternsValentin E. Brimkov. ijprai, 15(7):1167-1182, 2001.

2000

1999

Graceful Planes and Thin Tunnel-Free MeshesValentin E. Brimkov, Reneta P. Barneva. dgci 1999: 53-64 [doi]

1998

Lower Bounds, Pseudopolynomial and Approximation Algorithms for the Knapsack Problem with Real CoefficientsValentin E. Brimkov. eccc, 5(15), 1998. [doi]

1997

Real Data--Integer Solution Problems within the Blum-Shub-Smale Computational ModelValentin E. Brimkov, Stefan S. Dantchev. jc, 13(2):279-300, 1997. [doi]

1996

Strong NP-Completeness of a Matrix Similarity ProblemValentin E. Brimkov, Bruno Codenotti, Mauro Leoncini, Giovanni Resta. TCS, 165(2):483-490, 1996. [doi]