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)Keynotes à venir
|
Bernardo Subercaseaux - Carnegie Mellon University, US - 13 mai 2026 14:00 - salle A002 Breaking down graphs and hypergraphs into structured pieces, optimally and efficiently |
|
Séminaires à venir
|
Wesley Coelho and Victor Onofre - Pasqal - 28 mai 2026 09:00 - Salle A104 Quantum Computing with Neutral Atoms |
Soutenances de thèses
|
Hélène TOUSSAINT - 13 mai 2026 10:00 - Amphi 3 - Pôle commun Méthodes et Algorithmes en Optimisation Combinatoire |
Dernières Publications
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
Victor Charpenay, Mansour Zoubeirou a Mayaki, Antoine Zimmermann - 31 mars 2026
On the Computational Cost of Knowledge Graph Embeddings
Transactions on Graph Data and Knowledge
Dipayan Chakraborty, Florent Foucaud, Michael Henning, Tuomo Lehtilä - 1 février 2026
Identifying codes in graphs of given maximum degree: Characterizing trees
Discrete Mathematics
Ali Abbassi, Yann Dujardin, Eric Gourdin, Philippe Lacomme, Caroline Prodhon - 14 janvier 2026
Assessing Quantum Annealing to solve the Minimum vertex multicut
Psykhe (Santiago)
Hassan Maatouk, Didier Rullière, Xavier Bay - 19 mars 2026
Truncated multivariate normal distribution under linear and nonlinear constraints
Technometrics
A note on partitioning the vertex set of a graph into a dominating set and a locating dominating set
The Electronic Journal of Combinatorics
Victor Charpenay, Mansour Zoubeirou a Mayaki, Antoine Zimmermann - 31 mars 2026
On the Computational Cost of Knowledge Graph Embeddings
Transactions on Graph Data and Knowledge
Dipayan Chakraborty, Florent Foucaud, Michael Henning, Tuomo Lehtilä - 1 février 2026
Identifying codes in graphs of given maximum degree: Characterizing trees
Discrete Mathematics
Ali Abbassi, Yann Dujardin, Eric Gourdin, Philippe Lacomme, Caroline Prodhon - 14 janvier 2026
Assessing Quantum Annealing to solve the Minimum vertex multicut
Psykhe (Santiago)
Hassan Maatouk, Didier Rullière, Xavier Bay - 19 mars 2026
Truncated multivariate normal distribution under linear and nonlinear constraints
Technometrics