Program
18:00–20:00 | 2 hours | WELCOME RECEPTION (location: conference venue) |
09:00–9:30 | 30 min |
Stephan Beyer, Markus Chimani, Ivo Hedtke and Michal Kotrbcik A Practical Method for the Minimum Genus of a Graph: Models and Experiments |
09:30–10:00 | 30 min |
Loukas Georgiadis, Giuseppe Italiano, Aikaterini Karanasiou, Charis Papadopoulos and Nikos Parotsidis Sparse Subgraphs for 2-Connectivity in Directed Graphs |
10:00–10:30 | 30 min |
Johannes Bader, Simon Gog and Matthias Petri Practical Variable Length Gap Pattern Matching using Wavelet Trees |
10:30–11:00 | 30 min |
Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Michael Horton and Stef Sijben Compact Flow Diagrams for State Sequences |
11:00–11:30 | 30 min | Coffee break |
11:30–12:30 | 60 min | INVITED TALK: Juliana Freire |
12:30–14:00 | 90 min | Lunch |
14:00–14:30 | 30 min |
Julien Subercaze, Christophe Gravier and Pierre-Olivier Rocher A merging heuristic for the rectangle decomposition of binary matrices |
14:30–15:00 | 30 min |
Ilias Kotsireas, Panos Pardalos, Konstantinos Parsopoulos and Dimitris Souravlias On the Solution of Circulant Weighing Matrices Problems Using Algorithm Portfolios on Multi-Core Processors |
15:00–15:30 | 30 min |
Taito Lee, Shuhei Denzumi and Kunihiko Sadakane Engineering Hybrid DenseZDDs |
15:30–16:00 | 30 min | Coffee break |
16:00–16:30 | 30 min |
Sándor Fekete, Andreas Haas, Michael Hemmer, Michael Hoffmann, Irina Kostitsyna, Dominik Krupke, Florian Maurer, Joseph Mitchell, Arne Schmidt, Christiane Schmidt and Julian Troegel Computing Nonsimple Polygons of Minimum Perimeter |
16:30–17:00 | 30 min |
Stephan S. Lorenzen and Pawel Winter Steiner Tree Heuristic in the Euclidean d-Space Using Bottleneck Distances |
17:00–17:30 | 30 min |
Moritz von Looz, Mario Wolter, Christoph R. Jacob and Henning Meyerhenke Better partitions of protein graphs for subsystem quantum chemistry |
17:30–18:00 | 30 min | BUSINESS MEETING |
09:00–9:30 | 30 min |
Moritz Baum, Julian Dibbelt, Thomas Pajor and Dorothea Wagner Dynamic Time-Dependent Route Planning in Road Networks with User Preferences |
09:30–10:00 | 30 min |
Mehrdad Niknami and Samitha Samaranayake Tractable Pathnding for the Stochastic On-Time Arrival Problem |
10:00–10:30 | 30 min |
Moritz Baum, Valentin Buchhold, Julian Dibbelt and Dorothea Wagner Fast Exact Computation of Isochrones in Road Networks |
10:30–11:00 | 30 min |
Peter Sanders and Christian Schulz Advanced Multilevel Node Separator Algorithms |
11:00–11:30 | 30 min | Coffee break |
11:30–12:30 | 60 min | INVITED TALK: Haim Kaplan. |
12:30–14:00 | 90 min | Lunch |
15:00–22:00 | 7 hours | EXCURSION to St. Isaac's Cathedral + CONFERENCE DINNER |
09:00–9:30 | 30 min |
Henrique Becker and Luciana S. Buriol UKP5: a New Algorithm for the Unbounded Knapsack Problem |
09:30–10:00 | 30 min |
Zhen Qiu, Clifford Stein and Yuan Zhong Experimental Analysis of Algorithms for Coflow Scheduling |
10:00–10:30 | 30 min |
Nourhan Sakr and Clifford Stein An Empirical Study of Online Packet Scheduling Algorithms |
10:30–11:00 | 30 min |
Jyrki Katajainen Worst-Case-Efficient Dynamic Arrays in Practice |
11:00–11:30 | 30 min | Coffee break |
11:30–12:30 | 60 min | INVITED TALK: Yurii Nesterov |
12:30–14:00 | 90 min | Lunch |
14:00–14:30 | 30 min |
Sebastiano Vigna, Marco Genuzio and Giuseppe Ottaviano Fast Scalable Construction of (Minimal Perfect Hash) Functions |
14:30–15:00 | 30 min |
Daniel Valenzuela CHICO: A Compressed Hybrid Index for Repetitive Collections |
15:00–15:30 | 30 min |
Joshimar Cordova and Gonzalo Navarro Practical Dynamic Entropy-Compressed Bitvectors with Applications |
15:30–16:00 | 30 min |
Djamal Belazzougui, Juha Kärkkäinen, Dominik Kempa and Simon Puglisi Lempel-Ziv Decoding in External Memory |
16:00–16:30 | 30 min | Coffee break |
16:30–17:00 | 30 min |
Jakob Dahlum, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash and Renato F. Wreck Accelerating Local Search for the Maximum Independent Set Problem |
17:00–17:30 | 30 min |
Matthias Poloczek and David Williamson An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem |
17:30–18:00 | 30 min |
Chun-Nam Yu, Michael Crouch, Ruichuan Chen and Alessandra Sala Online Algorithm for Approximate Quantile Queries on Sliding Windows |
18:00–18:10 | 10min | CLOSING |
18:30–20:30 | 2 hours | GOODBYE SEA HELLO CSR RECEPTION (location: conference venue) |