research
∙
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...
share
research
∙
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...
research
∙
03/25/2021
Shadoks Approach to Low-Makespan Coordinated Motion Planning
This paper describes the heuristics used by the Shadoks team for the CG:...
research
∙
04/15/2020
Efficient Algorithms for Battleship
We consider an algorithmic problem inspired by the Battleship game. In t...
research
∙
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...
research
∙
12/13/2018
