Programme

Detailed Technical Programme

July 18

9 -9.30    Registration

Session 1, 9.30–11.00

Jason Crampton, Gregory Gutin and Rémi Watrigant. A Multivariate Approach for Checking Resiliency in Access Control

Evangelos Kranakis, Danny Krizanc and Yun Lu. Reconstructing Cactus Graphs from Shortest Path Information

Martin Nehez. Near-Optimal Dominating Sets via Random Sampling

11–11.30    Coffee break

Session 2, 11.30–13.00

Evangelos Markakis and Orestis Telelis. Item Pricing for Combinatorial Public Projects

Thomas Bellitto. Separating codes and traffic monitoring

Massimiliano Goldwurm, Jianyi Lin and Francesco Saccà. On the Complexity of Clustering with Relaxed Size Constraints

13.00-14.30    Lunch break

Session 3, 14.30–16.00

Bastien Cazaux, Gustavo Sacomoto and Eric Rivals. Superstring Graph: a new approach for genome assembly

Julien Baste, Christophe Paul, Ignasi Sau and Celine Scornavacca. Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees

Simone Faro. A Very Fast String Matching Algorithm Based on Condensed Alphabets

16.00-16.30    Coffee break

Session 4, 16.30–18.00

Marwane Bouznif, Frederic Havet and Myriam Preissman. Minimum-density identifying codes in square grids

H. K. Dai and H. C. Su. Norm-Based Locality Measures of Two-Dimensional Hilbert Curves

Konstantinos Georgiou, George Karakostas, Evangelos Kranakis and Danny Krizanc. Know When to Persist: Deriving Value from a Stream Buffer

July 19

Invited Talk I:

10–11    Stéphane Vialette: Unshuffling Words and Permutations

11–11.30    Coffee break

Session 5, 11.30–13.00

Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jerome Monnot and Vangelis Paschos. Algorithmic Aspects of Upper Domination: A Parameterised Perspective

Christos Kaklamanis, Panagiotis Kanellopoulos and Sophia Tsokana. On network formation games with heterogeneous players and basic network creation games

Robert Bredereck, Jiehua Chen, Falk Hüffner and Stefan Kratsch. Parameterized Complexity of Team Formation in Social Networks

13.00-14.30    Lunch break

July 20

Invited Talk II:

10–11    Roberto Grossi: Network Analytics via Pattern Discovery

11–11.30    Coffee break

Session 6, 11.30–13.00

Simone Faro and Oguzhan Kulekci. Efficient Algorithms for the Order Preserving Pattern Matching Problem

Albert Huang, Hung-Lung Wang and Kun-Mao Chao. Computing the line-constrained k-center in the plane for small k

Sizhe Wang and Yinfeng Xu. Online k-max Search Algorithm with Applications to the Secretary Problem
13.00-14.30    Lunch break

 

Advertisements