19TH ARCO 2014 DIKU

Final program:

  9.30-10.00 Welcome snack and co ffee
10.00-10.30 Jesper Mikkelsen, IMADA, SDU, The Advice Complexity of a Class of Hard Online Problems
10.30-11.00 Jesper Larsson, Malmö Univ., Efficient Representation for Online Suffix Tree Construction
11.00-11.15 Coff ee break
11.15-11.45 Joachim Gudmundsson, Univ. of Sydney, Fast Algorithms for Approximate Frechet Matching Queries in Geometric Trees
11.45-12.15 Rasmus Fonseca, Univ. of Copenhagen, Faster Exact Algorithms for Computing Steiner Trees in Higher Dimensional Euclidean Spaces
12.15-13.00 Lunch
13.00-13.30 Bengt Nilsson, Malmö Univ., Using Maximum Coverage to Optimize Recommendation Systems in E-Commerce
13.30-14.00 Eli Packer, IBM Haifa, Hybrid Algorithms for Scheduling Sensors for Guarding Polygonal Domains
14.00-14.30 Luis Cruz-Filipe, IMADA, SDU, Sorting Networks: the End Game
14.30-15.00 Co ffeee break
15.00-15.30 Valentin Polishchuk, Linköping Univ., Algorithms in the sky: How to design an optimal airspace?
15.30-16.00 Jyrki Katajainen, Univ. of Copenhagen, What your teachers never told you about Fibonacci heaps
16.00-16.15 Break
16.15-17.00 Board meeting

Registration deadline: 10th November 2014 to ihjensen@di.ku.dk