Talks
Home

Séminaire CAPSID (tea-time), LORIA, January 4, 2017. Bipartite graphs as I know them

Séminaire COATI, Sophia Antipolis, February 4, 2014. Fractional Colourings of

K-free Graphs_{Δ}

Séminaire Algorithmique distribuée et graphes, LIAFA, Paris, July 9, 2013. Fractional Colourings of

K-free Graphs_{Δ}

One-Day Meeting in Combinatorics, Mathematical Institute, Oxford, United Kingdom, June, 5th, 2013, invited talk. Questions (and answers) about fractional colourings

Graph Theory Days, LORIA, Vandœuvre-lès-Nancy, France, May 23rd, 2013. Fractional Colourings of

K-free Graphs_{Δ}

Séminaire SIESTE, ENS, Lyon, France, March 26, 2013. Limites de graphes denses

Séminaire TALC, LORIA, Vandœuvre-lès-Nancy, France, January 8, 2013. An introduction to extremal graph theory

Séminaire Orpailleur, LORIA, Vandœuvre-lès-Nancy, France, December 20, 2012. Introduction to graph colouring

Journée de rentrée du LIAFA, Paris, France, October 10, 2012. Hitting Cycles in Graphs -- Some questions to meditate on

21

^{st}Workshop Cycles & Colourings, Nový Smokovec, Slovakia, September 10, 2012, plenary talk. Hitting Cycles (and Balls) in (Planar) Graphs

Séminaire Algorithmique distribuée et graphes, LIAFA, Paris, March 6, 2012. L. Gurvits's proof of the van der Waerden conjecture

McGill's Discrete Mathematics and Optimization Seminar, Montreal, February 16, 2012. L. Gurvits's proof of the van der Waerden conjecture

Journées nationales du GDR Informatique Mathématique, Paris, January 25, 2012. Théorie extrémale des graphes

ACiD Seminar, Durham University, December 1, 2011. Odd cycles in planar graphs.

13

^{èmes}Journées graphes et algorithmes, Lyon, November 17, 2011, plenary talk. Points fortement couverts, combinatoire et algèbres de drapeaux.

Séminaire AlGCo, LIRMM, Montpellier, January 6, 2011. L. Gurvits's proof of the van der Waerden conjecture.

SIAM Conference on Discrete Mathematics, Austin, Texas, June 14, 2010. The last fraction of a fractional conjecture and open problems.

Séminaire Algorithmique et combinatoire, LIAFA, Paris, May 4, 2010. The last fraction of a fractional conjecture and open problems.

Séminaire Algorithmique et combinatoire, LIAFA, Paris, October 13, 2009. Graphs with bounded tree-width and large odd-girth are almost bipartite.

Séminaire Algorithmique et combinatoire, LIAFA, Paris, July 7, 2009. Discharging and Colouring (I).

Séminaire Algorithmique et combinatoire, LIAFA, Paris, January 6, 2009. Circular edge-colorings of cubic graphs.

Journées de l’équipe Algorithmique et combinatoire, Barbizon, October 7, 2008. Perfect matchings in cubic graphs: some things to meditate on.

Séminaire Algorithmique et combinatoire, LIAFA, Paris, March 11, 2008. L(p,1)-labellings: Griggs and Yeh's conjecture.

Nineteenth ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), San Francisco, January 21, 2008. L(2,1)-labellings of graphs.

2

^{nd}Workshop on Frequency Assignment Problems in Wireless Networks (WFAP 07), Sádek (Třebíč), September 26, 2007, plenary talk. Griggs and Yeh's conjecture and the probabilistic method.

Noon Seminars, Institute for Theoretical Computer Science (ITI) and Department of Applied Mathematics (KAM), Charles University, Prague, June 28, 2007. The Bermond-Thomassen conjecture.

10 years of DIMATIA, Charles University, Prague, April 25, 2007. L(2,1)-labellings: Griggs and Yeh's conjecture.

Noon Seminars, Institute for Theoretical Computer Science (ITI) and Department of Applied Mathematics (KAM), Charles University, Prague, December 21, 2006. Circular Choosability of graphs.

Séminaire MASCOTTE, INRIA, Sophia Antipolis, May 30, 2006. Arête-coloration des graphes cubiques par des éléments de groupes abéliens.

Graph theory seminars, Department of Mathematics, Faculty of Mathematics and Physics, Ljubljana, March 02, 2006. Pathwidth of outerplanar graphs.

Noon Seminars, Institute for Theoretical Computer Science (ITI) and Department of Applied Mathematics (KAM), Charles University, Prague, September 29, 2005. Around a Brooks-like result for improper colouring.

Thirty-first International Workshop on Graph-Theoretic Concepts in Computer Science (WG'05), Campus "Ile du Saulcy", Metz, June 23, 2005. Channel assignment and improper choosability of graphs.

Septièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, AlgoTel 2005, Presqu'ile de Giens, May 11, 2005. Rerouting requests in WDM networks.

Sixteenth Postgraduate Combinatorial Conference, Mathematical Institute, Oxford, March 23, 2005. Improper colourings of graphs with bounded maximum average degree.

Combinatorial Theory Seminar, Mathematical Institute, Oxford, March 17, 2005. Improper colourings of graphs.

Deuxieme Journée de Combinatoire Rhône-Alpes, Laboratoire Leibniz, Grenoble, May 19, 2004. Improper colourings of graphs.

Séminaire MASCOTTE, INRIA, Sophia Antipolis, February 10, 2004. Coloration impropre des graphes de degré moyen maximum borné.

Séminaire de Combinatoire, LaPCS, Lyon, January 21, 2004. Coloration impropre des graphes de degré moyen maximum borné.

Séminaire MASCOTTE, INRIA, Sophia Antipolis, January 06, 2004. Reconnaissance et représentation des graphes planaires.