default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLuc Libralesso
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Khadija Hadj Salem
, Luc Libralesso, Vincent Jost, Florian Fontan, Frédéric Maffray:
Triangle width problem: at the intersection of graph theory, scheduling, and matrix visualization. Ann. Oper. Res. 337(2): 715-730 (2024)- 2023
- [j8]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:
Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring. ACM J. Exp. Algorithmics 28: 1.2:1-1.2:13 (2023) - [i6]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:
Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring. CoRR abs/2303.09632 (2023) - 2022
- [j7]Luc Libralesso, Pablo Andres Focke, Aurélien Secardin, Vincent Jost:
Iterative beam search algorithms for the permutation flowshop. Eur. J. Oper. Res. 301(1): 217-234 (2022) - [j6]Léo Robert, Daiki Miyahara, Pascal Lafourcade, Luc Libralesso, Takaaki Mizuki:
Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle. Inf. Comput. 285(Part): 104858 (2022) - [j5]Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso:
Shadoks Approach to Low-Makespan Coordinated Motion Planning. ACM J. Exp. Algorithmics 27: 3.2:1-3.2:17 (2022) - [j4]Khadija Hadj Salem, Vincent Jost, Yann Kieffer, Luc Libralesso, Stéphane Mancini:
Minimizing makespan under data prefetching constraints for embedded vision systems: a study of optimization methods and their performance. Oper. Res. 22(3): 1639-1673 (2022) - [c4]Florian Fontan, Pascal Lafourcade, Luc Libralesso, Benjamin Momège:
Local Search with Weighting Schemes for the CG: SHOP 2022 Competition (CG Challenge). SoCG 2022: 73:1-73:6 - 2021
- [j3]Luc Libralesso, Florian Fontan:
An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem. Eur. J. Oper. Res. 291(3): 883-893 (2021) - [c3]Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso:
Shadoks Approach to Low-Makespan Coordinated Motion Planning (CG Challenge). SoCG 2021: 63:1-63:9 - [c2]Luc Libralesso, François Delobel, Pascal Lafourcade, Christine Solnon:
Automatic Generation of Declarative Models For Differential Cryptanalysis. CP 2021: 40:1-40:18 - [i5]Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso:
Shadoks Approach to Low-Makespan Coordinated Motion Planning. CoRR abs/2103.13956 (2021) - 2020
- [b1]Luc Libralesso:
Anytime tree search for combinatorial optimization. (Recherches arborescentes anytime pour l'optimisation combinatoire). Grenoble Alpes University, France, 2020 - [c1]Luc Libralesso, Abdel-Malik Bouhassoun, Hadrien Cambazard, Vincent Jost:
Tree Search for the Sequential Ordering Problem. ECAI 2020: 459-465 - [i4]Luc Libralesso, Florian Fontan:
An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem. CoRR abs/2004.00963 (2020) - [i3]Florian Fontan, Luc Libralesso:
PackingSolver: a solver for Packing Problems. CoRR abs/2004.02603 (2020) - [i2]Luc Libralesso, Pablo Andres Focke, Aurélien Secardin, Vincent Jost:
Iterative beam search algorithms for the permutation flowshop. CoRR abs/2009.05800 (2020)
2010 – 2019
- 2019
- [j2]Nadia Brauner, Yves Crama, Etienne Delaporte, Vincent Jost, Luc Libralesso:
Do balanced words have a short period? Theor. Comput. Sci. 793: 169-180 (2019) - [i1]Luc Libralesso, Abdel-Malik Bouhassoun, Hadrien Cambazard, Vincent Jost:
Tree search algorithms for the Sequential Ordering Problem. CoRR abs/1911.12427 (2019) - 2012
- [j1]H. Moriceau, F. Rieutord, F. Fournel, Léa Di Cioccio, C. Moulet, Luc Libralesso, Pierric Gueguen, Rachid Taibi, C. Deguet:
Low temperature direct bonding: An attractive technique for heterostructures build-up. Microelectron. Reliab. 52(2): 331-341 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:08 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
