June 7 (Thursday)
- 8:30-8:50 Welcome coffee and registration
- 8:50-9:00 Opening
- 9:00-10:00 Invited Talk (Chair: Ralf Klasing)
- Friedhelm Meyer auf der Heide
Continuous Local Strategies for Robotic Formation Problems
- Friedhelm Meyer auf der Heide
- 10:00-10:20 Coffee break
- 10:20-12:00 Session: Route Planning & Shortest Paths (Chair: Matthias Müller-Hannemann)
- Dennis Luxen and Dennis Schieferdecker
Candidate Sets for Alternative Routes in Road Networks - Slides - Mattia D'Emidio, Gianlorenzo D'Angelo, Daniele Frigioni and Camillo Vitale
Fully Dynamic Maintenance of Arc-Flags in Road Networks - Slides - Dominik Kirchler, Leo Liberti and Roberto Wolfler Calvo
A label correcting algorithm for the shortest path problem on a multi-modal route network - Mattia D'Emidio, Gianlorenzo D'Angelo, Daniele Frigioni and Vinicio Maurizio
Engineering a new loop-free shortest paths routing algorithm - Slides
- Dennis Luxen and Dennis Schieferdecker
- 12:00 Lunch
- 13:40-15:20 Session: Data Structures, Strings & Bioinformatics I (Chair: Jyrki Katajainen)
- Simone Faro and Thierry Lecroq
A Multiple Sliding Windows Approach to Speed Up String Matching Algorithms - Slides - Gonzalo Navarro and Daniel Valenzuela
Space-Efficient Top-k Document Retrieval - Benjamin Albrecht and Volker Heun
Space Efficient Modifications to Structator - a Fast Index-Based Search Tool for RNA Sequence-Structure Patterns - Slides - Gonzalo Navarro and Eliana Providel
Fast, Small, Simple Rank/Select on Bitmaps
- Simone Faro and Thierry Lecroq
- 15:20-15:40 Coffee break
- 15:40-17:20 Session: Graphs I (Chair: Thierry Lecroq)
- Pierluigi Crescenzi, Roberto Grossi, Leonardo Lanzi and Andrea Marino
On Computing the Diameter of Real-World Directed (Weighted) Graphs - Slides - Georgios Georgiadis and Marina Papatriantafilou
Adaptive distributed b-matching in overlays with preferences - Slides - Annabell Berger and Matthias Müller-Hannemann
How to Attack the NP-complete Dag Realization Problem in Practice - Slides - Donatella Firmani, Giuseppe F. Italiano, Luigi Laura, Alessio Orlandi and Federico Santaroni
Computing Strong Articulation Points and Strong Bridges in Large Scale Graphs - Slides
- Pierluigi Crescenzi, Roberto Grossi, Leonardo Lanzi and Andrea Marino
- 17:30-18:45 Session: Optimization I (Chair: Annegret Wagler)
- Alberto Costa and Leo Liberti
Relaxations of multilinear convex envelopes: dual is better than primal - Slides - Christina Büsing and Fabio D'Andreagiovanni
New results about multi-band uncertainty in Robust Optimization - Rodrigo F. Toso, Casimir A. Kulikowski and Ilya B. Muchnik
A heuristic for non-convex variance-based clustering criteria
- Alberto Costa and Leo Liberti
- 18:45 Conference picture
- 19:00 Welcome party (Wine and cheese)
June 8 (Friday)
- 8:40-9:00 Coffee
- 9:00-10:00 Invited Talk (Chair: Francois Vanderbeck)
- Marco E. Lübbecke
Automatic Decomposition and Branch-and-Price: A Status Report
- Marco E. Lübbecke
- 10:00-10:20 Coffee break
- 10:20-12:00 Session: Graphs II (Chair: Adrian Kosowski)
- David Manlove and Gregg O'Malley
Paired and Altruistic Kidney Donation in the UK: Algorithms and Experimentation - Slides - Eric Angel, Romain Campigotto and Christian Laforest
Implementation and Comparison of Heuristics for the Vertex Cover Problem on Huge Graphs - Slides - Martin Dietzfelbinger, Hendrik Peilke and Michael Rink
A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs - Slides - Ilya Safro, Peter Sanders and Christian Schulz
Advanced Coarsening Schemes for Graph Partitioning
- David Manlove and Gregg O'Malley
- 12:00 Lunch
- 13:40-14:55 Session: Data Structures, Strings & Bioinformatics II (Chair: Mirosław Korzeniowski)
- Masashi Kiyomi, Yoshio Okamoto and Toshiki Saitoh
Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data - Slides - Stelios Joannou and Rajeev Raman
Dynamizing Succinct Tree Representations - Andrei Negoescu, Gabriel Moruz, Volker Weichert and Christian Neumann
Engineering Efficient Paging Algorithms - Slides
- Masashi Kiyomi, Yoshio Okamoto and Toshiki Saitoh
- 14:55-15:10 Coffee break
- 15:10-16:25 Session: Network Mining & Sorting (Chair: David Manlove)
- Farnaz Moradi, Tomas Olovsson and Philippas Tsigas
An Evaluation of Community Detection Algorithms on Large-Scale Email Traffic - Slides - Guillaume Fertin, Hafedh Mohamed Babou and Irena Rusu
Algorithms for subnetwork mining in heterogeneous networks - Slides - Amr Elmasry, Jyrki Katajainen and Max Stenmark
Branch Mispredictions Don't Affect Mergesort - See the following web-page
- Farnaz Moradi, Tomas Olovsson and Philippas Tsigas
- 17:15-23:00 Social event and banquet:
- 17:15 Departure from the LaBRI
- 18:15 Meeting in front of the Grand Théâtre. If you wish to go by tram, take line B to 'Grand Théâtre' stop.
- 18:15-19:00: Guided visit of the city centre. Group will be splitted into two groups of 25 persons.
- 19:00 Meeting on 'ponton d'honneur'.
- 19:00-20:30: Boat tour on the river.
- 20:30-23:00: Banquet dinner at restaurant 'Fernand'. Address: 7 quai de la Douane.
- Social event details on the map
June 9 (Saturday)
- 8:40-9:00 Coffee
- 9:00-10:00 Invited Talk (Chair: Martin Dietzfelbinger)
- Peter Sanders
Engineering Graph Partitioning Algorithms - Slides
- Peter Sanders
- 10:00-10:20 Coffee break
- 10:20-11:35 Session: Graphs & Voting Protocols (Chair: Christian Laforest)
- Michael Rice and Vassilis Tsotras
Exact Graph Search Algorithms for Generalized Traveling Salesman Path Problems - Slides - Annalisa D'Andrea and Guido Proietti
Reoptimizing the strengthened metric TSP on multiple edge weight modifications - Slides - Jörg Rothe and Lena Schend
Control Complexity in Bucklin, Fallback, and Plurality Voting: An Experimental Approach - Slides
- Michael Rice and Vassilis Tsotras
- 11:45-13:00 Session: Optimization II (Chair: Arnaud Pêcher)
- Sonia Cafieri, Pierre Hansen, Lucas Létocart, Leo Liberti and Frédéric Messine
Compact relaxations for polynomial programming problems - Slides - Pierre Pesneau, Ruslan Sadykov and Francois Vanderbeck
Feasibility Pump Heuristics for Column Generation Approaches - Slides - Jose L. Walteros and Panos M. Pardalos
A Decomposition Approach for Solving Critical Clique Detection Problems
- Sonia Cafieri, Pierre Hansen, Lucas Létocart, Leo Liberti and Frédéric Messine
- 13:00 Lunch