Short abstracts

  • Anders Björner: Royal Institute of Technology (Sweden) - A q-analogue of the FKG inequality and some applications
  • Bruno Courcelle: Bordeaux I university (France) - Logical characterizations of graph hierarchies
  • Penny Haxell: University of Waterloo (Canada) -Packing and covering in hypergraphs}
  • Michaël Krivelevich: Tel Aviv University (Israel) - Hamiltonicity problems in random graphs
  • Martin Loebl: Charles University (Czech Republic) - Optimization by Enumeration
  • Bojan Mohar: Simon Fraser University (Canada) - Is there a structural graph theory based on the spectral radius?
  • Janos Pach: EPFL (Switzerland) and City College NY (United States) - Ordnung muss sein! -- Plane curves and partial orders
  • Stéphan Thomassé : Montpellier University (France) - Kernelization via Combinatorial OptimizationS
  • Xuding Zhu: Sun Yat sen University (Taiwan) - Total weight choosability of graphs