Presentation
The Laboratory of Informatics, Modelling and Optimization of the Systems (LIMOS) is a Mixed Unit of Research (UMR 6158) in computing, and more generally in Sciences and Technologies of information and the Communication ( STIC).
(read more)last publications
Victor Charpenay, Mansour Zoubeirou a Mayaki, Antoine Zimmermann - March 31, 2026
On the Computational Cost of Knowledge Graph Embeddings
Transactions on Graph Data and Knowledge
Dipayan Chakraborty, Florent Foucaud, Michael Antony Henning, Tero Laihonen - March 13, 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
Karim Terfasse, Ghassen Cherif, Marie-José Huguet - Feb. 23, 2026
A path planning heuristic for automated guided vehicles in container terminals
RAIRO - Operations Research
Ali Abbassi, Yann Dujardin, Eric Gourdin, Philippe Lacomme, Caroline Prodhon - Jan. 1, 2026
Quantum Approaches to the Minimum Edge Multiway Cut Problem
Communications in Computer and Information Science (CCIS)
Dipayan Chakraborty, Florent Foucaud, Michael Henning - June 15, 2026
Identifying open codes in trees and 4-cycle-free graphs of given maximum degree
Discrete Applied Mathematics
On the Computational Cost of Knowledge Graph Embeddings
Transactions on Graph Data and Knowledge
Dipayan Chakraborty, Florent Foucaud, Michael Antony Henning, Tero Laihonen - March 13, 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
Karim Terfasse, Ghassen Cherif, Marie-José Huguet - Feb. 23, 2026
A path planning heuristic for automated guided vehicles in container terminals
RAIRO - Operations Research
Ali Abbassi, Yann Dujardin, Eric Gourdin, Philippe Lacomme, Caroline Prodhon - Jan. 1, 2026
Quantum Approaches to the Minimum Edge Multiway Cut Problem
Communications in Computer and Information Science (CCIS)
Dipayan Chakraborty, Florent Foucaud, Michael Henning - June 15, 2026
Identifying open codes in trees and 4-cycle-free graphs of given maximum degree
Discrete Applied Mathematics