Kolloquium über Kombinatorik
Magdeburg
16., 17. und 18. November 2006
Hauptvorträge
Low Discrepancy Colorings of Additive Structures
(Abstract)
Anand Srivastav
Christian-Albrechts-Universität zu Kiel
Search algorithms for substructures in combinatorial objects
(Abstract)
Veerle Fack
Universiteit Gent
Do we know all 3 colourable distance regular graphs?
(Abstract)
Aart Blokhuis
Technische Universiteit Eindhoven
Non-crossing partitions on an annulus
(Abstract)
Christian Krattenthaler
Universität Wien
Route Planning and Engineering Shortest Paths
(Abstract)
Dorothea Wagner
Universität Karlsruhe
Extremal infinite graph theory? A topological approach
(Abstract)
Reinhard Diestel
Universität Hamburg
Geometric clustering
(Abstract)
Peter Gritzmann
Technische Universität München
Routing in Graphs with Applications in Traffic and Logistics
(Abstract)
Rolf H. Möhring
Technische Universität Berlin
How large must the set of subset sums be?
(Abstract)
Bojan Mohar
Simon Fraser University