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
Séminaires thématiques à venir
|
ALCOLOCO - Yaping Mao - Qinghai Normal University, China - 4 septembre 2026 11:00 - salle A002 Introduction to Ramsey theory |
Dernières Publications
Antoine Dailly, Harmender Gahlawat, Zin Mar Myint - 15 octobre 2026
The Closed Geodetic Game: algorithms and strategies
Theoretical Computer Science
Khaled Medini, Julien de Benedittis, Thorsten Wuest, Mihaela Juganaru - 15 juin 2026
Operationalising agile manufacturing in the digital transformation era: towards a process-oriented, empirically grounded roadmap
International Journal of Productivity and Performance Management
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
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
Quentin Bramas, Stéphane Devismes, Anaïs Durand, Pascal Lafourcade, Anissa Lamani - 1 septembre 2026
Optimal asynchronous perpetual finite grid exploration
Theoretical Computer Science
The Closed Geodetic Game: algorithms and strategies
Theoretical Computer Science
Khaled Medini, Julien de Benedittis, Thorsten Wuest, Mihaela Juganaru - 15 juin 2026
Operationalising agile manufacturing in the digital transformation era: towards a process-oriented, empirically grounded roadmap
International Journal of Productivity and Performance Management
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
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
Quentin Bramas, Stéphane Devismes, Anaïs Durand, Pascal Lafourcade, Anissa Lamani - 1 septembre 2026
Optimal asynchronous perpetual finite grid exploration
Theoretical Computer Science