Programme
Wednesday, 21 June, 2017
Registration | |
Opening and Welcome by Professor Luca Viganò Head of the Department of Informatics and Vice-Dean for International | |
Ruth Misener Designing Energy-Efficient Heat Recovery Networks using Mixed-Integer Nonlinear Optimisation | |
Coffee Break | |
Christian Schulz and Jesper Larsson Träf Better Process Mapping and Sparse Quadratic Assignment | |
Leo Liberti and Claudia D'Ambrosio The Isomap algorithm in distance geometry | |
Robert Lion Gottwald, Stephen Maher and Yuji Shinano Distributed domain propagation | |
Pankaj Agarwal, Nirman Kumar, Stavros Sintos and Subhash Suri Efficient Algorithms for k-Regret Minimizing Sets | |
Lunch at The Knights Templar | |
Amariah Becker, Eli Fox-Epstein, Philip Klein and David Meierfrankenfeld Engineering an Approximation Scheme for Traveling Salesman in Planar Graphs | |
Loukas Georgiadis, Giuseppe F. Italiano and Aikaterini Karanasiou Approximating the Smallest 2-Vertex-Connected Spanning Subgraph via Low-High Orders | |
Michael Huang and Clifford Stein Extending Search Phases in the Micali-Vazirani Algorithm | |
Coffee Break | |
Nicola Prezza A Framework of Dynamic Data Structures for String Processing | |
Niklas Baumstark, Simon Gog, Tobias Heuer and Julian Labeit Practical Range Minimum Queries Revisited | |
Patrick Dinklage, Johannes Fischer, Dominik Köppl, Marvin Löbel and Kunihiko Sadakane Compression with the tudocomp Framework | |
Business Meeting |
Thursday, 22 June, 2017
Martin Farach-Colton Dictionaries Revisited | |
Coffee Break | |
Jihyuk Lim and Kunsoo Park Algorithm Engineering for All-Pairs Suffix-Prefix Matching | |
Niklas Baumstark, Simon Gog, Tobias Heuer and Julian Labeit The Quantile Index – Succinct Self-Index for Top-k Document Retrieval | |
Paulo Fonseca and Israel Silva Online construction of wavelet trees | |
Juha Kärkkäinen and Dominik Kempa Engineering External Memory LCP Array Construction: Parallel, In-Place and Large Alphabet | |
Lunch at Zizzi | |
Stefan Funke, Soeren Laue and Sabine Storandt Personal Routes with High-Dimensional Costs and Dynamic Approximation Guarantees | |
Moritz Baum, Jonas Sauer, Tobias Zündorf and Dorothea Wagner Consumption Profiles in Route Planning for Electric Vehicles: Theory and Applications | |
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 | |
Coffee Break | |
Sebastian Schlag and Tobias Heuer Improving Coarsening Schemes for Hypergraph Partitioning by Exploiting Community Structure | |
Julie Meissner, Nicole Megow and Jacob Focke Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments | |
Elisabetta Bergamini, Henning Meyerhenke, Mark Ortmann and Arie Slobbe Faster Betweenness Centrality Updates in Evolving Networks |
Friday, 23 June, 2017
Graham Cormode Engineering Streaming Algorithms | |
Coffee Break | |
Andrei Alexandrescu Fast Deterministic Selection | |
Antoine Limasset, Guillaume Rizk, Rayan Chikhi and Pierre Peterlongo Fast and scalable minimal perfect hashing for massive key sets | |
Manuel Penschuck Generating practical random hyperbolic graphs in near-linear time and with sub-linear memory | |
Loukas Georgiadis, Konstantinos Giannis, Aikaterini Karanasiou and Luigi Laura Incremental Low-High Orders of Directed Graphs and Applications | |
Lunch at Cafe Pacifico | |
Max Bannach, Sebastian Berndt and Thorsten Ehlers Jdrasil: A Modular Library for Computing Tree Decompositions | |
Stefano Coniglio and Stefano Gualandi On the separation of topology-free rank inequalities for the max stable set problem | |
Orlando Moreira, Merten Popp and Christian Schulz Graph Partitioning with Acyclicity Constraints | |
Coffee Break | |
Nicola Basilico, Stefano Coniglio, Nicola Gatti and Alberto Marchesi Bilevel programming approaches to the computation of optimistic and pessimistic single-leader-multi-follower equilibria | |
Daniyah Aloqalaa, Jenny Hodgson and Prudence W.H. Wong The Impact of Landscape Sparsification on Modelling and Analysis of the Invasion Process | |
Miguel A. Mosteiro and Harshita Kudaravalli Ad-hoc Affectance-selective Families for Layer Dissemination |