Sunday
17:00-19:00	Registration Desk Opens
19:00-21:00	Welcome Reception
Monday
8:50-9:00	Opening
9:00-10:00	Invited Talk (Paul Spirakis), Session Chair: Christian Schulz, Link to Slides Algorithmic Problems on Temporal Graphs and a call for experiments. Abstract : Research on Temporal Graphs has expanded in the last few years. Most of the results till now, address problems related to the notion of Temporal Paths (and Temporal Connectivity). In this talk, we focus, instead, on problems whose main topic is not on Temporal Paths. In particular, we will discuss Temporal Vertex Covers, the notion of Temporal Transitivity, and also issues and models of stochastic temporal graphs.  We believe that several algorithmic graph problems, not directly related to paths, can be raised  in the temporal domain. This may motivate new research towards lifting more topics of algorithmic graph theory to the temporal case. We also notice that not many experimental results have addressed the above problems. We stress the need for new experimental algorithms, especially for the computationally hard Instances of such problems.
10:00-10:30	Coffee Break
Session 1	Strings et al (Session Chair Jose Rolim)
10:30-11:10	Fast Succinct Retrieval and Approximate Membership using Ribbon (Best Paper)
11:10-11:35	Computing Maximal Unique Matches with the r-index
11:35-12:00	Parallel Flow-Based Hypergraph Partitioning
12:00-14:00	Lunch
Session 2	Graph Algorithms I (Session Chair Hisao Tamaki)
14:00-14:25	Relating real and synthetic social networks through centrality measures
14:25-14:50	Discrete Hyperbolic Random Graph Model
14:50-15:15	Solving and Generating Nagareru Puzzles
15:15-15:45	Coffee Break
Session 3	Route Planning (Session Chair Dennis Luxen)
15:45-16:10	Fast Computation of Shortest Smooth Paths and Uniformly Bounded Stretch with Lazy RPHAST
16:10-16:35	Routing in multimodal transportation networks with non-scheduled lines
16:35-17:00	Stochastic Route Planning for Electric Vehicles
17:25-18:25	Business Meeting
19:15-20:00	City Tour
Tuesday
8:50-9:00	Opening
9:00-10:00	Invited Talk (Tobias Achterberg), Session Chair Leo Liberti (Link to slides): Combinatorial algorithms used inside a MIP solver Abstract: State-of-the-art solvers for mixed integer programs (MIP) need to solve a variety of combinatorial sub-problems in many of the components of the solver, for example in presolving, cutting plane separation, node selection, the simplex algorithm, or the barrier algorithm. Some of these sub-problems are solvable in polynomial time while others are NP hard.
10:00-10:30	Coffee Break
Session 4	Graph Algorithms II (Session Chair Michael Goodrich)
10:30-10:55	RLBWT Tricks
10:55-11:20	Digraph k-Coloring Games: from Theory to Practice [Slides]
11:20-11:45	A branch-and-bound algorithm for cluster editing
11:45-14:00	Lunch
Session 5	Learning and Optimization I (Session Chair Mattia D'Emidio)
14:00-14:25	Efficient Exact Learning Algorithms for Road Networks and Other Graphs with Bounded Clustering Degrees
14:25-14:50	On the Satisfiability of Smooth Grid CSPs.
14:50-15:15	Practical performance of Random Projections in Linear Programming
15:15-15:45	Coffee Break
Session 6	Graph Algorithms III (Session Chair Sebastian Schlag)
15:45-16:10	Efficient and Accurate Group Testing via Belief Propagation: an Empirical Study
16:10-16:35	A Parallel Framework for Approximate Max-Dicut in Partitionable Graphs
16:35-17:00	An Experimental Study of Algorithms for Packing Arborescences
17:00-20:00	Social Event -- Hike
20:00-23:00	Social Dinner (at Sattelkammer at the Castle)
Wednesday
8:50-9:00	Opening
9:00-10:00	Invited Talk (Cynthia A. Phillips), Session Chair Bora Uçar, Link to Slides Unique experimental algorithms for national security applications Government/national-security combinatorial optimization problems frequently have some twist. This might be unusual constraints, structure of input data, or computing platform. Almost all require some degree of confidence in the solution through experimental analysis on real or realistic data. These experimental analyses frequently raise novel algorithmic questions. In this talk, we will tell the story, and open questions, around at least three such applications: how and why we needed to make open social-network data sets "more human;" validating implementations of history-independent data structures; and a special case of randomized rounding.
10:00-10:30	Coffee Break
Session 7	Learning and Optimization II (Session Chair Mateus de Oliveira Oliveira)
10:30-10:55	An adaptive refinement algorithm for discretizations of nonconvex QCQP
10:55-11:20	Efficient Minimum Weight Vertex Cover Heuristics using Graph Neural Networks
11:20-11:45	Automatic Reformulations for Convex Mixed-Integer Nonlinear Optimization: Perspective and Separability
11:45-12:10	An Experimental Evaluation of Semidefinite Programming and Spectral Algorithms for Max Cut
12:10-14:00	Lunch
Session 8	Graph Algorithms IV (Session Chair Peter Sanders)
14:00-14:25	A Fast Data Structure for Dynamic Graphs Based on Hash-Indexed Adjacency Blocks
14:25-14:50	Heuristic computation of exact treewidth
14:50-15:00	Closing
15:00-15:30	Coffee Break