Yan Gerard - RankMe

37 papers A* 3B 5C 1Misc 1Journal 23Unranked 3

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Lozenge Tiling by Computing Distances. CoRR Jean-Marie Favreau, Yan Gerard, Pascal Lafourcade, Léo Robert
2026	J	`jnl`	Nemesis, an Escape Game in Graphs. CoRR Pierre Bergé, Antoine Dailly, Yan Gerard
2026	J	`jnl`	Shadoks Approach to Parallel Reconfiguration of Triangulations. CoRR Guilherme Dias da Fonseca, Fabien Feschet, Yan Gerard
2025	B	`conf`	PACE Solver Description: Shadoks Approach to Minimum Hitting Set and Dominating Set. IPEC Guilherme Dias da Fonseca, Fabien Feschet, Yan Gerard
2025	—	`conf`	Tilepaint and Aquarium Puzzles in Periodic Grids. DGMM Yan Gerard, Pascal Lafourcade, Lola-Baie Mallordy, Léo Robert
2025	J	`jnl`	Untangling Segments in the Plane. CoRR Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier
2024	A*	`conf`	Shadoks Approach to Knapsack Polygonal Packing (CG Challenge). SoCG Guilherme Dias da Fonseca, Yan Gerard
2024	J	`jnl`	Shadoks Approach to Knapsack Polygonal Packing. CoRR Guilherme Dias da Fonseca, Yan Gerard
2024	B	`conf`	Short Flip Sequences to Untangle Segments in the Plane. WALCOM Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier
2024	B	`conf`	The Canadian Traveller Problem on Outerplanar Graphs. MFCS Laurent Beaudou, Pierre Bergé, Vsevolod Chernyshev, Antoine Dailly, Yan Gerard, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor
2024	J	`jnl`	The Canadian Traveller Problem on outerplanar graphs. CoRR Laurent Beaudou, Pierre Bergé, Vsevolod Chernyshev, Antoine Dailly, Yan Gerard, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor
2023	J	`jnl`	Complexity results on untangling red-blue matchings. Comput. Geom. Arun Kumar Das, Sandip Das, Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier
2023	J	`jnl`	Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring. CoRR 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
2023	J	`jnl`	Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring. ACM J. Exp. Algorithmics 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
2023	—	`book`	Lost in the Grid. Yan Gerard
2023	B	`conf`	On the Longest Flip Sequence to Untangle Segments in the Plane. WALCOM Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier
2023	J	`jnl`	Short Flip Sequences to Untangle Segments in the Plane. CoRR Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier
2023	J	`jnl`	The Calissons Puzzle. CoRR Jean-Marie Favreau, Yan Gerard, Pascal Lafourcade, Léo Robert
2022	J	`jnl`	About the Reconstruction of Convex Lattice Sets from One or Two X-rays. CoRR Yan Gerard
2022	J	`jnl`	Complexity Results on Untangling Planar Rectilinear Red-Blue Matchings. CoRR Arun Kumar Das, Sandip Das, Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier
2022	B	`conf`	Complexity Results on Untangling Red-Blue Matchings. LATIN Arun Kumar Das, Sandip Das, Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier
2022	J	`jnl`	Greedy and Local Search Heuristics to Build Area-Optimal Polygons. ACM J. Exp. Algorithmics Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard
2022	J	`jnl`	On the Longest Flip Sequence to Untangle Segments in the Plane. CoRR Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier
2022	J	`jnl`	Reconstruction of Convex Sets from One or Two X-rays. Fundam. Informaticae Yan Gerard
2022	J	`jnl`	Shadoks Approach to Low-Makespan Coordinated Motion Planning. ACM J. Exp. Algorithmics Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso
2022	A*	`conf`	Shadoks Approach to Minimum Partition into Plane Subgraphs (CG Challenge). SoCG Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo
2021	Misc	`conf`	Efficient Algorithms for Battleship. FUN Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard
2021	J	`jnl`	Greedy and Local Search Heuristics to Build Area-Optimal Polygons. CoRR Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard
2021	A*	`conf`	Shadoks Approach to Low-Makespan Coordinated Motion Planning (CG Challenge). SoCG Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso
2021	J	`jnl`	Shadoks Approach to Low-Makespan Coordinated Motion Planning. CoRR Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso
2020	J	`jnl`	Efficient Algorithms for Battleship. CoRR Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard
2020	J	`jnl`	Efficiently Testing Digital Convexity and Recognizing Digital Convex Polygons. J. Math. Imaging Vis. Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard
2019	—	`conf`	Peeling Digital Potatoes. CCCG Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard
2019	J	`jnl`	Regular switching components. Theor. Comput. Sci. Yan Gerard
2017	J	`jnl`	About the Decidability of Polyhedral Separability in the Lattice ℤ J. Math. Imaging Vis. Yan Gerard
2014	—	`conf`	About the Maximum Cardinality of the Digital Cover of a Curve with a Given Length. DGCI Yan Gerard, Antoine Vacavant
2013	C	`conf`	Elementary algorithms for multiresolution geometric tomography with strip model of projections. ISPA Yan Gerard