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)Soutenances de thèses
|
Arun RAVEENDRAN NAIR SHEELA - 13 novembre 2026 14:00 - Salle A102 Hybridization of Description Logics and Logic Programming for the Aeronautics Domain |
|
Valentin GUIEN - 19 novembre 2026 09:00 - Amphi 3 - Pôle commun Détection automatique d'anomalies dans le rythme circadien d'animaux laitiers |
Dernières Publications
Xavier Boucher, Sébastien Saetta, Cemre Gunes Şengül-Vautier, Johanna Clerc, Magali Coldefy, Loïc Rohr, Yvonne Quenum, Eric Fakra - 17 septembre 2026
Reducing seclusion and mechanical restraint: a systemic and decision-oriented framework for mental health services
Mental Health Review Journal
Florent Foucaud, Atrayee Majumder, Tobias Mömke, Aida Roshany-Tabrizi - 21 octobre 2026
Polynomial-time algorithms for Path Cover and Path Partition on trees and graphs of bounded treewidth
Theoretical Computer Science
Florent Foucaud, Arti Pandey, Kaustav Paul - 15 août 2026
Characterizing optimal monitoring edge-geodetic sets for some structured graph classes
Discrete Applied Mathematics
Valentin Guien, Violaine Antoine, Luis E C Rocha, Romain Lardy, Isabelle Veissier - 19 septembre 2027
Understanding Specific Cows’ Behavior Through Cows’ Activity
Lecture Notes in Computer Science
Carlos Fernandez Hernandez, Christelle Caillouet, Alexandre Guitton, Oana Iova, Fabrice Valois - 1 octobre 2026
Closing the gap between the things network and the optimal downlink scheduler
Computer Communications
Reducing seclusion and mechanical restraint: a systemic and decision-oriented framework for mental health services
Mental Health Review Journal
Florent Foucaud, Atrayee Majumder, Tobias Mömke, Aida Roshany-Tabrizi - 21 octobre 2026
Polynomial-time algorithms for Path Cover and Path Partition on trees and graphs of bounded treewidth
Theoretical Computer Science
Florent Foucaud, Arti Pandey, Kaustav Paul - 15 août 2026
Characterizing optimal monitoring edge-geodetic sets for some structured graph classes
Discrete Applied Mathematics
Valentin Guien, Violaine Antoine, Luis E C Rocha, Romain Lardy, Isabelle Veissier - 19 septembre 2027
Understanding Specific Cows’ Behavior Through Cows’ Activity
Lecture Notes in Computer Science
Carlos Fernandez Hernandez, Christelle Caillouet, Alexandre Guitton, Oana Iova, Fabrice Valois - 1 octobre 2026
Closing the gap between the things network and the optimal downlink scheduler
Computer Communications