Workshop
Home
Tutorials
Plenary Lectures
Short Talks
Programme
Participants
Photos
Contacts

Organizers
Andrei Krokhin
Peter Jeavons

Travel
Venue
Travel and Maps
Accommodation

The workshop will run from 20-24 March 2006 and will consist of 9 half-day sessions as outlined below. These sessions will be based around broad topics: Algebra and CSP, Logic and CSP, Graph Theory and CSP, and Variations of CSP. There will also be 3 1½-hour tutorials to enable all participants to engage with the content of the main sessions.

During the main programme there will be 11 1-hour plenary lectures given by world-leading specialists in the above four topics. In addition to these plenary talks are a further 11 ½-hour short talks which will cover a broad range of topics.

Sunday, 19 March

18:00-19:00 Registration

Monday, 20 March

9:30-10:00 Registration
10:00-10:20 Opening
10:20-12:00 Peter Jeavons
Tutorial on CSP and algebra
[ pdf (converted) | ppt ]
12:00-14:00 Lunch
14:00-15:35 Phokion Kolaitis
Tutorial on CSP and logic
[ pdf ]
15:35-16:00 Coffee Break
16:00-17:35 Pavol Hell
Tutorial on CSP and graph theory
[ pdf (converted) | ppt ]

Tuesday, 21 March

9:30-10:30 Nadia Creignou
Boolean CSP
[ pdf ]
10:30-11:00 Coffee Break
11:00-12:00 Andrei Bulatov
CSP, algebras, varieties
[ pdf (converted) | ppt]
12:00-12:30 Pascal Tesson
Systems of equations over semigroups: a case study for CSP
[ pdf (converted) | ppt]
12:30-14:00 Lunch
14:00-15:00 Peter Jonsson
Max CSP and lattices
[ pdf (converted) | ps ]
15:00-15:30 Dave Cohen
Soft constraints and multimorphisms
[ pdf (converted) | ppt]
15:30-16:00 Coffee Break
16:00-17:00 Johan Hastad
CSP and inapproximability
[ pdf ]
17:00-17:30 Francesca Rossi
Positive and negative preferences
[ pdf ]

Wednesday, 22 March

9:30-10:30 Georg Gottlob
CSP and hypergraph decompositions
[ pdf ]
10:30-11:00 Coffee Break
11:00-12:00 Victor Dalmau
CSP and pebble games
[ pdf ]
12:00-12:30 Daniel Marx
Constraint satisfaction via fractional edge covers
[ pdf ]
12:30-14:00 Lunch
14:00-15:00 Discussion/Open problem session
[ pdf ]
15:00-17:00 Excursion
[ photo galleries ]
18:00 Conference Dinner
[ photo galleries ]

Thursday, 23 March

9:30-10:30 Albert Atserias
The homomorphism preservation property
[ pdf (converted) | ps ]
10:30-11:00 Coffee Break
11:00-12:00 Benoit Larose
CSP and the near-unanimity property
[ pdf ]
12:00-12:30 Heribert Vollmer
Refining Schaefer's theorem
[ pdf ]
12:30-14:00 Lunch
14:00-15:00 Hubie Chen
Mathematics of QCSP
[ pdf (part 1) | pdf (part 2) | pdf (part 3) | pdf (part 4) ]
15:00-15:30 Steve Linton
Understanding and managing symmetry in constraint systems
[ pdf ]
15:30-16:00 Coffee Break
16:00-17:00 Jaroslav Nesetril
CSP and graph homomorphisms
[ pdf ]
17:00-17:30 Tomas Feder
Boolean bipartite constraint satisfaction and delta matroids
[ pdf (converted) | ppt]

Friday, 24 March

9:00-10:00 Iain Stewart
CSP and monotone monadic SNP
[ pdf ]
10:00-10:30 Thomas Schiex
Cost function optimization and local consistency
[ pdf (converted) | ppt | pdf (extra talk) ]
10:30-11:00 Coffee Break
11:00-11:30 Manuel Bodirsky
Datalog and infinite-valued CSP
[ pdf | ps]
11:30-12:00 Barbara Smith
Constraint programming models for graceful graphs problems
[ pdf | ppt ]
12:00-12:30 Dimitrios Thilikos
Restrictive list H-coloring: algorithms and complexity results
[ pdf ]