Yan Gerard

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
Conflict optimization for binary CSP applied to minimum partition into plane subgraphs and graph coloring	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	2023-11-24	Paper
Reconstruction of Convex Sets from One or Two X-rays	2023-09-14	Paper
Complexity results on untangling red-blue matchings	2023-07-26	Paper
Shadoks Approach to Low-Makespan Coordinated Motion Planning	2023-06-26	Paper
Complexity results on untangling red-blue matchings	2023-06-20	Paper
Efficient algorithms for Battleship	2023-02-07	Paper
Greedy and Local Search Heuristics to Build Area-Optimal Polygons	2022-09-06	Paper
Efficiently testing digital convexity and recognizing digital convex polygons	2020-10-06	Paper
Convex Aggregation Problems in $$\mathbb {Z}^2$$	2019-10-16	Paper
Efficient Algorithms to Test Digital Convexity	2019-10-16	Paper
Regular switching components	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	2017-09-12	Paper
Recognition of Digital Polyhedra with a Fixed Number of Faces	2016-07-15	Paper
Tight bounds in the quadtree complexity theorem and the maximal number of pixels crossed by a curve of given length	2016-04-01	Paper
About the Maximum Cardinality of the Digital Cover of a Curve with a Given Length	2014-09-15	Paper
An Elementary Algorithm for Digital Arc Segmentation	2013-04-26	Paper
Recognition of Digital Hyperplanes and Level Layers with Forbidden Points	2011-05-27	Paper
Estimation of the Derivatives of a Digital Function with a Convergent Bounded Error	2011-05-19	Paper
Introduction to Digital Level Layers	2011-05-19	Paper
About the Complexity of Timetables and 3-Dimensional Discrete Tomography: A Short Proof of NP-Hardness	2009-12-11	Paper
Gift-wrapping based preimage computation algorithm	2009-08-19	Paper
Gift-Wrapping Based Preimage Computation Algorithm	2008-04-24	Paper
https://portal.mardi4nfdi.de/entity/Q5434311	2008-01-04	Paper
Application of a discrete tomography algorithm to computerized tomography	2007-05-29	Paper
Some necessary clarifications about the chords' problem and the partial digest problem	2005-12-29	Paper
Discrete Geometry for Computer Imagery	2005-09-13	Paper
An elementary algorithm for digital arc segmentation	2004-08-06	Paper
https://portal.mardi4nfdi.de/entity/Q4471788	2004-07-30	Paper
Periodic graphs and connectivity of the rational digital hyperplanes	2002-07-15	Paper
The chords' problem	2002-07-15	Paper
On the computational complexity of reconstructing three-dimensional lattice sets from their two-dimensional $X$-rays	2002-02-07	Paper
https://portal.mardi4nfdi.de/entity/Q4263845	1999-09-22	Paper
Analyse locale des droites discrètes. Généralisation et application à la connexité des plans discrets	1997-12-17	Paper

Research outcomes over time

This page was built for person: Yan Gerard