Florian Fontan

According to our database, Florian Fontan authored at least 6 papers between 2020 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2024

Triangle width problem: at the intersection of graph theory, scheduling, and matrix visualization.

Khadija Hadj Salem, Luc Libralesso, Vincent Jost, Florian Fontan, Frédéric Maffray

Ann. Oper. Res., June, 2024

2023

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

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

ACM J. Exp. Algorithmics, December, 2023

2022

Innovative ideas for teaching supports: Application to Graph theory.

Nicolas Catusse, Hadrien Cambazard, Nadia Brauner, Bernard Penz, Florian Fontan

CoRR, 2022

Local Search with Weighting Schemes for the CG: SHOP 2022 Competition (CG Challenge).

Florian Fontan, Pascal Lafourcade, Luc Libralesso, Benjamin Momège

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021

An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem.

Luc Libralesso, Florian Fontan

Eur. J. Oper. Res., 2021

2020

PackingSolver: a solver for Packing Problems.

Florian Fontan, Luc Libralesso

CoRR, 2020