Ph.D. student in Computer Science
Talks:
- On Finding a Sparse Subgraph in Subclasses of Perfect Graphs,
1ères journées du GT-COA (Complexité et Algorithmes), November 21-22, 2012, Paris, France. [slides]
- The k-Sparsest Subgraph Problem on (Proper) Interval Graphs,
Séminaire AlGCo, September 20, 2012, Montpellier, France. [slides]
- Sum-Max Graph Partitioning Problem,
2nd International Symposium on Combinatorial Optimization (ISCO), April 17-21 2012, Athens, Greece. [slides]
- On the Approximability of the Sum-Max Graph Partitioning Problem,
International Workshop on Approximation, Parameterized and EXact algorithms (APEX), February 28-29, 2012, Paris, France. [slides]
- 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]