Loïc Crombez

Publication Activity (10 Years)

Years Active: 2018-2023
Publications (10 Years): 16

Top Topics

Digital Convexity

Greedy Heuristic

Top Venues

ACM J. Exp. Algorithmics

Publications

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 (2023)
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 (2023)
Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard
Greedy and Local Search Heuristics to Build Area-Optimal Polygons. ACM J. Exp. Algorithmics 27 (2022)
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 (2022)
Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo
Shadoks Approach to Minimum Partition into Plane Subgraphs (CG Challenge). SoCG (2022)
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)
Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard
Greedy and Local Search Heuristics to Build Area-Optimal Polygons. CoRR (2021)
Loïc Crombez
Digital Convex + Unimodular Mapping = 8-Connected (All Points but One 4-Connected). DGMM (2021)
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 (2021)
Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard
Efficient Algorithms for Battleship. FUN (2021)
Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard
Efficient Algorithms for Battleship. CoRR (2020)
Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard
Efficiently Testing Digital Convexity and Recognizing Digital Convex Polygons. J. Math. Imaging Vis. 62 (5) (2020)
Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard
Peeling Digital Potatoes. CCCG (2019)
Loïc Crombez, Guilherme Dias da Fonseca, Yan Gérard
Efficient Algorithms to Test Digital Convexity. CoRR (2019)
Loïc Crombez, Guilherme Dias da Fonseca, Yan Gérard
Efficient Algorithms to Test Digital Convexity. DGCI (2019)
Loïc Crombez, Guilherme Dias da Fonseca, Yan Gérard
Peeling Digital Potatoes. CoRR (2018)