Will appear here as I receive them. Please send your abstract (in Latex or pdf) soon!

- Jack Edmonds: Convex extensions of set functions.
- Pavol Hell: List homomorphisms - time and space
- Bill Jackson: Rigidity of Graphs and Frameworks
- Tibor Jordán: Unique Completability of Partially Filled Low Rank Positive Semidefinite Matrices
- Kenichi Kawarabayashi: The directed grid theorem
- Wolfgang Mader:Critical vertices in k-connected digraphs
- Jaroslav Nesteril: Orderings of undirected graphs
- Miklós Simonovits: Stability method and the exact solution of the Erdos-T. Sos conjecture
- Michael Stiebitz: Critical Graphs and Hypergraphs
- Stéphan Thomassé: Decomposing a graph into paths, part 2
- Carsten Thomassen: From finite to infinite graphs
- Andrew Thomason List colourings of hypergraphs
- Mikkel Thorup: Deterministic edge-connectivity in near linear time
- Anders Yeo Transversals in hypergraphs

- Robert E.L. Aldred: Cycles in 5-connected planar triangulations
- Stephen Alstrup: Induced universal graphs and labeling schemes
- Julien Bensmail: Edge-partitioning a graph into paths: beyond the Barat-Thomassen conjecture
- Stephane Bessy: Antistrong Digraphs
- Marthe Bonamy: Induced cycles in a graph with high chromatic number
- Hajo Broersma: Toughness,forbidden subgraphs and hamiltonicity
- Kathie Cameron: The Structure of Graphs Without Even Holes or Odd Pans
- Louis Esperet: Boxicity and topological invariants
- Herbert Fleischner: Hamiltonian cycles in squares of graphs revisited
- John Gimbel: Old and New Results in Chromatic Theory
- Jochen Harant: On Longest Cycles in Essentially 4-connected Planar Graphs
- Jacob Holm: Planar reachability in linear space and constant time
- Tommy Jensen: On a linear algebra version of the Hajos Theorem
- Leif K. Joergensen: Mixed Moore graphs
- Tomas Kaiser:Doubly-critical hypergraphs
- Matthias Kriesell: Unique colorability and clique minors
- Gary MacGillivray: Colourings of (0;m)-graphs and the switching operation
- Martin Merker: Decomposing highly edge-connected graphs into trees of small diameter
- Seongmin Ok: New results for variants of the Merino-Welsh conjecture
- Thomas Perrett: A zero-free interval for chromatic polynomials of graphs with 3-leaf spanning trees
- Michael Plummer: Well-covered tesselations of the plane
- Andre Raspaud: Oriented incidence colourings of digraphs
- Dieter Rautenbach:Optimal Colorings with Rainbow Paths
- Eckhart Steffen: Cores, joins and the Fano- ow conjectures
- Matej Stehlik Edge-critical subgraphs of Schrijver graphs
- Douglas West: The f-matching game on a graph.
- Xuding Zhu: Total weight choosability of trees

Last modified: Fri Aug 21 13:24:53 CEST 2015 Joergen Bang-Jensen (jbj@imada.sdu.dk)