JEUDI 6 NOVEMBRE
|
| 09h30–09h55 | Nicolas Nisse | Le jeu des gendarmes et du voleur |
| 09h55–10h20 | Youssou Dieng | La structure des graphes sans mineur K_{2,4} |
| 10h20–10h45 | Mamadou Moustapha Kante | Short Labeling Scheme for Connectivity Check on Certain Graph Classes of Unbounded Clique-Width |
| 10h45–11h15 |
PAUSE CAFE
|
| 11h15–11h40 | Jerome Galtier | New algorithms to compute the strength of a graph |
| 11h40–12h05 | Lilia Zaourar | Algorithmes de chainage des elements memoires d’un circuit integre |
| 12h05–12h30 | Victor Chepoi | An approximation algorithm for l_{\infty}-fitting Robinson structures to distances |
| 12h30–14h00 |
DEJEUNER
|
| 14h00–14h25 | Minh Chen | Fractional chromatic number of triangle free graphs with some given maximum average degree |
| 14h25–14h50 | Jean-Christophe Godin | La liste-coloration des cycles ponderes |
| 14h50–15h15 | Mohammed Haddad | Un algorithme exact pour la coloration forte stricte des arbres |
| 15h15–15h45 |
PAUSE CAFE
|
| 15h45–16h10 | Louis Esperet | Une approche unifiee des colorations a distance deux dans les graphes planaires |
| 16h10–16h35 | Ana Silva | Nombre b-chromatique des block graphes connexes avec \omega <= 3 |
| 16h35–17h00 | Daniel Porumbel | Recherche Locale Guidee pour la Coloration de Graphe |
| |
VENDREDI 7 NOVEMBRE
|
| 09h30–09h55 | Yann Vaxes | Diameters, centers, and approximating trees of -hyperbolic geodesic spaces and graphs |
| 09h55–10h20 | L. Beaudou | Deux graphes sur la bouteille de Klein |
| 10h20–10h45 | Gregory Morel | Caracterisation des graphes de chaines completables |
| 10h45–11h15 |
PAUSE CAFE
|
| 11h15–11h40 | Kahina Meslem | Isometric embedding of subdivided generalized envelopes into hypercubes |
| 11h40–12h05 | Paul Dorbec | La conjecture de Vizing : etat des lieux |
| 12h05–12h30 | Adrien Guignard | Quelques variations du jeu de domination sur les chemins |
| 12h30–14h00 |
DEJEUNER
|
| 14h-14h25 | Nicolas Trotignon | Un theoreme de structure pour les graphes sans cycle avec une seule corde |
| 14h25–14h50 | A. Perez | Polynomial kernels for 3-leaf power graph modification problems |
| 14h50–15h15 | Ignasi Sau | Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs |
| 15h15–15h40 | Jean Daligault | Un noyau polynomial pour Multicut In Trees |
