Présentation
Le Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes (LIMOS) est une Unité Mixte de Recherche (UMR 6158) en informatique, et plus généralement en Sciences et Technologies de l'Information et de la Communication (STIC).
(lire la suite)Séminaires à venir
|
Bernardo Subercaseaux - Chili - 13 mai 2026 14:00 - salle A002 Breaking down graphs and hypergraphs into structured pieces, optimally and efficiently |
|
Wesley Coelho and Victor Onofre - Pasqal - 28 mai 2026 09:00 - Salle A104 Quantum Computing with Neutral Atoms |
Dernières Publications
Pablo García Gómez, Stéphane Dauzère-Pérès, Camino Vela, Inés González-Rodríguez - 1 février 2026
New bounds for move evaluation in the flexible job-shop scheduling problem
Computers & Industrial Engineering
Michael Franklin Mbouopda, Emille E.O. Ishida, Engelbert Mephu Nguifo, Emmanuel Gangler - 1 janvier 2026
Explainable classification of astronomical uncertain time series
Big Data Research
Florent Foucaud, Arti Pandey, Kaustav Paul - 15 août 2026
Characterizing optimal monitoring edge-geodetic sets for some structured graph classes
Discrete Applied Mathematics
Dipayan Chakraborty, Florent Foucaud, Michael Antony Henning, Tero Laihonen - 13 mars 2026
A note on partitioning the vertex set of a graph into a dominating set and a locating dominating set
The Electronic Journal of Combinatorics
Florent Foucaud, Paras Vinubhai Maniya, Kaustav Paul, Dinabandhu Pradhan - 1 mars 2026
Locating-dominating partitions for some classes of graphs
Discrete Mathematics
New bounds for move evaluation in the flexible job-shop scheduling problem
Computers & Industrial Engineering
Michael Franklin Mbouopda, Emille E.O. Ishida, Engelbert Mephu Nguifo, Emmanuel Gangler - 1 janvier 2026
Explainable classification of astronomical uncertain time series
Big Data Research
Florent Foucaud, Arti Pandey, Kaustav Paul - 15 août 2026
Characterizing optimal monitoring edge-geodetic sets for some structured graph classes
Discrete Applied Mathematics
Dipayan Chakraborty, Florent Foucaud, Michael Antony Henning, Tero Laihonen - 13 mars 2026
A note on partitioning the vertex set of a graph into a dominating set and a locating dominating set
The Electronic Journal of Combinatorics
Florent Foucaud, Paras Vinubhai Maniya, Kaustav Paul, Dinabandhu Pradhan - 1 mars 2026
Locating-dominating partitions for some classes of graphs
Discrete Mathematics