Valentin E. Brimkov

Ann. Math. Artif. Intell., January, 2024

Graphs with degree sequence {(m-1)m,(n-1)n} and {mn,nm}.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2024

2022

Optimal conditions for connectedness of discretized sets.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

2020

Dealing with Noise in Cluster Pattern Interface.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Image Analysis - 20th International Workshop, 2020

On Connectedness of Discretized Sets.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Image Analysis - 20th International Workshop, 2020

2019

Digital Manifolds in Computer Modeling.

[BibT_eX]

[DOI]

Inf. Sci., 2019

Teaching Data Analytics to Sport Management Majors: A Practical Approach.

[BibT_eX]

[DOI]

Proceedings of the Learning Technology for Education Challenges, 2019

2018

Discrete geometry and topology and their applications to imaging sciences.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2018

Homothetic polygons and beyond: Maximal cliques in intersection graphs.

[BibT_eX]

[DOI]

Konstanty Junosza-Szaniawski

Matthew Szczepankiewicz

Joshua Terhaar

Discret. Appl. Math., 2018

2017

Graph-theoretic and polyhedral combinatorics issues and approaches in imaging sciences.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

On the polyhedra of graceful spheres and circular geodesics.

[BibT_eX]

[DOI]

Ranita Biswas

Partha Bhowmick

Discret. Appl. Math., 2017

2016

Editorial.

[BibT_eX]

[DOI]

Trans. Mass Data Anal. Images Signals, 2016

2015

Combinatorial and discrete geometric problems in image analysis.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2015

On the Connectivity and Smoothness of Discrete Spherical Circles.

[BibT_eX]

[DOI]

Ranita Biswas

Partha Bhowmick

Proceedings of the Combinatorial Image Analysis - 17th International Workshop, 2015

2014

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

[BibT_eX]

[DOI]

Konstanty Junosza-Szaniawski

Matthew Szczepankiewicz

Joshua Terhaar

CoRR, 2014

Geometric Approach to Biosequence Analysis.

[BibT_eX]

[DOI]

Proceedings of the 8th International Conference on Practical Applications of Computational Biology & Bioinformatics, 2014

On Intersection Graphs of Convex Polygons.

[BibT_eX]

[DOI]

Sean Kafer

Matthew Szczepankiewicz

Joshua Terhaar

Proceedings of the Combinatorial Image Analysis - 16th International Workshop, 2014

Parallel Algorithms for Combinatorial Pattern Matching.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Image Analysis - 16th International Workshop, 2014

Knapsack Intersection Graphs and Efficient Computation of Their Maximal Cliques.

[BibT_eX]

[DOI]

Proceedings of the Computational Modeling of Objects Presented in Images. Fundamentals, Methods, and Applications, 2014

2013

Selected topics of combinatorial image analysis.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2013

Approximability issues of guarding a set of segments.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2013

On Connectedness of Discretized Objects.

[BibT_eX]

[DOI]

Proceedings of the Advances in Visual Computing - 9th International Symposium, 2013

2012

Approximation algorithms for a geometric set cover problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

2011

Guarding a set of line segments in the plane.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Preface.

[BibT_eX]

[DOI]

Petra Wiederhold

Theor. Comput. Sci., 2011

On the Approximability of a Geometric Set Cover Problem.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2011

Connected distance-based rasterization of objects in arbitrary dimension.

[BibT_eX]

[DOI]

Graph. Model., 2011

Computational modeling of objects represented in images.

[BibT_eX]

[DOI]

Graph. Model., 2011

Complexity and Approximability Issues in Combinatorial Image Analysis.

[BibT_eX]

[DOI]

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

[BibT_eX]

[DOI]

CoRR, 2010

Experimental Study on Approximation Algorithms for Guarding Sets of Line Segments.

[BibT_eX]

[DOI]

Proceedings of the Advances in Visual Computing - 6th International Symposium, 2010

Digital Stars and Visibility of Digital Objects.

[BibT_eX]

[DOI]

Proceedings of the Computational Modeling of Objects Represented in Images, 2010

Connectedness of Offset Digitizations in Higher Dimensions.

[BibT_eX]

[DOI]

Proceedings of the Computational Modeling of Objects Represented in Images, 2010

2009

Advances in combinatorial image analysis.

[BibT_eX]

[DOI]

Pattern Recognit., 2009

Digitization scheme that assures faithful reconstruction of plane figures.

[BibT_eX]

[DOI]

Pattern Recognit., 2009

Combining ubiquitous direction-sensitive digitizing with a multimedia electronic dictionary for enhanced understanding.

[BibT_eX]

[DOI]

Int. J. Imaging Syst. Technol., 2009

Guest editorial: Contemporary challenges in combinatorial image analysis.

[BibT_eX]

[DOI]

Int. J. Imaging Syst. Technol., 2009

Combinatorial approach to image analysis.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Formulas for the number of (n-2)-gaps of binary objects in arbitrary dimension.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Some theoretical challenges in digital geometry: A perspective.

[BibT_eX]

[DOI]

Tetsuo Asano

Discret. Appl. Math., 2009

On the Convex Hull of the Integer Points in a Bi-circular Region.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Image Analysis, 13th International Workshop, 2009

Theoretical Issues of Cluster Pattern Interfaces.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Image Analysis, 13th International Workshop, 2009

Print-based Interaction Interfaces for Multilingual Multimedia and Sign Language Electronic Resource Integration.

[BibT_eX]

Proceedings of the ICSOFT 2009, 2009

Minimal Offsets That Guarantee Maximal or Minimal Connectivity of Digital Curves in <i>n</i>D.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 2009

2008

On the polyhedral complexity of the integer points in a hyperball.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Border and SurfaceTracing - Theoretical Foundations.

[BibT_eX]

