Valentin E. Brimkov

According to our database1, Valentin E. Brimkov authored at least 89 papers between 1996 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2020
Dealing with Noise in Cluster Pattern Interface.
Proceedings of the Combinatorial Image Analysis - 20th International Workshop, 2020

On Connectedness of Discretized Sets.
Proceedings of the Combinatorial Image Analysis - 20th International Workshop, 2020

2019
Digital Manifolds in Computer Modeling.
Inf. Sci., 2019

Teaching Data Analytics to Sport Management Majors: A Practical Approach.
Proceedings of the Learning Technology for Education Challenges, 2019

2018
Discrete geometry and topology and their applications to imaging sciences.
J. Comput. Syst. Sci., 2018

Homothetic polygons and beyond: Maximal cliques in intersection graphs.
Discret. Appl. Math., 2018

Optimal conditions for connectedness of discretized sets.
CoRR, 2018

2017
Graph-theoretic and polyhedral combinatorics issues and approaches in imaging sciences.
Discret. Appl. Math., 2017

On the polyhedra of graceful spheres and circular geodesics.
Discret. Appl. Math., 2017

2016
Editorial.
Trans. Mass Data Anal. Images Signals, 2016

2015
Combinatorial and discrete geometric problems in image analysis.
Ann. Math. Artif. Intell., 2015

On the Connectivity and Smoothness of Discrete Spherical Circles.
Proceedings of the Combinatorial Image Analysis - 17th International Workshop, 2015

2014
Homothetic Polygons and Beyond: Intersection Graphs, Recognition, and Maximum Clique.
CoRR, 2014

Geometric Approach to Biosequence Analysis.
Proceedings of the 8th International Conference on Practical Applications of Computational Biology & Bioinformatics, 2014

On Intersection Graphs of Convex Polygons.
Proceedings of the Combinatorial Image Analysis - 16th International Workshop, 2014

Parallel Algorithms for Combinatorial Pattern Matching.
Proceedings of the Combinatorial Image Analysis - 16th International Workshop, 2014

Knapsack Intersection Graphs and Efficient Computation of Their Maximal Cliques.
Proceedings of the Computational Modeling of Objects Presented in Images. Fundamentals, Methods, and Applications, 2014

2013
Selected topics of combinatorial image analysis.
Int. J. Comput. Math., 2013

Approximability issues of guarding a set of segments.
Int. J. Comput. Math., 2013

On Connectedness of Discretized Objects.
Proceedings of the Advances in Visual Computing - 9th International Symposium, 2013

2012
Approximation algorithms for a geometric set cover problem.
Discret. Appl. Math., 2012

2011
Guarding a set of line segments in the plane.
Theor. Comput. Sci., 2011

Preface.
Theor. Comput. Sci., 2011

On the Approximability of a Geometric Set Cover Problem.
Electron. Colloquium Comput. Complex., 2011

Connected distance-based rasterization of objects in arbitrary dimension.
Graph. Model., 2011

Computational modeling of objects represented in images.
Graph. Model., 2011

Complexity and Approximability Issues in Combinatorial Image Analysis.
Proceedings of the Combinatorial Image Analysis - 14th International Workshop, 2011

2010
Patrolling a Street Network is Strongly NP-Complete but in P for Tree Structures
CoRR, 2010

Experimental Study on Approximation Algorithms for Guarding Sets of Line Segments.
Proceedings of the Advances in Visual Computing - 6th International Symposium, 2010

Digital Stars and Visibility of Digital Objects.
Proceedings of the Computational Modeling of Objects Represented in Images, 2010

Connectedness of Offset Digitizations in Higher Dimensions.
Proceedings of the Computational Modeling of Objects Represented in Images, 2010

2009
Advances in combinatorial image analysis.
Pattern Recognit., 2009

Digitization scheme that assures faithful reconstruction of plane figures.
Pattern Recognit., 2009

Combining ubiquitous direction-sensitive digitizing with a multimedia electronic dictionary for enhanced understanding.
Int. J. Imaging Syst. Technol., 2009

Guest editorial: Contemporary challenges in combinatorial image analysis.
Int. J. Imaging Syst. Technol., 2009

Combinatorial approach to image analysis.
Discret. Appl. Math., 2009

Formulas for the number of (n-2)-gaps of binary objects in arbitrary dimension.
Discret. Appl. Math., 2009

Some theoretical challenges in digital geometry: A perspective.
Discret. Appl. Math., 2009

On the Convex Hull of the Integer Points in a Bi-circular Region.
Proceedings of the Combinatorial Image Analysis, 13th International Workshop, 2009

Theoretical Issues of Cluster Pattern Interfaces.
Proceedings of the Combinatorial Image Analysis, 13th International Workshop, 2009

Print-based Interaction Interfaces for Multilingual Multimedia and Sign Language Electronic Resource Integration.
Proceedings of the ICSOFT 2009, 2009

Minimal Offsets That Guarantee Maximal or Minimal Connectivity of Digital Curves in <i>n</i>D.
Proceedings of the Discrete Geometry for Computer Imagery, 2009

2008
On the polyhedral complexity of the integer points in a hyperball.
Theor. Comput. Sci., 2008

Border and SurfaceTracing - Theoretical Foundations.
IEEE Trans. Pattern Anal. Mach. Intell., 2008

