Algorithmic Research Cooperation around {Ø|Ö}resund

ARCO meeting

Tuesday 5/4 kl. 09.45-15.30, room D337 at Orkanen, Malmö University

Program

Time

Title

Presenter

09.45-10.15

WELCOME with coffee

 

Open Problems

 

 

10.15-10.30

Open Problem, Exponential time complexity of edge colouring

Thore Husfeldt / ITU, Denmark and Lund University, Sweden

10.30-10.45

Open Problem, Improvements in Database Cache Management Algorithms

Jesper Larsson / IT-University, Denmark

10.45-11.00

Open Problem, Multi-Agent Tree Exploration

Bengt J. Nilsson / Malmö University, Sweden

Scientific Presentations

 

 

11.00-11.30

On the Approximability of Maximum and Minimum Edge Clique Partition

Mia Persson / Malmö University, Sweden

11.30-12.00

Three number systems and one application

Jyrki Katajainen / Copenhagen University, Denmark

12.00-12.30

String Matching with Variable Length Gaps

Hjalte Wedel Vildhøj / Technical University, Denmark

12.30-13.30

LUNCH (At the Orkanen cantina)

 

13.30-14.00

#ETH

Thore Husfeldt / ITU, Denmark and Lund University, Sweden

14.00-14.30

Towards More Efficient Infection and Fire Fighting

Peter Floderus / Lund University, Sweden

14.30-15.00

Adjustable Chain Trees for Proteins

Pawel Winter / Copenhagen University, Denmark

15.00-15.30

BUSINESS MEETING

 

Participants:

Peter Floderus, Anteja Gros, Sinisa Grubor, Inge-Li Gørtz, Thore Husfeldt, Jyrki Katajainen, Konstantin Kutzkov, Jesper Larsson, Christos Levcopoulos, Andrzej Lingas, Bengt J. Nilsson, Mia Persson, Natalie Schlüter, Dzmitry Sledneu, Nina Taslaman, Samo Tuma, Hjalte Wedel Vildhøj, Pawel Winter.

Bengt J. Nilsson
Professor of Computer Science
Malmö University College
SE-205 06  Malmö
Sweden

Phone:  INT+46 (0)40 665 72 44 WWW:  http://homeweb.mah.se/~tsbeni/