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)Dernières Publications
Antoine Dailly, Florent Foucaud, Anni Hakanen - 2 avril 2026
Algorithms and hardness for Metric Dimension on digraphs
Journal of Computer and System Sciences
Nicolas Michinov, Sacha Drouet, Anthony Cherbonnier, Eric Jamet, Marinette Bouet, Vincent Mazenod, Albane Pechard, Farouk Toumani, Zineddine Zahouani, Estelle Michinov - 1 mai 2026
Facilitating group work through collaboration instructions using a digital environment
Acta Psychologica
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
Dipayan Chakraborty, Florent Foucaud, Michael Henning - 15 juin 2026
Identifying open codes in trees and 4-cycle-free graphs of given maximum degree
Discrete Applied Mathematics
Quentin Bramas, Stéphane Devismes, Anaïs Durand, Pascal Lafourcade, Anissa Lamani - 1 septembre 2026
Optimal asynchronous perpetual finite grid exploration
Theoretical Computer Science
Algorithms and hardness for Metric Dimension on digraphs
Journal of Computer and System Sciences
Nicolas Michinov, Sacha Drouet, Anthony Cherbonnier, Eric Jamet, Marinette Bouet, Vincent Mazenod, Albane Pechard, Farouk Toumani, Zineddine Zahouani, Estelle Michinov - 1 mai 2026
Facilitating group work through collaboration instructions using a digital environment
Acta Psychologica
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
Dipayan Chakraborty, Florent Foucaud, Michael Henning - 15 juin 2026
Identifying open codes in trees and 4-cycle-free graphs of given maximum degree
Discrete Applied Mathematics
Quentin Bramas, Stéphane Devismes, Anaïs Durand, Pascal Lafourcade, Anissa Lamani - 1 septembre 2026
Optimal asynchronous perpetual finite grid exploration
Theoretical Computer Science