| Publication | Date of Publication | Type |
|---|
Conflict optimization for binary CSP applied to minimum partition into plane subgraphs and graph coloring
ACM Journal of Experimental Algorithmics | 2024-07-26 | Paper |
Short flip sequences to untangle segments in the plane
| 2024-07-19 | Paper |
Shadoks approach to minimum partition into plane subgraphs (CG challenge)
| 2024-05-14 | Paper |
On the longest flip sequence to untangle segments in the plane
WALCOM: Algorithms and Computation | 2023-11-24 | Paper |
Reconstruction of Convex Sets from One or Two X-rays
Fundamenta Informaticae | 2023-09-14 | Paper |
Complexity results on untangling red-blue matchings
Lecture Notes in Computer Science | 2023-07-26 | Paper |
Shadoks Approach to Low-Makespan Coordinated Motion Planning
ACM Journal of Experimental Algorithmics | 2023-06-26 | Paper |
Complexity results on untangling red-blue matchings
Computational Geometry | 2023-06-20 | Paper |
Efficient algorithms for Battleship
| 2023-02-07 | Paper |
Greedy and local search heuristics to build area-optimal polygons
ACM Journal of Experimental Algorithmics | 2022-09-06 | Paper |
Efficiently testing digital convexity and recognizing digital convex polygons
Journal of Mathematical Imaging and Vision | 2020-10-06 | Paper |
Convex aggregation problems in \(\mathbb{Z}^2\)
Discrete Geometry for Computer Imagery | 2019-10-16 | Paper |
Efficient Algorithms to Test Digital Convexity
Discrete Geometry for Computer Imagery | 2019-10-16 | Paper |
Regular switching components
Theoretical Computer Science | 2019-06-18 | Paper |
Recognition of digital polyhedra with a fixed number of faces is decidable in dimension 3
| 2018-01-19 | Paper |
About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces
Journal of Mathematical Imaging and Vision | 2017-09-12 | Paper |
Recognition of digital polyhedra with a fixed number of faces
Discrete Geometry for Computer Imagery | 2016-07-15 | Paper |
Tight bounds in the quadtree complexity theorem and the maximal number of pixels crossed by a curve of given length
Theoretical Computer Science | 2016-04-01 | Paper |
About the Maximum Cardinality of the Digital Cover of a Curve with a Given Length
Advanced Information Systems Engineering | 2014-09-15 | Paper |
An elementary algorithm for digital arc segmentation
Electronic Notes in Theoretical Computer Science | 2013-04-26 | Paper |
Recognition of digital hyperplanes and level layers with forbidden points
Lecture Notes in Computer Science | 2011-05-27 | Paper |
Estimation of the derivatives of a digital function with a convergent bounded error
Discrete Geometry for Computer Imagery | 2011-05-19 | Paper |
Introduction to digital level layers
Discrete Geometry for Computer Imagery | 2011-05-19 | Paper |
About the Complexity of Timetables and 3-Dimensional Discrete Tomography: A Short Proof of NP-Hardness
Lecture Notes in Computer Science | 2009-12-11 | Paper |
Gift-wrapping based preimage computation algorithm
Pattern Recognition | 2009-08-19 | Paper |
Gift-Wrapping Based Preimage Computation Algorithm
Discrete Geometry for Computer Imagery | 2008-04-24 | Paper |
Application of a discrete tomography approach to computerized tomography
| 2008-01-04 | Paper |
Application of a discrete tomography algorithm to computerized tomography
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Some necessary clarifications about the chords' problem and the partial digest problem
Theoretical Computer Science | 2005-12-29 | Paper |
Discrete Geometry for Computer Imagery
Lecture Notes in Computer Science | 2005-09-13 | Paper |
An elementary algorithm for digital arc segmentation
Discrete Applied Mathematics | 2004-08-06 | Paper |
scientific article; zbMATH DE number 2079721 (Why is no real title available?)
| 2004-07-30 | Paper |
Periodic graphs and connectivity of the rational digital hyperplanes
Theoretical Computer Science | 2002-07-15 | Paper |
The chords' problem
Theoretical Computer Science | 2002-07-15 | Paper |
On the computational complexity of reconstructing three-dimensional lattice sets from their two-dimensional \(X\)-rays
Linear Algebra and its Applications | 2002-02-07 | Paper |
scientific article; zbMATH DE number 1342259 (Why is no real title available?)
| 1999-09-22 | Paper |
Analyse locale des droites discrètes. Généralisation et application à la connexité des plans discrets
Comptes Rendus de l'Académie des Sciences - Series I - Mathematics | 1997-12-17 | Paper |
