default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYan Gérard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c28]Guilherme Dias da Fonseca, Yan Gerard:
Shadoks Approach to Knapsack Polygonal Packing (CG Challenge). SoCG 2024: 84:1-84:9- [c27]Laurent Beaudou, Pierre Bergé, Vsevolod Chernyshev, Antoine Dailly, Yan Gerard, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor:
The Canadian Traveller Problem on Outerplanar Graphs. MFCS 2024: 19:1-19:16 - [c26]Guilherme Dias da Fonseca
, Yan Gerard, Bastien Rivier:
Short Flip Sequences to Untangle Segments in the Plane. WALCOM 2024: 163-178 - [i13]Laurent Beaudou, Pierre Bergé, Vsevolod Chernyshev, Antoine Dailly, Yan Gerard, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor:
The Canadian Traveller Problem on outerplanar graphs. CoRR abs/2403.01872 (2024) - [i12]Guilherme Dias da Fonseca, Yan Gerard:
Shadoks Approach to Knapsack Polygonal Packing. CoRR abs/2403.20123 (2024) - 2023
- [j20]Arun Kumar Das, Sandip Das, Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier:
Complexity results on untangling red-blue matchings. Comput. Geom. 111: 101974 (2023) - [j19]Loïc Crombez, Guilherme Dias da Fonseca, Florian Fontan, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso, Benjamin Momège, Jack Spalding-Jamieson, Brandon Zhang, Da Wei Zheng:
Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring. ACM J. Exp. Algorithmics 28: 1.2:1-1.2:13 (2023) - [c25]Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier:
On the Longest Flip Sequence to Untangle Segments in the Plane. WALCOM 2023: 102-112 - [i11]Loïc Crombez, Guilherme Dias da Fonseca, Florian Fontan, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso, Benjamin Momège, Jack Spalding-Jamieson, Brandon Zhang, Da Wei Zheng:
Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring. CoRR abs/2303.09632 (2023) - [i10]Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier:
Short Flip Sequences to Untangle Segments in the Plane. CoRR abs/2307.00853 (2023) - [i9]Jean-Marie Favreau, Yan Gerard, Pascal Lafourcade, Léo Robert:
The Calissons Puzzle. CoRR abs/2307.02475 (2023) - 2022
- [j18]Yan Gerard:
Reconstruction of Convex Sets from One or Two X-rays. Fundam. Informaticae 189(2): 113-143 (2022) - [j17]Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard:
Greedy and Local Search Heuristics to Build Area-Optimal Polygons. ACM J. Exp. Algorithmics 27: 2.2:1-2.2:11 (2022) - [j16]Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso:
Shadoks Approach to Low-Makespan Coordinated Motion Planning. ACM J. Exp. Algorithmics 27: 3.2:1-3.2:17 (2022) - [c24]Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo:
Shadoks Approach to Minimum Partition into Plane Subgraphs (CG Challenge). SoCG 2022: 71:1-71:8 - [c23]Arun Kumar Das, Sandip Das, Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier:
Complexity Results on Untangling Red-Blue Matchings. LATIN 2022: 730-745 - [i8]Arun Kumar Das, Sandip Das, Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier:
Complexity Results on Untangling Planar Rectilinear Red-Blue Matchings. CoRR abs/2202.11857 (2022) - [i7]Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier:
On the Longest Flip Sequence to Untangle Segments in the Plane. CoRR abs/2210.12036 (2022) - [i6]Yan Gerard:
About the Reconstruction of Convex Lattice Sets from One or Two X-rays. CoRR abs/2211.08091 (2022) - 2021
- [c22]Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso:
Shadoks Approach to Low-Makespan Coordinated Motion Planning (CG Challenge). SoCG 2021: 63:1-63:9 - [c21]Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard:
Efficient Algorithms for Battleship. FUN 2021: 11:1-11:15 - [i5]Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso:
Shadoks Approach to Low-Makespan Coordinated Motion Planning. CoRR abs/2103.13956 (2021) - [i4]Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard:
Greedy and Local Search Heuristics to Build Area-Optimal Polygons. CoRR abs/2106.14728 (2021) - 2020
- [j15]Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard:
Efficiently Testing Digital Convexity and Recognizing Digital Convex Polygons. J. Math. Imaging Vis. 62(5): 693-703 (2020) - [i3]Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard:
Efficient Algorithms for Battleship. CoRR abs/2004.07354 (2020)
2010 – 2019
- 2019
- [j14]Yan Gerard:
Regular switching components. Theor. Comput. Sci. 777: 338-355 (2019) - [c20]Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard:
Peeling Digital Potatoes. CCCG 2019: 124-132 - [c19]Loïc Crombez, Guilherme Dias da Fonseca, Yan Gérard:
Efficient Algorithms to Test Digital Convexity. DGCI 2019: 409-419 - [c18]Yan Gérard:
Convex Aggregation Problems in \mathbb Z^2. DGCI 2019: 432-443 - [i2]Loïc Crombez, Guilherme Dias da Fonseca, Yan Gérard:
Efficient Algorithms to Test Digital Convexity. CoRR abs/1901.04738 (2019) - 2018
- [i1]Loïc Crombez, Guilherme Dias da Fonseca, Yan Gérard:
Peeling Digital Potatoes. CoRR abs/1812.05410 (2018) - 2017
- [j13]Yan Gerard:
About the Decidability of Polyhedral Separability in the Lattice ℤd - Recognizing Digital Polyhedra with a Prescribed Number of Faces. J. Math. Imaging Vis. 59(1): 52-68 (2017) - [c17]Yan Gérard:
Recognition of Digital Polyhedra with a Fixed Number of Faces Is Decidable in Dimension 3. DGCI 2017: 279-290 - 2016
- [j12]Yan Gérard, Antoine Vacavant, Jean-Marie Favreau:
Tight bounds in the quadtree complexity theorem and the maximal number of pixels crossed by a curve of given length. Theor. Comput. Sci. 624: 41-55 (2016) - [c16]Yan Gérard:
Recognition of Digital Polyhedra with a Fixed Number of Faces. DGCI 2016: 415-426 - 2015
- [j11]Adrien Bartoli, Yan Gérard, François Chadebecq, Toby Collins, Daniel Pizarro:
Shape-from-Template. IEEE Trans. Pattern Anal. Mach. Intell. 37(10): 2099-2118 (2015) - 2014
- [j10]Laurent Provot, Yan Gérard, Fabien Feschet:
Digital Level Layers for Digital Curve Decomposition and Vectorization. Image Process. Line 4: 169-186 (2014) - [c15]Yan Gerard, Antoine Vacavant:
About the Maximum Cardinality of the Digital Cover of a Curve with a Given Length. DGCI 2014: 13-24 - 2013
- [c14]Yan Gerard:
Elementary algorithms for multiresolution geometric tomography with strip model of projections. ISPA 2013: 600-605 - 2012
- [c13]Adrien Bartoli, Yan Gérard, François Chadebecq, Toby Collins:
On template-based reconstruction from a single view: Analytical solutions and proofs of well-posedness for developable, isometric and conformal surfaces. CVPR 2012: 2026-2033 - 2011
- [c12]Yan Gérard, Laurent Provot, Fabien Feschet:
Introduction to Digital Level Layers. DGCI 2011: 83-94 - [c11]Laurent Provot, Yan Gérard:
Estimation of the Derivatives of a Digital Function with a Convergent Bounded Error. DGCI 2011: 284-295 - [c10]Laurent Provot, Yan Gérard:
Recognition of Digital Hyperplanes and Level Layers with Forbidden Points. IWCIA 2011: 144-156
2000 – 2009
- 2009
- [j9]Yan Gérard, David Coeurjolly, Fabien Feschet:
Gift-wrapping based preimage computation algorithm. Pattern Recognit. 42(10): 2255-2264 (2009) - [c9]Yan Gérard:
About the Complexity of Timetables and 3-Dimensional Discrete Tomography: A Short Proof of NP-Hardness. IWCIA 2009: 289-301 - 2008
- [c8]Yan Gérard, Fabien Feschet, David Coeurjolly:
Gift-Wrapping Based Preimage Computation Algorithm. DGCI 2008: 310-321 - [c7]Yan Gérard:
Reconstructing a Matrix with a Given List of Coefficients and Prescribed Row and Column Sums Is NP-Hard. IWCIA 2008: 363-371 - 2006
- [c6]Thibault Marzais, Yan Gérard, Rémy Malgouyres:
LP fitting approach for reconstructing parametric surfaces from points clouds. GRAPP 2006: 325-330 - [c5]Yan Gérard:
Additive Subsets. IWCIA 2006: 347-353 - 2005
- [j8]Yan Gérard, Isabelle Debled-Rennesson, Paul Zimmermann:
An elementary digital plane recognition algorithm. Discret. Appl. Math. 151(1-3): 169-183 (2005) - [j7]Yan Gérard, Fabien Feschet:
Application of a discrete tomography algorithm to computerized tomography. Electron. Notes Discret. Math. 20: 501-517 (2005) - [j6]Yan Gérard:
Reduction from three-dimensional discrete tomography to multicommodity flow problem. Theor. Comput. Sci. 346(2-3): 300-306 (2005) - [j5]Alain Daurat, Yan Gérard, Maurice Nivat:
Some necessary clarifications about the chords' problem and the Partial Digest Problem. Theor. Comput. Sci. 347(1-2): 432-436 (2005) - [c4]Fabien Feschet, Yan Gérard:
Computerized Tomography with Digital Lines and Linear Programming. DGCI 2005: 126-135 - 2004
- [j4]David Coeurjolly, Yan Gérard, Jean-Pierre Reveillès, Laure Tougne:
An elementary algorithm for digital arc segmentation. Discret. Appl. Math. 139(1-3): 31-50 (2004) - 2003
- [j3]Yan Gérard:
A fast and elementary algorithm for digital plane recognition. Electron. Notes Discret. Math. 12: 142-153 (2003) - 2002
- [j2]Alain Daurat, Yan Gérard, Maurice Nivat:
The chords' problem. Theor. Comput. Sci. 282(2): 319-336 (2002) - [j1]Yan Gérard:
Periodic graphs and connectivity of the rational digital hyperplanes. Theor. Comput. Sci. 283(1): 171-182 (2002) - 2001
- [c3]David Coeurjolly, Laure Tougne, Yan Gérard, Jean-Pierre Reveillès:
An elementary algorithm for digital arc segmentation. IWCIA 2001: 355-370 - 2000
- [c2]Yan Gérard:
A Question of Digital Linear Algebra. DGCI 2000: 126-136
1990 – 1999
- 1999
- [c1]Yan Gérard:
Local Configurations of Digital Hyperplanes. DGCI 1999: 65-75
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-27 21:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
