-
Techniques combinatoires pour les algorithmes paramétrés et les noyaux, avec ...
This thesis tackles NP-hard problems with combinatorial techniques, focusing on the framework of Fixed-Parameter Tractability. Themain problems considered here are... -
Sub-Polyhedral Compilation using (Unit-)Two-Variables-Per-Inequality Polyhedra
The goal of this thesis is to design algorithms that run with better complexity when compiling or parallelizing loop programs. The framework within which our... -
Optimization problems with propagation in graphs : Parameterized complexity a...
In this thesis, we investigate the computational complexity of optimization problems involving a “diffusion process” in a graph. More specifically, we are first... -
Approximation algorithms for inventory control models
Inventory management has always been a major component of the field of operations research and numerous models derived from the industry aroused the interest of both...
