Université Claude Bernard Lyon 1
Talks (selection):
- Complexity Dichotomies for the Minimum F-Overlay Problem
- Resiliency problems: algorithms and applications, RHUL CS Dept. Seminar, January 10th 2017, London, UK [Slides]
- Resiliency Policies in Access Control Revisited,
SACMAT 2016, June 6-8 2016, Shanghai, China
- On a Parameterized Problem in Access Control,
- Multidimensional Binary Vector Assignment Problem,
FCT 2015, August 17-19, 2015, Gdansk, Poland. [slides]
- Cardinality-Constrained Subgraph Problems,
ELC Workshop on Parameterized Algorithms, Feb 28 - Mar 01, 2015, Tokyo, Japan. [slides]
- Complexité Paramétrée de Problèmes de Compaction de Graphes,
Journées Graphes et Algorithmes, November 13-15, 2013, Orsay, France. [slides]
- Approximating the Sparsest k-Subgraph in Chordal Graphs,
Workshop on Approximation and Online Algorithms, September 5-6, 2013, Sophia-Antipolis, France. [slides]
- Finding a Sparse k-Subgraph in Restricted Graph Classes
- Sum-Max Graph Partitioning Problem
- Kernel Lower Bound for the k-Domatic Partition Problem,
Réunion du projet Algorithmes Paramétrés et Exponentiels (AGAPE), February 6-10, 2012, Montpellier, France. [slides]
- Bornes Inférieures pour la Kernelization,
Séminaire AlGCo, May 12, 2011, Montpellier, France. [slides]