WEA 2003

.......

Program

Monday 26
8:30 - 9:15 9:15 - 9:30	Registration Welcome speech
9:30 - 10:00	Martin Hoefer Experimental comparison of heuristic and approximation algorithms for uncapacitated facility location
10:00 - 10:30	M. Caramia and S. Giordani and A. Iovanella An On-line Algorithm for the Rectangle Packing Problem with Rejection
10:30 - 11:00	Coffee break
11:00 - 12:00	Invited Talk: Kurt Mehlhorn
12:00 - 14:00	Lunch
14:00 - 14:30	Rudolf Fleischer and Gerhard Trippen Experimental Studies of Graph Traversal Algorithms
14:30 - 15:00	Ernst Althaus and Tobias Polzin and Siavash Vahdati Daneshmand Improving Linear Programming Approaches for the Steiner Tree Problem
15:00 - 15:30	Maria I. Andreou, Sotiris E. Nikoletseas, Paul G. Spirakis Algorithms and Experiments on Colouring Squares of Planar Graphs
15:30 - 16:00	Coffee break
16:00 -16:30	Pilu Crescenzi and Roberto Grossi and Giuseppe F. Italiano Search Data Structures for Maintaining Skewed Strings
16:30 -17:00	Domenico Cantone and Simone Faro Fast-Search: a new efficient variant of the Boyer-Moore string matching
17:00 -17:30	Monaldo Mastrolilli and Leonora Bianchi Core Instances for Testing: a Case Study
19:00	Dinner

Tuesday 27
9:00 - 9:30	Marco Pranzo and Carlo Meloni and Dario Pacciarelli A new class of greedy heuristics for job shop scheduling problems
9:30 - 10:00	Vittorio Bilo' and Michele Flammini Experimental analysis of online algorithms for the bicriteria scheduling problem
10:00 - 10:30	Coffee break
11:00 - 12:00	Invited Talk: Roberto Solis-Oba
12:00 - 13:00	Lunch
13:30 - 18:45 13:30 14:30 - 15:15 15:30 - 16:30 18:00 - 18:15 18:15	Excursion: The Brissago Islands From Monte Verita' to Ascona (by foot 20 minutes) Boat to the Brissago Islands (departure from Ascona) Guided Visit Boat departure to Ascona From Ascona to Monte Verita' (by bus)
19:00 - 20:00 20:00	Aperitif Social Dinner + (Prize-giving)

Wednesday 28
9:00 - 9:30	Mitali Singh and Viktor K. Prasanna Algorithmic Techniques for Memory Energy Reduction (Best Paper Award)
9:30 - 10:00	Alexander Hall and Hanjo T\"aubig Comparing Push- and Pull-Based Broadcasting, Or: Would ``Microsoft Watches'' Profit from a Transmitter?
10:00 - 10:30	J. Diaz, J. Petit and M. Serra Evaluation of basic protocols for optical smart dust networks
10:30 - 11:00	Coffee Break
11:00 - 12:00	Invited Talk: Dorothea Wagner
12:00 - 14:00	Lunch
14:00 - 14:30	Karlis Freivalds A Nondifferentiable Optimization Approach to Ratio-Cut Partitioning
14:30 - 15:00	Martin Kochol Linear algoritm for 3-coloring of locally connected graphs
15:00 - 15:30	Victor M. Jimenez and Andres Marzal A Lazy Version of Eppstein's K Shortest Paths Algorithm
15:30 - 16:00	Coffee break
16:00 -16:30	Doratha E. Drake and Stefan Hougardy Linear Time Local Improvements for Weighted Matchings in Graphs
16:30 -17:00	F. Clautiaux and J. Carlier and A. Moukrim and S. Negre New lower and Upper Bounds for Graph treewidth
17:00	End

.......................................

This website is hosted by IDSIA