Genus and Dimension of Digital Images and their Time- and Space-Efficient Computation.
Int. J. Shape Model., 2008

Scaling of Plane Figures That Assures Faithful Digitization.
Proceedings of the Combinatorial Image Analysis, 12th International Workshop, 2008

Electronic Multimedia Dictionary with Direct-Access Printed Interface.
Proceedings of the Image Analysis, 2008

Offset Approach to Defining 3D Digital Lines.
Proceedings of the Advances in Visual Computing, 4th International Symposium, 2008

Linear Time Constant-Working Space Algorithm for Computing the Genus of a Digital Object.
Proceedings of the Advances in Visual Computing, 4th International Symposium, 2008

2007
Digital hyperplane recognition in arbitrary fixed dimension within an algebraic computation model.
Image Vis. Comput., 2007

Digital planarity - A review.
Discret. Appl. Math., 2007

Algorithmic and explicit determination of the Lovász number for certain circulant graphs.
Discret. Appl. Math., 2007

2006
Computational Aspects of Digital Plane and Hyperplane Recognition.
Proceedings of the Combinatorial Image Analysis, 11th International Workshop, 2006

On the Notion of Dimension in Digital Spaces.
Proceedings of the Combinatorial Image Analysis, 11th International Workshop, 2006

Counting Gaps in Binary Pictures.
Proceedings of the Combinatorial Image Analysis, 11th International Workshop, 2006

Polyhedrization of Discrete Convex Volumes.
Proceedings of the Advances in Visual Computing, Second International Symposium, 2006

Combinatorial Relations for Digital Pictures.
Proceedings of the Discrete Geometry for Computer Imagery, 13th International Conference, 2006

Discrete volume polyhedrization : complexity and bounds on performance.
Proceedings of the Computational Modeling of Objects Represented in Images-Fundamentals, 2006

Digital geometry for image analysis and processing.
Proceedings of the Computational Modeling of Objects Represented in Images-Fundamentals, 2006

2005
Exact Image Reconstruction from a Single Projection through Real Computation.
Electron. Notes Discret. Math., 2005

Plane digitization and related combinatorial problems.
Discret. Appl. Math., 2005

Optimal discovery of repetitions in 2D.
Discret. Appl. Math., 2005

An explicit formula for the number of tunnels in digital objects
CoRR, 2005

Analytical Honeycomb Geometry for Raster and Volume Graphics.
Comput. J., 2005

The Number of Gaps in Binary Pictures.
Proceedings of the Advances in Visual Computing, First International Symposium, 2005

Complexity Analysis for Digital Hyperplane Recognition in Arbitrary Fixed Dimension.
Proceedings of the Discrete Geometry for Computer Imagery, 12th International Conference, 2005

2004
Connectivity of discrete planes.
Theor. Comput. Sci., 2004

Clique, chromatic, and Lovász numbers of certain circulant graphs.
Electron. Notes Discret. Math., 2004

Efficient Computation of the Lovász Theta Function for a Class of Circulant Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

Curves, Hypersurfaces, and Good Pairs of Adjacency Relations.
Proceedings of the Combinatorial Image Analysis, 10th InternationalWorkshop, 2004

2003
Optimal Parallel Searching an Array for Certain Repetitions.
Electron. Notes Discret. Math., 2003

Computation of the Lovász Theta Function for Circulant Graphs
Electron. Colloquium Comput. Complex., 2003

Digital Flatness.
Proceedings of the Discrete Geometry for Computer Imagery, 11th International Conference, 2003

2002
Graceful planes and lines.
Theor. Comput. Sci., 2002

Object discretizations in higher dimensions.
Pattern Recognit. Lett., 2002

An alternative to Ben-Or's lower bound for the knapsack problem complexity.
Appl. Math. Lett., 2002

2001
Optimally Fast CRCW-PRAM Testing 2D-Arrays for Existence of Repetitive Patterns.
Int. J. Pattern Recognit. Artif. Intell., 2001

Honeycomb vs square and cubic models.
Electron. Notes Theor. Comput. Sci., 2001

2000
Thin discrete triangular meshes.
Theor. Comput. Sci., 2000

Fibonacci arrays and their two-dimensional repetitions.
Theor. Comput. Sci., 2000

On the Algebraic Complexity of Integer Programming
Electron. Colloquium Comput. Complex., 2000

On the Complexity of Integer Programming in the Blum-Shub-Smale Computational Model.
Proceedings of the Theoretical Computer Science, 2000

Object Discretization in Higher Dimensions.
Proceedings of the Discrete Geometry for Computer Imagery, 9th International Conference, 2000

On the Lovász Number of Certain Circulant Graphs.
Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000

Minimally Thin Discrete Triangulation.
Proceedings of the Volume Graphics, 2000

1999
Graceful Planes and Thin Tunnel-Free Meshes.
Proceedings of the Discrete Geometry for Computer Imagery, 1999

1998
Lower Bounds, "Pseudopolynomial" and Approximation Algorithms for the Knapsack Problem with Real Coefficients
Electron. Colloquium Comput. Complex., 1998

1997
Real Data--Integer Solution Problems within the Blum-Shub-Smale Computational Model.
J. Complex., 1997

1996
Strong NP-Completeness of a Matrix Similarity Problem.
Theor. Comput. Sci., 1996


  Loading...