Valentin E. Brimkov

From MaRDI portal
Revision as of 20:33, 11 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Valentin E. Brimkov to Valentin E. Brimkov: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:423909

Available identifiers

zbMath Open brimkov.valentin-eMaRDI QIDQ423909

List of research outcomes

PublicationDate of PublicationType
Graphs with degree sequence $\{m^{m-1},n^{n-1}\}$ and $\{m^n,n^m\}$2023-08-12Paper
Optimal conditions for connectedness of discretized sets2022-07-18Paper
On connectedness of discretized sets2021-07-01Paper
Homothetic polygons and beyond: maximal cliques in intersection graphs2018-09-06Paper
https://portal.mardi4nfdi.de/entity/Q52732922017-07-05Paper
On the polyhedra of graceful spheres and circular geodesics2017-05-12Paper
On the Connectivity and Smoothness of Discrete Spherical Circles2016-03-10Paper
Combinatorial and discrete geometric problems in image analysis2015-10-06Paper
Parallel Algorithms for Combinatorial Pattern Matching2015-04-17Paper
On Intersection Graphs of Convex Polygons2015-04-17Paper
Approximability issues of guarding a set of segments2013-10-22Paper
Geometric approach to string analysis: deviation from linearity and its use for biosequence classification2013-08-13Paper
“Honeycomb” vs Square and Cubic Models2013-04-26Paper
Approximation algorithms for a geometric set cover problem2012-05-30Paper
Guarding a set of line segments in the plane2011-03-17Paper
Experimental Study on Approximation Algorithms for Guarding Sets of Line Segments2011-02-22Paper
Digital Stars and Visibility of Digital Objects2011-01-18Paper
Connectedness of Offset Digitizations in Higher Dimensions2011-01-18Paper
Some theoretical challenges in digital geometry: a perspective2010-04-28Paper
GENUS AND DIMENSION OF DIGITAL IMAGES AND THEIR TIME- AND SPACE-EFFICIENT COMPUTATION2010-03-22Paper
Discrete Geometry for Computer Imagery2010-01-05Paper
On the Convex Hull of the Integer Points in a Bi-circular Region2009-12-11Paper
Theoretical Issues of Cluster Pattern Interfaces2009-12-11Paper
Counting Gaps in Binary Pictures2009-12-11Paper
Minimal Offsets That Guarantee Maximal or Minimal Connectivity of Digital Curves in nD2009-12-01Paper
Digitization scheme that assures faithful reconstruction of plane figures2009-06-11Paper
Formulas for the number of \((n-2)\)-gaps of binary objects in arbitrary dimension2009-03-04Paper
On the polyhedral complexity of the integer points in a hyperball2008-11-12Paper
Combinatorial Relations for Digital Pictures2008-04-17Paper
https://portal.mardi4nfdi.de/entity/Q54423002008-02-22Paper
Algorithmic and explicit determination of the Lovász number for certain circulant graphs2007-09-19Paper
Optimal Parallel Searching an Array for Certain Repetitions2007-05-29Paper
Clique, chromatic, and Lovász numbers of certain circulant graphs2007-05-29Paper
Exact Image Reconstruction from a Single Projection through Real Computation2007-05-29Paper
Digital planarity -- a review2007-03-08Paper
Graph-Theoretic Concepts in Computer Science2005-12-08Paper
Optimal discovery of repetitions in 2D2005-11-07Paper
Gradient elements of the knapsack polytope2005-10-20Paper
Discrete Geometry for Computer Imagery2005-09-13Paper
Combinatorial Image Analysis2005-08-12Paper
Plane digitization and related combinatorial problems2005-05-04Paper
Connectivity of discrete planes2004-08-10Paper
https://portal.mardi4nfdi.de/entity/Q44717962004-07-30Paper
https://portal.mardi4nfdi.de/entity/Q45364322002-11-28Paper
An alternative to Ben-Or's lower bound for the knapsack problem complexity2002-08-15Paper
Graceful planes and lines.2002-07-15Paper
Object discretizations in higher dimensions2002-07-03Paper
https://portal.mardi4nfdi.de/entity/Q45039432001-02-12Paper
Thin discrete triangular meshes2000-10-31Paper
Tight complexity bounds for the two-dimensional real knapsack problem2000-10-22Paper
Fibonacci arrays and their two-dimensional repetitions2000-06-04Paper
https://portal.mardi4nfdi.de/entity/Q42638441999-11-29Paper
Real data-integer solution problems within the Blum-Shub-Smale computational model1997-11-20Paper
Strong NP-completeness of a matrix similarity problem1997-02-27Paper
https://portal.mardi4nfdi.de/entity/Q43251381995-08-17Paper
https://portal.mardi4nfdi.de/entity/Q43196031995-01-11Paper
https://portal.mardi4nfdi.de/entity/Q42721391994-01-26Paper
https://portal.mardi4nfdi.de/entity/Q33609471990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38081571988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30290191987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37576841987-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Valentin E. Brimkov