URAW 2004 - Program

Friday, March 19th

10:15-10:40	Registration
10:40-10:45	Reception
10:45-11:10	Johannes Uhlmann: Tree decompositions of graphs: saving memory in dynamic programming
11:10-11:35	Henning Fernau: A Top-Down Approach to Search-Trees
11:35-12:00	Jean-Claude Spehner: Araucarias
12:00-12:25	Birgitta Weber: Parallel Prefetching and Caching is Hard
12:25-13:45	Lunch break
13:45-14:10	Guochuan Zhang: Maximizing the Number of Packed Rectangles
14:10-14:35	Dominique Schmitt: k-set polytopes and order-k Delaunay diagrams
14:35-15:00	Yoshio Okamoto: The traveling salesman problem with few inner points
15:00-15:25	Étienne Schramm: The European Pie
15:25-15:55	Coffee Break
15:55-16:45	Rolf Klein: On the dilation of curves and point sets (invited talk)
16:45-17:10	Philippe Robert: Using the GPU for Geometric Computations
17:10-17:35	Christian Ammann: Implementation of 3D Computer Games Using Subdivision Surfaces
17:35-17:45	Break
17:45-18:10	Michael Hoffmann: Chordless Paths through Three Vertices
18:10-18:35	Matthias Müller-Hannemann: Moving Policies in Cyclic Assembly-Line Scheduling
18:35-19:00	Jiong Guo: Fixed-Parameter tractability results for Multicut and Multicommodity Demand Flow in Trees
19:30-	Conference Dinner

9:05- 9:30	Matus Mihalak: OVSF-code assignment
9:30- 9:55	Markus Schmidt: Performance of Greedy Algorithms in Packet Buffering
9:55-10:20	Jan Remy: Online Construction of Minimum Spanning Trees in Random Weighted Graph
10:20-10:45	Ingo Schurr: Memoryless Algorithms on Unique Sink Orientations of Cubes
10:45-11:15	Coffee Break
11:15-11:40	Daniel Fleischer: Electrical Networks
11:40-12:05	Katharina Nina Lehmann: What a bookstore can tell us
12:05-12:30	Jürgen Lerner: Structural Similarity