Yan Gérard | DeepAI

DeepAI AI Chat

Featured Co-authors

Sandip Das
23 publications
Guilherme D. da Fonseca
15 publications
Pascal Lafourcade
10 publications
Da Wei Zheng
8 publications
Luc Libralesso
7 publications
Loïc Crombez
6 publications
Florian Fontan
5 publications
Jack Spalding-Jamieson
3 publications
Bastien Rivier
3 publications
Brandon Zhang
2 publications
Léo Robert
2 publications

∙ 07/05/2023

The Calissons Puzzle

In 2022, Olivier Longuet, a French mathematics teacher, created a game c...

0 Jean-Marie Favreau, et al. ∙

∙ 07/03/2023

Short Flip Sequences to Untangle Segments in the Plane

A (multi)set of segments in the plane may form a TSP tour, a matching, a...

0 Guilherme D. da Fonseca, et al. ∙

∙ 03/16/2023

Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring

CG:SHOP is an annual geometric optimization challenge and the 2022 editi...

0 Loïc Crombez, et al. ∙

∙ 11/15/2022

About the Reconstruction of Convex Lattice Sets from One or Two X-rays

We consider a class of problems of Discrete Tomography which has been de...

0 Yan Gérard, et al. ∙

∙ 10/21/2022

On the Longest Flip Sequence to Untangle Segments in the Plane

A set of segments in the plane may form a Euclidean TSP tour or a matchi...

0 Guilherme D. da Fonseca, et al. ∙

∙ 02/24/2022

Complexity Results on Untangling Red-Blue Matchings

Given a matching between n red points and n blue points by line segments...

0 Arun Kumar Das, et al. ∙

∙ 06/28/2021

Greedy and Local Search Heuristics to Build Area-Optimal Polygons

In this paper, we present our heuristic solutions to the problems of fin...

0 Loïc Crombez, et al. ∙

∙ 03/25/2021

Shadoks Approach to Low-Makespan Coordinated Motion Planning

This paper describes the heuristics used by the Shadoks team for the CG:...

0 Loïc Crombez, et al. ∙

∙ 04/15/2020

Efficient Algorithms for Battleship

We consider an algorithmic problem inspired by the Battleship game. In t...

0 Loïc Crombez, et al. ∙

∙ 01/15/2019

Efficient Algorithms to Test Digital Convexity

A set S ⊂Z^d is digital convex if conv(S) ∩Z^d = S, where conv(S) denote...

0 Loïc Crombez, et al. ∙

∙ 12/13/2018

Peeling Digital Potatoes

The potato-peeling problem (also known as convex skull) is a fundamental...

0 Loïc Crombez, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world