Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization. - Edouard Bonnet; Bruno Escoffier; Vangelis Th. Paschos; Emeric Tourniaire (IPEC, 2013)

Problèmes NP-difficiles : approximation modérément exponentielle et complexité paramétrique. (NP-Hard problems : moderately exponential approximation and parameterized complexity). - Emeric Tourniaire (2013)

Approximating MAX SAT by moderately exponential and parameterized algorithms. - Bruno Escoffier; Vangelis Th. Paschos; Emeric Tourniaire (Theor. Comput. Sci., 2014)

Multi-parameter Analysis for Local Graph Partitioning Problems: Using Greediness for Parameterization. - Edouard Bonnet; Bruno Escoffier; Vangelis Th. Paschos; Emeric Tourniaire (Algorithmica, 2015)

Super-polynomial approximation branching algorithms. - Bruno Escoffier; Vangelis Th. Paschos; Emeric Tourniaire (RAIRO Oper. Res., 2016)