GERARD - Yan
Toutes les publications (20)
Date/Type | Titre/URL/journal | Domaines | Notes SJR/Core | Cit. GScholar |
---|---|---|---|---|
2024
COMM |
Laurent Beaudou, Pierre Bergé, Vsevolod Chernyshev, Antoine Dailly, Yan Gerard, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor
The Canadian Traveller Problem on Outerplanar Graphs Mathematical Foundations of Computer Science (MFCS) - 2024 |
Informatique/Algorithme et structure de données | ||
2024
COMM |
Guilherme D. da Fonseca, Yan Gerard
Shadoks Approach to Knapsack Polygonal Packing (CG Challenge) 40th International Symposium on Computational Geometry (SoCG 2024) - 2024 |
|||
2024
COMM |
Guilherme da Fonseca, Yan Gerard, Bastien Rivier
Short Flip Sequences to Untangle Segments in the Plane ⋆ WALCOM 2024 - 2024 |
|||
2024
REPORT |
Laurent Beaudou, Pierre Bergé, Vsevolod Chernyshev, Antoine Dailly, Yan Gerard, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor
The Canadian Traveller Problem on outerplanar graphs |
|||
2023
HDR |
Yan Gerard
Lost in the Grid |
|||
2023
ART |
Yan Gerard
Reconstruction of Convex Sets from One or Two X-rays Fundamenta Informaticae - 2023 |
|||
2023
ART |
Arun Kumar Das, Sandip Das, Guilherme da Fonseca, Yan Gerard, Bastien Rivier
Complexity results on untangling red-blue matchings Computational Geometry - 2023 |
|||
2023
ART |
Loïc Crombez, Guilherme 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 Journal of Experimental Algorithmics - 2023 |
|||
2023
COMM |
Guilherme da Fonseca, Yan Gerard, Bastien Rivier
On the Longest Flip Sequence to Untangle Segments in the Plane WALCOM 17th International Conference and Workshops on Algorithms and Computation - 2023 |
|||
2022
ART |
Loïc Crombez, Guilherme D da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso
Shadoks Approach to Low-Makespan Coordinated Motion Planning ACM Journal of Experimental Algorithmics - 2022 |
|||
2022
COMM |
Arun Kumar Das, Sandip Das, Guilherme D. da Fonseca, Yan Gerard, Bastien Rivier
Complexity Results on Untangling Red-Blue Matchings LATIN 2022 - 2022 |
|||
2022
COMM |
Loïc Crombez, Guilherme D da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo
Shadoks Approach to Minimum Partition into Plane Subgraphs 38th International Symposium on Computational Geometry (SoCG 2022) - 2022 |
|||
2022
UNDEFINED |
Arun Kumar Das, Sandip Das, Guilherme D. da Fonseca, Yan Gerard, Bastien Rivier
Complexity Results on Untangling Planar Rectilinear Red-Blue Matchings |
Informatique/Géométrie algorithmique | ||
2022
ART |
Loïc Crombez, Guilherme D da Fonseca, Yan Gerard
Greedy and Local Search Heuristics to Build Area-Optimal Polygons ACM Journal of Experimental Algorithmics - 2022 |
Informatique/Géométrie algorithmique | ||
2019
PROCEEDINGS |
Yan Gerard, Loïc Crombez, Guilherme da Fonseca
Peeling Digital Potatoes |
|||
2019
COMM |
Loïc Crombez, Guilherme da Fonseca, Yan Gerard
Efficient Algorithms to Test Digital Convexity 21st IAPR International Conference on Discrete Geometry for Computer Imagery, DGCI 2019 - 2019 |
Informatique/Géométrie algorithmique | ||
2018
UNDEFINED |
Yan Gerard
Polynomial Time Reconstruction of Regular Convex Lattice Sets from their Horizontal and Vertical X-Rays |
Informatique/Mathématique discrète | ||
2017
COMM |
Yan Gerard
Recognition of digital polyhedra with a fixed number of faces is decidable in dimension 3 20th IAPR International Conference on Discrete Geometry for Computer Imagery (DGCI 2017) - 2017 |
Informatique/Mathématique discrète | ||
2017
ART |
Yan Gerard
About the Decidability of Polyhedral Separability in the Lattice $\mathbb {Z}^d$ Journal of Mathematical Imaging and Vision - 2017 |
Informatique/Mathématique discrète | ||
2016
ART |
Yan Gerard, 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 Theoretical Computer Science - 2016 |
Informatique/Mathématique discrète |