The conference is planned to be held in the nice conference center Hotel Storebćlt. This is situated in Nyborg close to the sea and easily accessible from the train station at Nyborg. Nyborg is on the way to Odense from Copenhagen.

In due time we will publish guidance here on how to find Hotel Storebćlt from Nyborg train station. The distance is 1.5 km.

- View out of window of conference building
- At the stairs looking at the bridge to Sjćland
- The building seen from the sea

- Industrial applications of discrete mathematics
- Graph connectivity
- Graph colourings
- Directed graphs

- Jřrgen Bang-Jensen, Department of Mathematics and Computer Science, University of Southern Denmark at Odense
- Adrian Bondy, LAPCS, University Claude Bernard Lyon1 and C.N.R.S Paris
- Stephan Brandt, Department of Mathematics, Technische Universitat Ilmenau
- Marco Chiarandini, Department of Mathematics and Computer Science, University of Southern Denmark.
- Jens Clausen, Department of Mathematical Modelling, The Technical University of Denmark
- Allan Frendrup, Department of Mathematics, Aalborg University
- Daniel Goncalves, Department of Computer Science, University of Bordeaux.
- Gregory Gutin, Department of Computer Science, Royal Holloway, University of London.
- András Gyárfás,Computer and Automation Research Institute of the Hungarian Academy of Sciences.
- Inge Li Gřrtz, Department of Mathematics and Computer Science, UNiversity of Southern Denmark.
- Frederic Havet, INRIA Sophia-Antipolis, Nice France
- Ryan Hayward , Department of Computer Science, University of Alberta
- Jan van den Heuvel, Department of Mathematics, London School of Economics.
- Tommy Rene Jensen,Institut für MathematikUniversität Klagenfurt, Austria
- Tibor Jordán, Department of Operations Research, Eötvös University, Budapest, Hungary
- Leif Kjćr Jřrgensen, Department of Mathematics, Aalborg University, Denmark
- Arie Koster, Zuse Institute Berlin (ZIB), germany
- Matthias Kriesell, Department of Mathematics, University of Hannover
- Morten Hegner Nielsen , Department of Mathematics and Computer Science, University of Southern Denmark, Odense.
- Gyula Pap, Department of Operations Research, Eötvös University, Budapest, Hungary
- Jens Myrup Pedersen, Department of Control Engineering, Aalborg University
- Andre Raspaud Department of Computer Science, University of Bordeaux.
- Riste Skrekovski,Department of Mathematics, University of Ljubljana.
- Michael Stiebitz, Technische Universitat Ilmenau
- Zoltan Szigeti, Equipe Combinatoire, Universite Paris 6, France
- Meike Tewes, T-Systems International GmbH, Germany
- Stephan Thomasse LAPCS, Universite Claude Bernard Lyon 1
- Carsten Thomassen, Department of Mathematics, The Technical University of Denmark
- Bjarne Toft, Department of Mathematics and Computer Science, University of Southern Denmark at Odense
- Antoine Vella,Department of mathematics, the Technical University of Denmark.
- Preben Dahl Vestergaard, Department of Mathematics, Aalborg University
- Anders Yeo, Department of Computer Science, Royal Holloway, University of London.
- Stephan Brandt, Dense triangle-free graphs and four-colourable: A solution to the Erdös-Simonovits problem
- Marco Chiarandini, Local search methods for the set T-colouring
- Jens Clausen, Industrial application of graph theory and combinatorial optimization - three case studies
- Daniel Goncalves, Edge partition of planar graphs into two outerplanar graphs
- Gregory Gutin, Parameterized Complexity for Graph Linear Arrangement Problems
- András Gyárfás, A Nordhaus-Gaddum type inequality for the First-fit chromatic number
- Frederic Havet, Design of fault tolerant on-board networks
- Ryan Hayward, Hex and Mathematics
- Jan van den Heuvel, The External Network Problem and the Source Location Problem
- Tommy Jensen, Is the Hadwiger conjecture true for most graphs of independence number 2?
- Tibor Jordan, Location problems in graphs with connectivity and rigidity requirements
- Arie Koster, Graph-theoretic challenges in the Design of Survivable Optical Networks
- Matthias Kriesell, A constructive characterization of the 3-connected triangle free graphs
- Morten Hegner Nielsen, Longest path-partitions in generalizations of tournaments
- Gyula Pap, Hypo-matchings in directed graphs
- Andre Raspaud, On shortest cycle covers and circular flows
- Riste Skrekovski, Coloring squares of planar graphs with prescribed girth
- Michael Stiebitz, Edge colourings of graphs
- Zoltan Szigeti, Edge-connectivity augmentations of bipartite graphs
- Meike Tewes, Modelling the Last Mile
- Stephan Thomasse, Branchwidth of graphic matroids
- Carsten Thomassen, On the number of colorings of a graph
- Anders Yeo, Total domination in graphs
- Antoine Vella, Graph theory and general topology

We start in the evening of December 1 with a problem session, so please think of some good problems to state here.

Last modified: Wed Nov 30 12:53:18 CET 2005