Loïc Crombez

Orcid: 0000-0002-9542-5276

According to our database1, Loïc Crombez authored at least 11 papers between 2019 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring.
ACM J. Exp. Algorithmics, December, 2023

2022
Shadoks Approach to Low-Makespan Coordinated Motion Planning.
ACM J. Exp. Algorithmics, 2022

Greedy and Local Search Heuristics to Build Area-Optimal Polygons.
ACM J. Exp. Algorithmics, 2022

Shadoks Approach to Minimum Partition into Plane Subgraphs (CG Challenge).
Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021
Finding Digital convexity. (Le monde de la Convexité DiscrèTE).
PhD thesis, 2021

Efficient Algorithms for Battleship.
Proceedings of the 10th International Conference on Fun with Algorithms, 2021

Digital Convex + Unimodular Mapping = 8-Connected (All Points but One 4-Connected).
Proceedings of the Discrete Geometry and Mathematical Morphology, 2021

Shadoks Approach to Low-Makespan Coordinated Motion Planning (CG Challenge).
Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020
Efficiently Testing Digital Convexity and Recognizing Digital Convex Polygons.
J. Math. Imaging Vis., 2020

2019
Efficient Algorithms to Test Digital Convexity.
Proceedings of the Discrete Geometry for Computer Imagery, 2019

Peeling Digital Potatoes.
Proceedings of the 31st Canadian Conference on Computational Geometry, 2019


  Loading...