[DOI]

Reinhard Klette

IEEE Trans. Pattern Anal. Mach. Intell., 2008

Genus and Dimension of Digital Images and their Time- and Space-Efficient Computation.

[BibT_eX]

[DOI]

Int. J. Shape Model., 2008

Scaling of Plane Figures That Assures Faithful Digitization.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Image Analysis, 12th International Workshop, 2008

Electronic Multimedia Dictionary with Direct-Access Printed Interface.

[BibT_eX]

Proceedings of the Image Analysis, 2008

Offset Approach to Defining 3D Digital Lines.

[BibT_eX]

[DOI]

François de Vieilleville

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.

[BibT_eX]

[DOI]

Proceedings of the Advances in Visual Computing, 4th International Symposium, 2008

2007

Digital hyperplane recognition in arbitrary fixed dimension within an algebraic computation model.

[BibT_eX]

[DOI]

Image Vis. Comput., 2007

Digital planarity - A review.

[BibT_eX]

[DOI]

David Coeurjolly

Reinhard Klette

Discret. Appl. Math., 2007

Algorithmic and explicit determination of the Lovász number for certain circulant graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

2006

Computational Aspects of Digital Plane and Hyperplane Recognition.

[BibT_eX]

[DOI]

David Coeurjolly

Proceedings of the Combinatorial Image Analysis, 11th International Workshop, 2006

On the Notion of Dimension in Digital Spaces.

[BibT_eX]

[DOI]

Angelo Maimone

Giorgio Nordo

Proceedings of the Combinatorial Image Analysis, 11th International Workshop, 2006

Counting Gaps in Binary Pictures.

[BibT_eX]

[DOI]

Angelo Maimone

Giorgio Nordo

Proceedings of the Combinatorial Image Analysis, 11th International Workshop, 2006

Polyhedrization of Discrete Convex Volumes.

[BibT_eX]

[DOI]

Proceedings of the Advances in Visual Computing, Second International Symposium, 2006

Combinatorial Relations for Digital Pictures.

[BibT_eX]

[DOI]

Davide Moroni

Proceedings of the Discrete Geometry for Computer Imagery, 13th International Conference, 2006

Discrete volume polyhedrization : complexity and bounds on performance.

[BibT_eX]

Proceedings of the Computational Modeling of Objects Represented in Images-Fundamentals, 2006

Digital geometry for image analysis and processing.

[BibT_eX]

Proceedings of the Computational Modeling of Objects Represented in Images-Fundamentals, 2006

2005

Exact Image Reconstruction from a Single Projection through Real Computation.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

Plane digitization and related combinatorial problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

Optimal discovery of repetitions in 2D.

[BibT_eX]

[DOI]

Alberto Apostolico

Discret. Appl. Math., 2005

An explicit formula for the number of tunnels in digital objects

[BibT_eX]

[DOI]

Angelo Maimone

Giorgio Nordo

CoRR, 2005

Analytical Honeycomb Geometry for Raster and Volume Graphics.

[BibT_eX]

[DOI]

Comput. J., 2005

The Number of Gaps in Binary Pictures.

[BibT_eX]

[DOI]

Proceedings of the Advances in Visual Computing, First International Symposium, 2005

Complexity Analysis for Digital Hyperplane Recognition in Arbitrary Fixed Dimension.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 12th International Conference, 2005

2004

Connectivity of discrete planes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Clique, chromatic, and Lovász numbers of certain circulant graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2004

Efficient Computation of the Lovász Theta Function for a Class of Circulant Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

Curves, Hypersurfaces, and Good Pairs of Adjacency Relations.

[BibT_eX]

[DOI]

Reinhard Klette

Proceedings of the Combinatorial Image Analysis, 10th InternationalWorkshop, 2004

2003

Optimal Parallel Searching an Array for Certain Repetitions.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2003

Computation of the Lovász Theta Function for Circulant Graphs

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2003

Digital Flatness.

[BibT_eX]

[DOI]

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

2002

Graceful planes and lines.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Object discretizations in higher dimensions.

[BibT_eX]

[DOI]

Eric Andres

Pattern Recognit. Lett., 2002

An alternative to Ben-Or's lower bound for the knapsack problem complexity.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2002

2001

Optimally Fast CRCW-PRAM Testing 2D-Arrays for Existence of Repetitive Patterns.

[BibT_eX]

[DOI]

Int. J. Pattern Recognit. Artif. Intell., 2001

Honeycomb vs square and cubic models.

[BibT_eX]

[DOI]

Proceedings of the 8th International Workshop on Combinatorial Image Analysis, 2001

2000

Thin discrete triangular meshes.

[BibT_eX]

[DOI]

Philippe Nehlig

Theor. Comput. Sci., 2000

Fibonacci arrays and their two-dimensional repetitions.

[BibT_eX]

[DOI]

Alberto Apostolico

Theor. Comput. Sci., 2000

On the Algebraic Complexity of Integer Programming

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2000

On the Complexity of Integer Programming in the Blum-Shub-Smale Computational Model.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 2000

Object Discretization in Higher Dimensions.

[BibT_eX]

[DOI]

Eric Andres

Proceedings of the Discrete Geometry for Computer Imagery, 9th International Conference, 2000

On the Lovász Number of Certain Circulant Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000

Minimally Thin Discrete Triangulation.

[BibT_eX]

[DOI]

Philippe Nehlig

Proceedings of the Volume Graphics, 2000

1999

Graceful Planes and Thin Tunnel-Free Meshes.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 1999

1998

Lower Bounds, "Pseudopolynomial" and Approximation Algorithms for the Knapsack Problem with Real Coefficients

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 1998

1997

Real Data--Integer Solution Problems within the Blum-Shub-Smale Computational Model.

[BibT_eX]

[DOI]