| Publication | Date of Publication | Type |
|---|
| Graphs with degree sequence \(\{ ( m - 1 )^m , ( n - 1 )^n \}\) and \(\{ m^n , n^m \}\) | 2024-09-26 | Paper |
| Graphs with degree sequence $\{m^{m-1},n^{n-1}\}$ and $\{m^n,n^m\}$ | 2023-08-12 | Paper |
| Optimal conditions for connectedness of discretized sets | 2022-07-18 | Paper |
| On connectedness of discretized sets | 2021-07-01 | Paper |
| Homothetic polygons and beyond: maximal cliques in intersection graphs | 2018-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5273292 | 2017-07-05 | Paper |
| On the polyhedra of graceful spheres and circular geodesics | 2017-05-12 | Paper |
| On the Connectivity and Smoothness of Discrete Spherical Circles | 2016-03-10 | Paper |
| Combinatorial and discrete geometric problems in image analysis | 2015-10-06 | Paper |
| Parallel Algorithms for Combinatorial Pattern Matching | 2015-04-17 | Paper |
| On Intersection Graphs of Convex Polygons | 2015-04-17 | Paper |
| Approximability issues of guarding a set of segments | 2013-10-22 | Paper |
| Geometric approach to string analysis: deviation from linearity and its use for biosequence classification | 2013-08-13 | Paper |
| “Honeycomb” vs Square and Cubic Models | 2013-04-26 | Paper |
| Approximation algorithms for a geometric set cover problem | 2012-05-30 | Paper |
| Guarding a set of line segments in the plane | 2011-03-17 | Paper |
| Experimental Study on Approximation Algorithms for Guarding Sets of Line Segments | 2011-02-22 | Paper |
| Digital Stars and Visibility of Digital Objects | 2011-01-18 | Paper |
| Connectedness of Offset Digitizations in Higher Dimensions | 2011-01-18 | Paper |
| Some theoretical challenges in digital geometry: a perspective | 2010-04-28 | Paper |
| GENUS AND DIMENSION OF DIGITAL IMAGES AND THEIR TIME- AND SPACE-EFFICIENT COMPUTATION | 2010-03-22 | Paper |
| Discrete Geometry for Computer Imagery | 2010-01-05 | Paper |
| On the Convex Hull of the Integer Points in a Bi-circular Region | 2009-12-11 | Paper |
| Theoretical Issues of Cluster Pattern Interfaces | 2009-12-11 | Paper |
| Counting Gaps in Binary Pictures | 2009-12-11 | Paper |
| Minimal Offsets That Guarantee Maximal or Minimal Connectivity of Digital Curves in nD | 2009-12-01 | Paper |
| Digitization scheme that assures faithful reconstruction of plane figures | 2009-06-11 | Paper |
| Formulas for the number of \((n-2)\)-gaps of binary objects in arbitrary dimension | 2009-03-04 | Paper |
| On the polyhedral complexity of the integer points in a hyperball | 2008-11-12 | Paper |
| Combinatorial Relations for Digital Pictures | 2008-04-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5442300 | 2008-02-22 | Paper |
| Algorithmic and explicit determination of the Lovász number for certain circulant graphs | 2007-09-19 | Paper |
| Optimal Parallel Searching an Array for Certain Repetitions | 2007-05-29 | Paper |
| Clique, chromatic, and Lovász numbers of certain circulant graphs | 2007-05-29 | Paper |
| Exact Image Reconstruction from a Single Projection through Real Computation | 2007-05-29 | Paper |
| Digital planarity -- a review | 2007-03-08 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
| Optimal discovery of repetitions in 2D | 2005-11-07 | Paper |
| Gradient elements of the knapsack polytope | 2005-10-20 | Paper |
| Discrete Geometry for Computer Imagery | 2005-09-13 | Paper |
| Combinatorial Image Analysis | 2005-08-12 | Paper |
| Plane digitization and related combinatorial problems | 2005-05-04 | Paper |
| Connectivity of discrete planes | 2004-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471796 | 2004-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536432 | 2002-11-28 | Paper |
| An alternative to Ben-Or's lower bound for the knapsack problem complexity | 2002-08-15 | Paper |
| Graceful planes and lines. | 2002-07-15 | Paper |
| Object discretizations in higher dimensions | 2002-07-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4503943 | 2001-02-12 | Paper |
| Thin discrete triangular meshes | 2000-10-31 | Paper |
| Tight complexity bounds for the two-dimensional real knapsack problem | 2000-10-22 | Paper |
| Fibonacci arrays and their two-dimensional repetitions | 2000-06-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263844 | 1999-11-29 | Paper |
| Real data-integer solution problems within the Blum-Shub-Smale computational model | 1997-11-20 | Paper |
| Strong NP-completeness of a matrix similarity problem | 1997-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4325138 | 1995-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4319603 | 1995-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4272139 | 1994-01-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3360947 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3808157 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3029019 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3757684 | 1987-01-01 | Paper |
