|
7 February 2008 (Thursday) |
|
|
0900-0920 |
Registration
|
|
0920-0930 |
Opening
by the Head, Department of Computer Science
|
|
0930-1000 |
Bill Smyth (McMaster University) A New Approach to the
Periodicity Lemma on Strings with Holes |
|
1000-1030 |
Thierry Lecroq (University of Rouen) |
|
1030-1100 |
Coffee Break
|
|
1100-1130 |
Gregory Kucherov (LIFL/CNRS/INRIA) [PDF] |
|
1130-1200 |
Frantisek Franek (McMaster University) [PDF] |
|
1200-1230 |
Wojciech Rytter (Warsaw University) Matching Integer Intervals by
Minimal Sets of Binary Words with don't cares |
|
1230-1430 |
Lunch at
Sofra
- Covent Garden
|
|
1430-1500 |
Andreas Albrecht (University of Hertfordshire) Landscape Analysis for k-SAT
Instances [PDF] |
|
1500-1530 |
Hans-Joachim Böckenhauer (ETH Zürich) On the approximation
hardness of reoptimization
[PDF] |
|
1530-1600 |
Coffee
Break
|
|
1600-1630 |
Jan Holub (CTU Prague) Dynamic Version of Data Compression using Antidictionaries [PDF] |
|
1630-1700 |
Michal
Ziv-Ukelson (Ben Gurion University of the Negev) |
|
1700-1730 |
Sunho Lee (Seoul
National University) |
|
1730-1800 |
Alberto
Apostolico(Accademia dei
Lincei & Univ of Padova & Georgia Tech) |
|
1900 |
Dinner
at Champagne
Charlies
|
|
8 February 2008 (Friday) |
|
|
0900-0930 |
Gad M. Landau (University of Haifa) |
|
0930-1000 |
Concettina Guerra (Università di
Padova &
Georgia Tech) |
|
1000-1030 |
Gregory Gutin (Royal Holloway, University of London) Extremal out-branchings and
out-trees in digraphs [PDF] |
|
1030-1100 |
Coffee
Break
|
|
1100-1130 |
Mathieu Giraud (CNRS, Université Lille 1) |
|
1130-1200 |
Marek Hanuš (CTU Prague) Pattern Matching on Simple
Collage System Using Finite Automata [PDF] |
|
1200-1230 |
Alexander Tiskin (University of Warwick) Sequence comparison by
transposition networks
[PDF] |
|
1230-1430 |
Lunch at
The
Queen Mary
|
|
1430-1500 |
Nadia Pisanti (University of Pisa) Speeding up the Inference of
Multiple Repeats with Bounded Edit Distance |
|
1500-1530 |
Tugkan Batu (London School of Economics) A Sublinear-Time Approximation
Scheme for Bin Packing [PDF] |
|
1530-1600 |
Coffee
Break
|
|
1600-1630 |
Esko Ukkonen
(University of Helsinki) Finding maximal and minimal
motifs of a string [PDF] |
|
1630-1700 |
Dominique Perrin (University of Marne-la-Vallée) [PDF] |
|
1700-1730 |
Ida Pu (Goldsmiths,
University of London) |
|
1900 |
Dinner
at La
Tasca – Covent Garden
|