Program

The list of submitted abstracts is found here.
9.30-9.45 Registration
Invited talk
9.45-10.45 The Strong Perfect Graph Theorem
Maria Chudnovsky, Princeton University
10.45-11.15 Coffee break
11.15-11.45 Canonical Forms and Algorithms for Steiner Trees in Uniform Orientation Metrics
Martin Zachariasen, Copenhagen University
11.45-12.15 Fully-Dynamic Two Dimensional Orthogonal Range and Line Segment Intersection Reporting in Logarithmic Time
Christian Worm Mortensen, IT-University of Copenhagen
12.15-13.15 Lunch
13.15-14.15 Perfectness is an Elusive Graph Property
Annegret Wagler, ZIB Berlin
14.15-14.45 Bounds for Seat Reservation Allowing One Seat Change
Joan Boyar, University of Southern Denmark
14.45-15.15 Decentralized Ground Staff Scheduling
Jens Clausen, The Technical University of Denmark
15.15-15.45 Coffee break
15.45-16.15 Hierarchical Network Design Using Simulated Annealing
Tommy Thomadsen, The Technical University of Denmark
16.15-16.45 The Relative Worst Order Ratio for On-Line Algorithms
Lene Monrad Favrholdt, Copenhagen University
16.45-17.15 Subexponential-time Algorithms for Maximum Independent Set and Related Problems on Box Graphs
Martin Wahlen, Lund University
17.15- Business meeting
18.00- Dinner for those interested. Reservation to be made at the meeting