Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Loïc Crombez

dblp:232/2245 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2022
0000-0002-9542-5276ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 2 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Computational geometry · 47% Graph algorithms and graph theory · 46% Mathematical optimization · 6%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Graph algorithms and graph theory
graph partitioning		 0.612022
Shadoks Approach to Minimum Partition into Plane Subgraphs (CG Challenge) · SoCG 2022
Graph algorithms and graph theory › graph partitioning
minimum partition into plane subgraphs		 0.612022
Shadoks Approach to Minimum Partition into Plane Subgraphs (CG Challenge) · SoCG 2022
Computational geometry › motion planning
coordinated motion planning		 0.512021
Shadoks Approach to Low-Makespan Coordinated Motion Planning (CG Challenge) · SoCG 2021
Computational geometry
motion planning		 0.512021
Shadoks Approach to Low-Makespan Coordinated Motion Planning (CG Challenge) · SoCG 2021
Computational geometry
geometric graph		 0.212022
Shadoks Approach to Minimum Partition into Plane Subgraphs (CG Challenge) · SoCG 2022
Mathematical optimization
heuristic optimization		 0.112021
Shadoks Approach to Low-Makespan Coordinated Motion Planning (CG Challenge) · SoCG 2021

Methods — techniques the papers use, named apart from their topics

heuristic search · 0.5
YearPublicationVenuePosition
2022 Shadoks Approach to Minimum Partition into Plane Subgraphs (CG Challenge)
abstract
International audience
Loïc Crombez, Guilherme Dias da Fonseca, Yan Gérard, Aldo Gonzalez-Lorenzo
 SoCG1
2021 Shadoks Approach to Low-Makespan Coordinated Motion Planning (CG Challenge)
abstract
This paper describes the heuristics used by the Shadoks team for the CG:SHOP 2021 challenge on motion planning. Using the heuristics outlined in this paper, our team won first place with the best solution to 202 out of 203 instances and optimal solutions to at least 105 of them.
Loïc Crombez, Guilherme Dias da Fonseca, Yan Gérard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade 0001, Luc Libralesso
 SoCG1