Local Configurations of Digital Hyperplanes. - Yan Gérard (DGCI, 1999)

A Question of Digital Linear Algebra. - Yan Gérard (DGCI, 2000)

The chords' problem. - Alain Daurat; Yan Gérard; Maurice Nivat (Theor. Comput. Sci., 2002)

Periodic graphs and connectivity of the rational digital hyperplanes. - Yan Gérard (Theor. Comput. Sci., 2002)

A fast and elementary algorithm for digital plane recognition. - Yan Gérard (Electron. Notes Discret. Math., 2003)

An elementary algorithm for digital arc segmentation. - David Coeurjolly; Yan Gérard; Jean-Pierre Reveillès; Laure Tougne (Discret. Appl. Math., 2004)

Computerized Tomography with Digital Lines and Linear Programming. - Fabien Feschet; Yan Gérard (DGCI, 2005)

An elementary digital plane recognition algorithm. - Yan Gérard; Isabelle Debled-Rennesson; Paul Zimmermann (Discret. Appl. Math., 2005)

Application of a discrete tomography algorithm to computerized tomography. - Yan Gérard; Fabien Feschet (Electron. Notes Discret. Math., 2005)

Some necessary clarifications about the chords' problem and the Partial Digest Problem. - Alain Daurat; Yan Gérard; Maurice Nivat (Theor. Comput. Sci., 2005)

Reduction from three-dimensional discrete tomography to multicommodity flow problem. - Yan Gérard (Theor. Comput. Sci., 2005)

LP fitting approach for reconstructing parametric surfaces from points clouds. - Thibault Marzais; Yan Gérard; Rémy Malgouyres (GRAPP, 2006)

Additive Subsets. - Yan Gérard (IWCIA, 2006)

Reconstructing a Matrix with a Given List of Coefficients and Prescribed Row and Column Sums Is NP-Hard. - Yan Gérard (IWCIA, 2008)

About the Complexity of Timetables and 3-Dimensional Discrete Tomography: A Short Proof of NP-Hardness. - Yan Gérard (IWCIA, 2009)

Gift-wrapping based preimage computation algorithm. - Yan Gérard; David Coeurjolly; Fabien Feschet (Pattern Recognit., 2009)

Introduction to Digital Level Layers. - Yan Gérard; Laurent Provot; Fabien Feschet (DGCI, 2011)

Estimation of the Derivatives of a Digital Function with a Convergent Bounded Error. - Laurent Provot; Yan Gérard (DGCI, 2011)

Recognition of Digital Hyperplanes and Level Layers with Forbidden Points. - Laurent Provot; Yan Gérard (IWCIA, 2011)

On template-based reconstruction from a single view: Analytical solutions and proofs of well-posedness for developable, isometric and conformal surfaces. - Adrien Bartoli; Yan Gérard; François Chadebecq; Toby Collins (CVPR, 2012)

Elementary algorithms for multiresolution geometric tomography with strip model of projections. - Yan Gerard (ISPA, 2013)

About the Maximum Cardinality of the Digital Cover of a Curve with a Given Length. - Yan Gerard; Antoine Vacavant (DGCI, 2014)

Digital Level Layers for Digital Curve Decomposition and Vectorization. - Laurent Provot; Yan Gérard; Fabien Feschet (Image Process. Line, 2014)

Shape-from-Template. - Adrien Bartoli; Yan Gérard; François Chadebecq; Toby Collins; Daniel Pizarro 001 (IEEE Trans. Pattern Anal. Mach. Intell., 2015)

Recognition of Digital Polyhedra with a Fixed Number of Faces. - Yan Gérard (DGCI, 2016)

Tight bounds in the quadtree complexity theorem and the maximal number of pixels crossed by a curve of given length. - Yan Gérard; Antoine Vacavant; Jean-Marie Favreau (Theor. Comput. Sci., 2016)

Recognition of Digital Polyhedra with a Fixed Number of Faces Is Decidable in Dimension 3. - Yan Gérard (DGCI, 2017)

About the Decidability of Polyhedral Separability in the Lattice ℤd - Recognizing Digital Polyhedra with a Prescribed Number of Faces. - Yan Gerard (J. Math. Imaging Vis., 2017)

