CURRICULUM VITAE - Académie royale de Belgique
CURRICULUM VITAE - Académie royale de Belgique
CURRICULUM VITAE - Académie royale de Belgique
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
16. “Surfaces that Define Facets of the Linear Or<strong>de</strong>ring Polytope”, DIMACS Workshop<br />
on Polyhedral Combinatorics of Random Utility, 24–26 mai 2006, Piscataway<br />
(NJ), Etats-Unis<br />
15. “Minimum Entropy Coloring”, Franco-Canadian Workshop on Combinatorial Algorithms,<br />
18–20 août 2005, Hamilton (Ontario), Canada<br />
14. “Approximate min-max relations for odd cycles in planar graphs”, 11th conference<br />
on Integer Programming and Combinatorial Optimization (IPCO 2005), 8–10 juin<br />
2005, Berlin, Allemagne<br />
13. “How to recycle your facets”, Bertinoro Workshop on Combinatorial Optimization<br />
2004, 1–6 mai 2004, Bertinoro, Italie<br />
12. “Turning factor-critical graphs into facets of the linear or<strong>de</strong>ring polytope”, Ordinal<br />
and Symbolic Data Analysis 2003, 20–23 août 2003, Irvine (CA), Etats-Unis<br />
11. “Nonadjacency on partial or<strong>de</strong>r polytopes is NP-complete”, Combinatorial Optimization<br />
2002, 8–10 avril 2002, Paris, France<br />
10. “The facets and the symmetries of the approval-voting polytope”, EIDMA Symposium<br />
2001, 25–26 octobre 2001, Osten<strong>de</strong>, <strong>Belgique</strong><br />
9. “Extendability of small cyclically or<strong>de</strong>red sets”, EIDMA Symposium 2000, 12–13<br />
octobre 2000, Mierlo, Pays-Bas<br />
8. “Shaping a 0/1-polytope from the cube”, Euroconference on Algorithmic and Discrete<br />
Mathematics, 19–25 août 2000, Anogia (Crête), Grèce<br />
7. “Repercussions of Dimension Theory in Polyhedral Combinatorics”, Ordinal and<br />
Symbolic Data Analysis 2000, 5–8 juillet 2000, Bruxelles, <strong>Belgique</strong><br />
6. “Interpreting the facets of small or<strong>de</strong>r polytopes via sum and strengthen”, Fourteenth<br />
Conference on Quantitative Methods for Decision Making (ORBEL 14),<br />
20–21 janvier 2000, Mons, <strong>Belgique</strong><br />
5. “Adjacency on weak or<strong>de</strong>r polytopes”, Or<strong>de</strong>rs, Algorithms and Applications ’99,<br />
25–27 août 1999, Montpellier, France<br />
4. “Automorphism groups of some or<strong>de</strong>r polytopes”, European Chapter on Combinatorial<br />
Optimization XII, 27–29 mai 1999, Ile <strong>de</strong> Bendor, France<br />
3. “Combinatoire polyédrique <strong>de</strong>s ordres totaux et partiels”, Journée Ensembles Ordonnés,<br />
Treillis et Applications, 19 octobre 1998, Paris, France (invité comme<br />
intervenant)<br />
2. “Polyhedral aspects of partial or<strong>de</strong>rs and comparability graphs”, Ordinal and Symbolic<br />
Data Analysis 98, 28–30 septembre 1998, Amherst (MA), Etats-Unis<br />
1. “On the partial or<strong>de</strong>r polytope”, Combinatorial Optimization 98, 15–17 avril 1998,<br />
Bruxelles, <strong>Belgique</strong><br />
9