Une brève biographie scientifique de Maurice Nivat
Theoretical Computer Science
Basic analytic combinatorics of directed lattice paths
Theoretical Computer Science
Reconstruction of convex 2D discrete sets in polynomial time
Theoretical Computer Science
Discrete Tomography: Reconstruction under Periodicity Constraints
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
The Reconstruction of Polyominoes from Approximately Orthogonal Projections
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
The Reconstruction of Some 3D Convex Polyominoes from Orthogonal Projections
SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Reconstruction of Discrete Sets from Three or More X-Rays
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Reconstruction in Different Classes of 2D Discrete Sets (Invited Paper)
DCGI '99 Proceedings of the 8th International Conference on Discrete Geometry for Computer Imagery
Representing 2D Digital Objects
DGCI '00 Proceedings of the 9th International Conference on Discrete Geometry for Computer Imagery
Detection of the Discrete Convexity of Polyominoes
DGCI '00 Proceedings of the 9th International Conference on Discrete Geometry for Computer Imagery
An Algorithm for Reconstructing Special Lattice Sets from Their Approximate X-Rays
DGCI '00 Proceedings of the 9th International Conference on Discrete Geometry for Computer Imagery
The Reconstruction of Convex Polyominoes from Horizontal and Vertical Projections
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Detection of the discrete convexity of polyominoes
Discrete Applied Mathematics
Theoretical Computer Science
An algorithm reconstructing convex lattice sets
Theoretical Computer Science
Reconstruction of 8-connected but not 4-connected hv-convex discrete sets
Discrete Applied Mathematics - Special issue: Advances in discrete geometry and topology (DGCI 2003)
Algorithms for polyominoes based on the discrete Green theorem
Discrete Applied Mathematics - Special issue: Advances in discrete geometry and topology (DGCI 2003)
An introduction to periodical discrete sets from a tomographical perspective
Theoretical Computer Science
Random generation of Q-convex sets
Theoretical Computer Science
An evolutionary algorithm for discrete tomography
Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
Optimization and reconstruction of hv-convex (0, 1)-matrices
Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
A reconstruction algorithm for L-convex polyominoes
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Editorial: in memoriam: Alberto Del Lungo (1965-2003)
Theoretical Computer Science - In memoriam: Alberto Del Lungo (1965-2003)
The discrete Green Theorem and some applications in discrete geometry
Theoretical Computer Science - In memoriam: Alberto Del Lungo (1965-2003)
Reconstruction of convex polyominoes from orthogonal projections of their contours
Theoretical Computer Science - In memoriam: Alberto Del Lungo (1965-2003)
Determination of Q-convex sets by X-rays
Theoretical Computer Science
Binary matrices under the microscope: A tomographical problem
Theoretical Computer Science
Higman's Theorem on Discrete Sets
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
A Network Flow Algorithm for Reconstructing Binary Images from Discrete X-rays
Journal of Mathematical Imaging and Vision
A decomposition technique for reconstructing discrete sets from four projections
Image and Vision Computing
Reconstruction of binary matrices under fixed size neighborhood constraints
Theoretical Computer Science
Reconstruction of convex lattice sets from tomographic projections in quartic time
Theoretical Computer Science
Scanning integer matrices by means of two rectangular windows
Theoretical Computer Science
Theoretical Computer Science
Complexity results for the horizontal bar packing problem
Information Processing Letters
Decision Trees in Binary Tomography for Supporting the Reconstruction of hv-Convex Connected Images
ACIVS '08 Proceedings of the 10th International Conference on Advanced Concepts for Intelligent Vision Systems
Solving Nonograms by combining relaxations
Pattern Recognition
Numerical characterization of n-cube subset partitioning
Discrete Applied Mathematics
A benchmark set for the reconstruction of hv-convex discrete sets
Discrete Applied Mathematics
PCIF: An Algorithm for Lossless True Color Image Compression
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
Reconstruction of Canonical hv-Convex Discrete Sets from Horizontal and Vertical Projections
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
An evolutionary algorithm for discrete tomography
Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
Optimization and reconstruction of hv-convex (0,1)-matrices
Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
Reconstruction of 8-connected but not 4-connected hv-convex discrete sets
Discrete Applied Mathematics - Special issue: Advances in discrete geometry and topology (DGCI 2003)
Algorithms for polyominoes based on the discrete Green theorem
Discrete Applied Mathematics - Special issue: Advances in discrete geometry and topology (DGCI 2003)
Generation and empirical investigation of hv-convex discrete sets
SCIA'07 Proceedings of the 15th Scandinavian conference on Image analysis
Recognizable picture languages and polyominoes
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
ECO method and the exhaustive generation of convex polyominoes
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
Approximating hv-convex binary matrices and images from discrete projections
DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
On the number of hv-convex discrete sets
IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
A reasoning framework for solving nonograms
IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
An Algebraic Framework for Discrete Tomography: Revealing the Structure of Dependencies
SIAM Journal on Discrete Mathematics
Theoretical Computer Science
Discrete Q-convex sets reconstruction from discrete point X-rays
IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
From linear partitions to parallelogram polyominoes
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Polyominoes simulating arbitrary-neighborhood zippers and tilings
Theoretical Computer Science
Reconstructing an alternate periodical binary matrix from its orthogonal projections
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
The number of line-convex directed polyominoes having the same orthogonal projections
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
Fast filling operations used in the reconstruction of convex lattice sets
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
Ordering and convex polyominoes
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Reconstruction of decomposable discrete sets from four projections
DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery
A tomographical characterization of l-convex polyominoes
DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery
Higman's Theorem on Discrete Sets
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
How to decompose a binary matrix into three hv-convex polyominoes
DGCI'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery
Solving Multicolor Discrete Tomography Problems by Using Prior Knowledge
Fundamenta Informaticae - Strategies for Tomography
Fundamenta Informaticae - Strategies for Tomography
| Hi-index | 5.24 |