Tuesday 26th June

17:00-19:00Registration Desk Opens
19:00-21:00Welcome Reception

Wednesday 27th June

09:00-10:00Invited talkSimon J. Puglisi
10:00-10:30Coffee Break
Session 1Graph PartitioningChair: Pilipczuk
10:30-10:55 Network Flow-Based Refinement for Multilevel Hypergraph PartitioningSebastian Schlag, Peter Sanders and Tobias Heuer
10:55-11:20 Aggregative Coarsening for Multilevel Hypergraph PartitioningRuslan Shaydulin and Ilya Safro
11:20-11:45 Memetic Graph ClusteringSonja Biedermann, Monika Henzinger, Christian Schulz and Bernhard Schuster
11:45-12:10 ILP-based Local Search for Graph PartitioningAlexandra Henzinger, Alexander Noe and Christian Schulz
Session 2TransportationChair: Schultz
14:00-14:25 How good are Popular Matchings? Krishnapriya A M, Meghana Nasre, Prajakta Nimbhorkar and Amit Rawat
14:25-14:50 The Steiner Multi Cycle Problem with applications to a Collaborative Truckload Problem Vinicius De Novaes Guimarães Pereira, Mário César San Felice, Pedro Henrique Hokama and Eduardo Xavier
14:50-15:15 Real-Time Traffic Assignment Using Fast Queries in Customizable Contraction Hierarchies Valentin Buchhold, Peter Sanders and Dorothea Wagner
15:15-15:45Coffee Break
Session 3IP+MatchingChair: Puglisi
15:45-16:10 A 3/2-approximation algorithm for the Student-Project Allocation problemFrances Cooper and David Manlove
16:10-16:35 Fleet management for autonomous vehicles using multicommodity coupled flows in time-expanded networksSahar Bsaybes, Alain Quilliot and Annegret Wagler
16:35-17:00 Evaluating and Tuning n-fold Integer Programming Kateřina Altmanová, Dušan Knop and Martin Koutecký
17:00-17:25 A Computational Investigation on the Strength of Dantzig-Wolfe Reformulations Michael Bastubbe, Marco Lübbecke and Jonas Witt
17:25-18:25Business Meeting
18:25-20:00City TourGuided walk in the city of L’Aquila

Thursday 28th June

09:00-10:00Invited talk Dorothea Wagner
10:00-10:30Coffee Break
Session 4Graph AlgorithmsChair: Wagner
10:30-10:55 Experimental Evaluation of Parameterized Algorithms for Feedback Vertex Set Krzysztof Kiljan and Marcin Pilipczuk
10:55-11:20 An Efficient Local Search for the Minimum Independent Dominating Set Problem Kazuya Haraguchi
11:20-11:45 Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness Wojciech Nadara, Marcin Pilipczuk, Roman Rabinovich, Felix Reidl and Sebastian Siebertz
11:45-12:10 Multi-Level Steiner Trees Abu Reyan Ahmed, Patrizio Angelini, Faryad Darabi Sahneh, Alon Efrat, David Glickenstein, Martin Gronemann, Niklas Heinsohn, Stephen Kobourov, Richard Spence, Joe Watkins and Alexander Wolff
Session 5StringsChair: Wagler
14:00-14:25 Dictionary Matching in Elastic-Degenerate Texts with Applications in Searching VCF Files On-line Solon Pissis and Ahmad Retha
14:25-14:50 Fast matching statistics in small space Djamal Belazzougui, Fabio Cunial and Olgert Denas
14:50-15:15 Practical lower and upper bounds for the Shortest Linear Superstring Bastien Cazaux, Samuel Juhel and Eric Rivals
15:15-15:45Coffee Break
Session 6MiscellaneousChair: Flammini
15:45-16:10 Experimental Study of Compressed Stack Algorithms in Limited Memory Environments Jean-Francois Baffier, Yago Diez Donoso and Matias Korman
16:10-16:35 Restructuring expression dags for efficient parallelization Martin Wilhelm
17:00-20:00Social Event Visit to Fontecchio Village, Bominaco Church and Bominaco Castle
20:00-23:00Social DinnerRestaurant Relais Elodia

Friday 29th June

09:00-10:00Invited talk Giuseppe F. Italiano
10:00-10:30Coffee Break
Session 7GraphsChair: Italiano
10:30-10:55 Enumerating Graph Partitions Without Too Small Connected Components Using Zero-suppressed Binary and Ternary Decision DiagramsYu Nakahata, Jun Kawahara and Shoji Kasahara
10:55-11:20 Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and ExperimentsMarkus Chimani, Ivo Hedtke and Tilo Wiedera
11:20-11:45 A linear-time algorithm for finding induced planar subgraphsShixun Huang, Zhifeng Bao, Shane Culpepper, Ping Zhang and Bang Zhang
11:45-12:10 Fast spherical drawing of triangulations: an experimental study of graph drawing toolsLuca Castelli Aleardi, Gaspard Denis and Eric Fusy
Session 8MiscellaneousChair: D'Emidio
14:00-14:25 Decision Diagrams for solving a job scheduling problem under precedence constraintsKosuke Matsumoto, Kohei Hatano and Eiji Takimoto
14:25-14:50 Speeding up Dualization in the Fredman-Khachiyan Algorithm Nafiseh Sedaghat, Tamon Stephen and Leonid Chindelevitch
14:50-15:15 An Ambiguous Coding Scheme for Selective Encryption of High-Entropy Volumes M. Oguzhan Kulekci
15:15-15:45Coffee Break
Session 9Graph AlgorithmsChair: Rivals
15:45-16:10 Engineering motif search for large motifsPetteri Kaski, Juho Lauri and Suhas Thejaswi
16:10-16:35 Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation Michał Ziobro and Marcin Pilipczuk
16:35-17:00 Isomorphism test for digraphs with weighted edges Adolfo Piperno