| 08:50-09:00 | Opening | |
| 09:00-10:00 | Invited talk | Simon J. Puglisi |
| 10:00-10:30 | Coffee Break | |
| Session 1 | Graph Partitioning | Chair: Pilipczuk |
| 10:30-10:55 |
Network Flow-Based Refinement for Multilevel Hypergraph Partitioning | Sebastian Schlag, Peter Sanders and Tobias Heuer |
| 10:55-11:20 |
Aggregative Coarsening for Multilevel Hypergraph Partitioning | Ruslan Shaydulin and Ilya Safro |
| 11:20-11:45 |
Memetic Graph Clustering | Sonja Biedermann, Monika Henzinger, Christian Schulz and Bernhard Schuster |
| 11:45-12:10 |
ILP-based Local Search for Graph Partitioning | Alexandra Henzinger, Alexander Noe and Christian Schulz |
| 12:10-14:00 | Lunch | |
| Session 2 | Transportation | Chair: 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:45 | Coffee Break | |
| Session 3 | IP+Matching | Chair: Puglisi |
| 15:45-16:10 |
A 3/2-approximation algorithm for the Student-Project Allocation problem | Frances Cooper and David Manlove |
| 16:10-16:35 |
Fleet management for autonomous vehicles using multicommodity coupled flows in time-expanded networks | Sahar 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:25 | Business Meeting | |
| 18:25-20:00 | City Tour | Guided walk in the city of L’Aquila
|
| 09:00-10:00 | Invited talk | Dorothea Wagner |
| 10:00-10:30 | Coffee Break | |
| Session 4 | Graph Algorithms | Chair: 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 |
| 12:10-14:00 | Lunch | |
| Session 5 | Strings | Chair: 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:45 | Coffee Break | |
| Session 6 | Miscellaneous | Chair: 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:00 | Social Event
|
Visit to Fontecchio Village, Bominaco Church and Bominaco Castle
|
| 20:00-23:00 | Social Dinner | Restaurant Relais Elodia |
| 09:00-10:00 | Invited talk | Giuseppe F. Italiano |
| 10:00-10:30 | Coffee Break | |
| Session 7 | Graphs | Chair: Italiano |
| 10:30-10:55 |
Enumerating Graph Partitions Without Too Small Connected Components Using Zero-suppressed Binary and Ternary Decision Diagrams | Yu Nakahata, Jun Kawahara and Shoji Kasahara |
| 10:55-11:20 |
Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments | Markus Chimani, Ivo Hedtke and Tilo Wiedera |
| 11:20-11:45 |
A linear-time algorithm for finding induced planar subgraphs | Shixun 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 tools | Luca Castelli Aleardi, Gaspard Denis and Eric Fusy |
| 12:10-14:00 | Lunch | |
| Session 8 | Miscellaneous | Chair: D'Emidio |
| 14:00-14:25 |
Decision Diagrams for solving a job scheduling problem under precedence constraints | Kosuke 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:45 | Coffee Break | |
| Session 9 | Graph Algorithms | Chair: Rivals |
| 15:45-16:10 |
Engineering motif search for large motifs | Petteri 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 |
| 17:00-17:05 | Closing | |
