Cette page utilise des feuilles de style en cascade. Si vous arrivez à lire ce message, c'est que CSS ou javascript ne sont pas activés. L'affichage de la page sera donc différent de ce qui est prévu.
Talks on conferences, workshops and seminars
-
"Lower bounds on
Exponential-Time Algorithms"
Workshop on improved Exponential-Time Algorithms (iETA)
Venice, july 16, 2006
-
"Certifying Algorithms
and Forbidden Induced Subgraphs"
Seminar on Exact, Approximative, Robust and Certifying Algorithms on Particular
Graph Classes
Dagstuhl, may 20-25, 2007
-
"Fast exponential time
algorithms to solve NP-complete problems exactly"
CIRM workshop: Decompositions de graphes, theorie,
algorithmes et logiques
Marseille, april 7-11, 2008
-
"Faster Steiner Tree computation in
polynomial space"
European Symposium on Algorithms (ESA 2008)
Karlsruhe, september 15-17, 2008
-
"Convex Recoloring Revisited"
Bergen, may 8, 2009
-
"Branching Algorithms"
AGAPE 09: Spring School on Parameterized and Exact Algorithms
Corsica, France, may 24-29, 2009
-
"Colorings with few colors: Counting, Enumeration and
Combinatorial Bounds"
Workshop on Graph Theoretic Concepts in Computer Science (WG 2010)
Zaros, Crete, Greece, juin 28-30, 2010
-
"Counting in AT-free graphs"
DIMAP Workshop "Graphs and Combinatorics"
University of Warwick, UK, april 4-7, 2011
-
"Exact Algorithms for Kayles"
Workshop on Graph Theoretic Concepts in Computer Science (WG 2011)
Tepla, Czech Republic, juin 21-24, 2011
-
"Minimal dominating sets in graphs: enumeration, combinatorial
bounds and graph classes"
Journées Combinatoires Rhone-Alpes Auvergne (JCRAA)
Clermont-Ferrand, France, fevrier 1-2, 2012