CALL FOR PARTICIPATION
***********************************
27th International Workshop on Combinatorial Algorithms (IWOCA 2016)
Helsinki, Finland, August 17–19, 2016
http://iwoca2016.cs.helsinki.fi/**Early registration deadline July 1st**
PROGRAM
August 17 (Wednesday)
8:30-8:55 Registration
8:55-9:00 Welcome
09:00-09:50 Invited talk: Leslie Anne Goldberg
Approximately counting list H-colourings
9:50-10:40 Session 1: Computational complexity
Guillaume Ducoffe, Sylvain Legay and Nicolas Nisse. On the complexity of computing the tree-breadth
Martin Böhm and Pavel Veselý. Online Chromatic Number is PSPACE-Complete
10:40-11:00 Coffee break
11:00-12:40 Session 2: Computational geometry
Radoslav Fulek. Bounded embeddings of graphs in the plane
Stefan Funke, Filip Krumpe and Sabine Storandt. Crushing Balls Efficiently
Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet and Michiel Smid. Essential Constraints of Edge-Constrained Proximity Graphs
Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari and Michiel Smid. Plane Bichromatic Trees of Low Degree
12:40-14:20 Lunch break
14:20-16:00 Session 3: Networks
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi and Luca Versari. Directing Road Networks in Each Feasible Way
Gennaro Cordasco, Luisa Gargano, Adele Rescigno and Ugo Vaccaro. Evangelism in Social Networks
Gianlorenzo D'Angelo, Mattia D'Emidio and Daniele Frigioni. Distance Queries in Large-Scale Fully Dynamic Complex Networks
Yuya Higashikawa, Siu-Wing Cheng, Tsunehiko Kameda, Naoki Katoh and Shun Saburi. Minimax Regret 1-Median Problem in Dynamic Path Networks
16:00-16:20 Coffee break
16:20-17:35 Session 4: Enumeration
Tiziana Calamoneri, Mattia Gastaldello, Arnaud Mary, Marie-France Sagot and Blerina Sinaimeri. On Maximal Chain Subgraphs and Covers of Bipartite Graphs
Max Alekseyev. Weighted de Bruijn Graphs for the Menage Problem and Its Generalizations
Haruka Mizuta, Takehiro Ito and Xiao Zhou. Reconfiguration of Steiner Trees in an Unweighted Graph
August 18 (Thursday)