14th ARCO 2011 DTU

ARCO meeting at DTU at November 22.  

Program: 

 

9.45-10.10

Welcome 
 

10.10-11.10

 

Thore Husfeldt, "Fast Zeta Transforms for Lattices with Few Irreducibles"

Nina Sofia Taslaman, "Shortest Cycle Through Specified Elements"

 

11.30-12.30

 

Jørgen Bang-Jensen and Alessandro Maddaloni, "The arc-disjoint path problem for generalizations of tournaments"

Dzmitry Sledneu, "A combinatorial algorithm for all-pairs shortest paths in directed vertex-weighted graphs with applications to disc graphs"

12.30- 14.00  

 Lunch and business meeting/"PhD playground"

 

14.00-15.00

 

Mikkel Thorup "Tabulation Hashing"

Rasmus Pagh "Algorithmic Uses of Tabulation Hashing"

 

15.20-16.20

 

Bengt J. Nilsson, "Interior Guarding Monotone Polygons is NP-hard"

Sushmita Gupta, "Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis"

See the abstracts

See the list of participants