Conference Presentations and Organization
Invited Talks:
- How hard
is it to List-Colour the Edges of a Graph?
- Invited talk, 40th
meeting of the Combitorialists of New England (CONE), Smith
College, Northampton, Massachusetts, May 2000.
- An
Algorithmic Approach to Multicolouring
- Conference Colloquium, Big Sky Combinatorics
conference, Missoula, Montana, September 1999.
- List edge colourings and the asymptotics of the Vizing
conjecture
- Plenary talk, MCCCC'99, Normal,
Illinois, October 1999.
- Colouring the Air
- Invited talk, MSRI workshop on Extremal
Combinatorics, Berkeley, California, November 1996.
Organization of events:
Other selected talks