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)Offres d'emplois
Dernières Publications
Sandip Das, Florent Foucaud, Sk Samim Islam, Joydeep Mukherjee - 15 juin 2026
Relation between broadcast domination and multipacking numbers on chordal and other hyperbolic graphs
Discrete Applied Mathematics
Anthony Bertrand, Engelbert Mephu Nguifo, Violaine Antoine, David Hill - 2 avril 2026
A K-Means, Ward and DBSCAN Repeatability Study
Cloud Computing and Data Science
Quentin Bramas, Stéphane Devismes, Anaïs Durand, Pascal Lafourcade, Anissa Lamani - 1 septembre 2026
Optimal asynchronous perpetual finite grid exploration
Theoretical Computer Science
Dibyayan Chakraborty, Sandip Das, Florent Foucaud, Harmender Gahlawat, Dimitri Lajou - 28 avril 2026
Algorithms and complexity for geodetic sets on interval and chordal graphs
Information and Computation
Dipayan Chakraborty, Florent Foucaud, Michael Henning, Tuomo Lehtilä - 31 mars 2026
Identifying codes in triangle-free graphs of bounded maximum degree
Journal of Graph Theory
Relation between broadcast domination and multipacking numbers on chordal and other hyperbolic graphs
Discrete Applied Mathematics
Anthony Bertrand, Engelbert Mephu Nguifo, Violaine Antoine, David Hill - 2 avril 2026
A K-Means, Ward and DBSCAN Repeatability Study
Cloud Computing and Data Science
Quentin Bramas, Stéphane Devismes, Anaïs Durand, Pascal Lafourcade, Anissa Lamani - 1 septembre 2026
Optimal asynchronous perpetual finite grid exploration
Theoretical Computer Science
Dibyayan Chakraborty, Sandip Das, Florent Foucaud, Harmender Gahlawat, Dimitri Lajou - 28 avril 2026
Algorithms and complexity for geodetic sets on interval and chordal graphs
Information and Computation
Dipayan Chakraborty, Florent Foucaud, Michael Henning, Tuomo Lehtilä - 31 mars 2026
Identifying codes in triangle-free graphs of bounded maximum degree
Journal of Graph Theory