The following pages link to Valentin E. Brimkov (Q423909):
Displayed 50 items.
- Approximation algorithms for a geometric set cover problem (Q423912) (← links)
- Combinatorial and discrete geometric problems in image analysis (Q499709) (← links)
- On the polyhedra of graceful spheres and circular geodesics (Q528332) (← links)
- Connectivity of discrete planes (Q596053) (← links)
- Guarding a set of line segments in the plane (Q630591) (← links)
- Strong NP-completeness of a matrix similarity problem (Q671534) (← links)
- (Q869567) (redirect page) (← links)
- Digital planarity -- a review (Q869568) (← links)
- On the polyhedral complexity of the integer points in a hyperball (Q952452) (← links)
- Some theoretical challenges in digital geometry: a perspective (Q967394) (← links)
- Formulas for the number of \((n-2)\)-gaps of binary objects in arbitrary dimension (Q1003705) (← links)
- Digitization scheme that assures faithful reconstruction of plane figures (Q1023427) (← links)
- Tight complexity bounds for the two-dimensional real knapsack problem (Q1300669) (← links)
- Real data-integer solution problems within the Blum-Shub-Smale computational model (Q1368838) (← links)
- (Q1566728) (redirect page) (← links)
- Fibonacci arrays and their two-dimensional repetitions (Q1566729) (← links)
- Thin discrete triangular meshes (Q1583599) (← links)
- Graceful planes and lines. (Q1603644) (← links)
- An alternative to Ben-Or's lower bound for the knapsack problem complexity (Q1609452) (← links)
- Homothetic polygons and beyond: maximal cliques in intersection graphs (Q1671346) (← links)
- Plane digitization and related combinatorial problems (Q1775618) (← links)
- On connectedness of discretized sets (Q2037368) (← links)
- Optimal conditions for connectedness of discretized sets (Q2156309) (← links)
- Algorithmic and explicit determination of the Lovász number for certain circulant graphs (Q2383537) (← links)
- Gradient elements of the knapsack polytope (Q2569821) (← links)
- Optimal discovery of repetitions in 2D (Q2573235) (← links)
- On the Connectivity and Smoothness of Discrete Spherical Circles (Q2794628) (← links)
- Approximability issues of guarding a set of segments (Q2855782) (← links)
- (Q3029019) (← links)
- Digital Stars and Visibility of Digital Objects (Q3069605) (← links)
- Connectedness of Offset Digitizations in Higher Dimensions (Q3069607) (← links)
- Experimental Study on Approximation Algorithms for Guarding Sets of Line Segments (Q3077409) (← links)
- (Q3360947) (← links)
- Optimal Parallel Searching an Array for Certain Repetitions (Q3438903) (← links)
- Clique, chromatic, and Lovász numbers of certain circulant graphs (Q3439129) (← links)
- Exact Image Reconstruction from a Single Projection through Real Computation (Q3439189) (← links)
- Minimal Offsets That Guarantee Maximal or Minimal Connectivity of Digital Curves in nD (Q3648796) (← links)
- On the Convex Hull of the Integer Points in a Bi-circular Region (Q3651599) (← links)
- Theoretical Issues of Cluster Pattern Interfaces (Q3651623) (← links)
- (Q3757684) (← links)
- (Q3808157) (← links)
- (Q4263844) (← links)
- (Q4272139) (← links)
- (Q4319603) (← links)
- (Q4325138) (← links)
- (Q4471796) (← links)
- (Q4503943) (← links)
- (Q4536432) (← links)
- Object discretizations in higher dimensions (Q4538846) (← links)
- “Honeycomb” vs Square and Cubic Models (Q4917109) (← links)