Luc Libralesso
Orcid: 0000-0001-9908-4811
According to our database1,
Luc Libralesso
authored at least 16 papers
between 2012 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Triangle width problem: at the intersection of graph theory, scheduling, and matrix visualization.
Ann. Oper. Res., June, 2024
2023
Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring.
ACM J. Exp. Algorithmics, December, 2023
2022
Minimizing makespan under data prefetching constraints for embedded vision systems: a study of optimization methods and their performance.
Oper. Res., 2022
ACM J. Exp. Algorithmics, 2022
Inf. Comput., 2022
Eur. J. Oper. Res., 2022
Local Search with Weighting Schemes for the CG: SHOP 2022 Competition (CG Challenge).
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.
Eur. J. Oper. Res., 2021
Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021
Proceedings of the 37th International Symposium on Computational Geometry, 2021
2020
Anytime tree search for combinatorial optimization. (Recherches arborescentes anytime pour l'optimisation combinatoire).
PhD thesis, 2020
Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020
2019
2012
Low temperature direct bonding: An attractive technique for heterostructures build-up.
Microelectron. Reliab., 2012