Monday 17th July	Tuesday 18th July	Wednesday 19th July	Thursday 20th July	Friday 21st July
9:00	Invited Talk	Invited Talk	Invited Talk	Invited Talk	Invited Talk
10:00	Morning Tea	Morning Tea	Morning Tea	Morning Tea	Morning Tea
10:30	Neeldhara Misra and I. Vinod Reddy "The Parameterized Complexity of Happy Colorings"	Shiho Sugimoto, Naoki Noda, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda "Computing Abelian string regularities based on RLE"	Sven Mallach "Linear Ordering Based MIP Formulations for the Vertex Separation or Pathwidth Problem"	Josep Domingo-Ferrer "Privacy-Preserving and Co-Utile Distributed Social Credit"	Talks Only 1
11:00	Akanksha Agrawal "On the Parameterized Complexity of Happy Vertex Coloring"	Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda "Shortest Unique Palindromic Substring Queries in Optimal Time"	Ramesh Rajaby and Wing-Kin Sung "Interval-based maximum bipartite matching and its application to summarize two trees"	Andrei Kelarev, Jennifer Seberry, Leanne Rylands and Xun Yi "Combinatorial algorithms and methods for security of statistical databases related to the work of Mirka Miller"
11:30	Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau and Rémi Watrigant "Complexity Dichotomies for the Minimum F-Overlay Problem"	Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos and Solon P. Pissis "How to answer a small batch of RMQs or LCA queries in practice"	Narayan Vikas "Computational Complexity Relationship between Compaction, Vertex-Compaction, and Retraction"	Sergiu Carpov, Pascal Aubry and Renaud Sirdey "A multi-start heuristic for multiplicative depth minimization of boolean circuits"
12:00	Lunch	Lunch	Lunch	Lunch	Lunch
13:30	John Ellis and Ulrike Stege "A Practical, Provably Average Case Linear Time, In-place and Stable Merge Algorithm via the Perfect Shuffle"	Markus Chimani, Stefan Felsner, Stephen Kobourov, Torsten Ueckerdt, Pavel Valtr and Alexander Wolff "On the Maximum Crossing Number"	Excursion	Vadim Lozin "Graph Parameters and Ramsey Theory"	Talks Only 2
14:00	Tatsuya Ohno, Yoshimasa Takabatake, Tomohiro I and Hiroshi Sakamoto "A Faster Implementation of Online Run-Length Burrows-Wheeler Transform"	Oswin Aichholzer, Martin Balko, Thomas Hackl, Alexander Pilz, Pedro Ramos, Pavel Valtr and Birgit Vogtenhuber "Holes in 2-convex point sets"		Cyriac Grigorious, Thomas Kalinowski and Sudeep Stephen "On the power domination number of de Bruijn and Kautz digraphs"
14:30	Bogdan Alecu, Vadim Lozin, Victor Zamaraev and Dominique de Werra "Letter graphs and geometric grid classes of permutations: characterization and recognition"	Alexandre Blondin Massé, Julien de Carufel, Alain Goupil and Maxime Samson "Fully Leafed Tree-Like Polyominoes and Polycubes"		Hovhannes Harutyunyan and Zhiyuan Li "Improved lower bound on broadcast function based on graph partition"
15:00	Afternoon Tea	Afternoon Tea		Afternoon Tea	Afternoon Tea
15:30	Rhydian Lewis, Kate Smith-Miles and Kyle Phillips "The School Bus Routing Problem: An Analysis and Algorithm"	Benoit Darties, Annie Chateau, Rodolphe Giroudeau and Matthias Weller "Improved Complexity for Power Edge Set Problem"		Michel Vasquez and Yannick Vimont "On solving the queen graph coloring problem"	Open Problem Session
16:00	Robin Milosz and Sylvie Hamel "Heuristic, Branch-and-Bound Solver and Improved Space Reduction for the Median of Permutations Problem"	Federico Della Croce, Ulrich Pferschy and Rosario Scatamacchia "Approximation Results for the Incremental Knapsack Problem"		Uwe Schauz "Orientations of 1-Factorizations and the List Chromatic Index of Small Graphs"
16:30	Hanyu Gu, Julia Memar and Yakov Zinder "Efficient Lagrangian Heuristics for the Two-Stage Flow Shop with Job Dependant Buffer Requirements"	Hiroki Oshima "Derandomization for k-submodular maximization"		Matěj Konečný, Stanislav Kučera, Jana Novotná, Jakub Pekárek, Štěpán Šimsa and Martin Töpfer "Minimal Sum Labeling of Graphs"
17:00
18:00 - 21:00				Conference Dinner