On the Complexity of Integer Programming in the Blum-Shub-Smale Computational Model
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Digital hyperplane recognition in arbitrary fixed dimension within an algebraic computation model
Image and Vision Computing
On the polyhedral complexity of the integer points in a hyperball
Theoretical Computer Science
Some theoretical challenges in digital geometry: A perspective
Discrete Applied Mathematics
On the Convex Hull of the Integer Points in a Bi-circular Region
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
Complexity analysis for digital hyperplane recognition in arbitrary fixed dimension
DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery
| Hi-index | 0.00 |