SEA 2017

16th International Symposium on Experimental Algorithms

King's College London, UK, June 21–23, 2017

Conference

Local information

Proceedings

Other Links

Programme

Wednesday | Thursday | Friday

Wednesday, 21 June, 2017

8:00 - 8:55
Registration
8:55 - 9:00
Opening and Welcome by Professor Luca Viganò
Head of the Department of Informatics and Vice-Dean for International
 
Invited Talk I
9:00 - 10:00
Ruth Misener
Designing Energy-Efficient Heat Recovery Networks using Mixed-Integer Nonlinear Optimisation
 
10:00 - 10:20
Coffee Break
 
Session I
10:20 - 10:45
Christian Schulz and Jesper Larsson Träf
Better Process Mapping and Sparse Quadratic Assignment
10:45 - 11:10
Leo Liberti and Claudia D'Ambrosio
The Isomap algorithm in distance geometry
11:10 - 11:35
Robert Lion Gottwald, Stephen Maher and Yuji Shinano
Distributed domain propagation
11:35 - 12:00
Pankaj Agarwal, Nirman Kumar, Stavros Sintos and Subhash Suri
Efficient Algorithms for k-Regret Minimizing Sets
 
12:00 - 14:00
Lunch
 
Session II
14:00 - 14:25
Amariah Becker, Eli Fox-Epstein, Philip Klein and David Meierfrankenfeld
Engineering an Approximation Scheme for Traveling Salesman in Planar Graphs
14:25 - 14:50
Loukas Georgiadis, Giuseppe F. Italiano and Aikaterini Karanasiou
Approximating the Smallest 2-Vertex-Connected Spanning Subgraph via Low-High Orders
14:50 - 15:15
Michael Huang and Clifford Stein
Extending Search Phases in the Micali-Vazirani Algorithm
 
15:15 - 15:45
Coffee Break
 
Session III
15:45 - 16:10
Nicola Prezza
A Framework of Dynamic Data Structures for String Processing
16:10 - 16:35
Niklas Baumstark, Simon Gog, Tobias Heuer and Julian Labeit
Practical Range Minimum Queries Revisited
16:35 - 17:00
Patrick Dinklage, Johannes Fischer, Dominik Köppl, Marvin Löbel and Kunihiko Sadakane
Compression with the tudocomp Framework
 
17:15 - 18:00
Business Meeting

Thursday, 22 June, 2017

Invited Talk II
9:00 - 10:00
Martin Farach-Colton
Dictionaries Revisited
 
10:00 - 10:20
Coffee Break
 
Session IV
10:20 - 10:45
Jihyuk Lim and Kunsoo Park
Algorithm Engineering for All-Pairs Suffix-Prefix Matching
10:45 - 11:10
Niklas Baumstark, Simon Gog, Tobias Heuer and Julian Labeit
The Quantile Index – Succinct Self-Index for Top-k Document Retrieval
11:10 - 11:35
Paulo Fonseca and Israel Silva
Online construction of wavelet trees
11:35 - 12:00
Juha Kärkkäinen and Dominik Kempa
Engineering External Memory LCP Array Construction: Parallel, In-Place and Large Alphabet
 
12:00 - 14:00
Lunch
 
Session V
14:00 - 14:25
Stefan Funke, Soeren Laue and Sabine Storandt
Personal Routes with High-Dimensional Costs and Dynamic Approximation Guarantees
14:25 - 14:50
Moritz Baum, Jonas Sauer, Tobias Zündorf and Dorothea Wagner
Consumption Profiles in Route Planning for Electric Vehicles: Theory and Applications
14:50 - 15:15
Lars Briem, Sebastian Buck, Holger Ebhart, Nicolai Mallig, Ben Strasser, Peter Vortisch, Dorothea Wagner, and Tobias Zündorf
Efficient Traffic Assignment for Public Transit Networks
 
15:15 - 15:45
Coffee Break
 
Session VI
15:45 - 16:10
Sebastian Schlag and Tobias Heuer
Improving Coarsening Schemes for Hypergraph Partitioning by Exploiting Community Structure
16:10 - 16:35
Julie Meissner, Nicole Megow and Jacob Focke
Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments
16:35 - 17:00
Elisabetta Bergamini, Henning Meyerhenke, Mark Ortmann and Arie Slobbe
Faster Betweenness Centrality Updates in Evolving Networks

Friday, 23 June, 2017

Invited Talk III
9:00 - 10:00
Graham Cormode
Engineering Streaming Algorithms
 
10:00 - 10:20
Coffee Break
 
Session VII
10:20 - 10:45
Andrei Alexandrescu
Fast Deterministic Selection
10:45 - 11:10
Antoine Limasset, Guillaume Rizk, Rayan Chikhi and Pierre Peterlongo
Fast and scalable minimal perfect hashing for massive key sets
11:10 - 11:35
Manuel Penschuck
Generating practical random hyperbolic graphs in near-linear time and with sub-linear memory
11:35 - 12:00
Loukas Georgiadis, Konstantinos Giannis, Aikaterini Karanasiou and Luigi Laura
Incremental Low-High Orders of Directed Graphs and Applications
 
12:00 - 14:00
Lunch
 
Session VIII
14:00 - 14:25
Max Bannach, Sebastian Berndt and Thorsten Ehlers
Jdrasil: A Modular Library for Computing Tree Decompositions
14:25 - 14:50
Stefano Coniglio and Stefano Gualandi
On the separation of topology-free rank inequalities for the max stable set problem
14:50 - 15:15
Orlando Moreira, Merten Popp and Christian Schulz
Graph Partitioning with Acyclicity Constraints
 
15:15 - 15:45
Coffee Break
 
Session IX
15:45 - 16:10
Nicola Basilico, Stefano Coniglio, Nicola Gatti and Alberto Marchesi
Bilevel programming approaches to the computation of optimistic and pessimistic single-leader-multi-follower equilibria
16:10 - 16:35
Daniyah Aloqalaa, Jenny Hodgson and Prudence W.H. Wong
The Impact of Landscape Sparsification on Modelling and Analysis of the Invasion Process
16:35 - 17:00
Miguel A. Mosteiro and Harshita Kudaravalli
Ad-hoc Affectance-selective Families for Layer Dissemination