Peeling Digital Potatoes. - Loïc Crombez; Guilherme Dias da Fonseca; Yan Gerard (CCCG, 2019)

Efficient Algorithms to Test Digital Convexity. - Loïc Crombez; Guilherme Dias da Fonseca; Yan Gérard (DGCI, 2019)

Convex Aggregation Problems in mathbb Z^2. - Yan Gérard (DGCI, 2019)

Regular switching components. - Yan Gerard (Theor. Comput. Sci., 2019)

Efficiently Testing Digital Convexity and Recognizing Digital Convex Polygons. - Loïc Crombez; Guilherme Dias da Fonseca; Yan Gerard (J. Math. Imaging Vis., 2020)

Shadoks Approach to Low-Makespan Coordinated Motion Planning (CG Challenge). - Loïc Crombez; Guilherme Dias da Fonseca; Yan Gerard; Aldo Gonzalez-Lorenzo; Pascal Lafourcade 001; Luc Libralesso (SoCG, 2021)

Efficient Algorithms for Battleship. - Loïc Crombez; Guilherme Dias da Fonseca; Yan Gerard (FUN, 2021)

Shadoks Approach to Minimum Partition into Plane Subgraphs (CG Challenge). - Loïc Crombez; Guilherme Dias da Fonseca; Yan Gerard; Aldo Gonzalez-Lorenzo (SoCG, 2022)

Complexity Results on Untangling Planar Rectilinear Red-Blue Matchings. - Arun Kumar Das 001; Sandip Das 001; Guilherme Dias da Fonseca; Yan Gerard; Bastien Rivier (CoRR, 2022)

About the Reconstruction of Convex Lattice Sets from One or Two X-rays. - Yan Gerard (CoRR, 2022)

Reconstruction of Convex Sets from One or Two X-rays. - Yan Gerard (Fundam. Informaticae, 2022)

Greedy and Local Search Heuristics to Build Area-Optimal Polygons. - Loïc Crombez; Guilherme Dias da Fonseca; Yan Gerard (ACM J. Exp. Algorithmics, 2022)

Shadoks Approach to Low-Makespan Coordinated Motion Planning. - Loïc Crombez; Guilherme Dias da Fonseca; Yan Gerard; Aldo Gonzalez-Lorenzo; Pascal Lafourcade 001; Luc Libralesso (ACM J. Exp. Algorithmics, 2022)

Lost in the Grid. - Yan Gerard (2023)

On the Longest Flip Sequence to Untangle Segments in the Plane. - Guilherme Dias da Fonseca; Yan Gerard; Bastien Rivier (WALCOM, 2023)

The Calissons Puzzle. - Jean-Marie Favreau; Yan Gerard; Pascal Lafourcade 001; Léo Robert (CoRR, 2023)

Complexity results on untangling red-blue matchings. - Arun Kumar Das 001; Sandip Das 001; Guilherme Dias da Fonseca; Yan Gerard; Bastien Rivier (Comput. Geom., 2023)

Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring. - Loïc Crombez; Guilherme Dias da Fonseca; Florian Fontan; Yan Gerard; Aldo Gonzalez-Lorenzo; Pascal Lafourcade 001; Luc Libralesso; Benjamin Momège; Jack Spalding-Jamieson; Brandon Zhang; Da Wei Zheng (ACM J. Exp. Algorithmics, 2023)

Shadoks Approach to Knapsack Polygonal Packing (CG Challenge). - Guilherme Dias da Fonseca; Yan Gerard (SoCG, 2024)

The Canadian Traveller Problem on Outerplanar Graphs. - Laurent Beaudou; Pierre Bergé; Vsevolod Chernyshev; Antoine Dailly; Yan Gerard; Aurélie Lagoutte; Vincent Limouzy; Lucas Pastor (MFCS, 2024)

Short Flip Sequences to Untangle Segments in the Plane. - Guilherme Dias da Fonseca; Yan Gerard; Bastien Rivier (WALCOM, 2024)

Shadoks Approach to Knapsack Polygonal Packing. - Guilherme Dias da Fonseca; Yan Gerard (CoRR, 2024)

Untangling Segments in the Plane. - Guilherme Dias da Fonseca; Yan Gerard; Bastien Rivier (CoRR, 2025)