Preliminary program
August 17 (Wednesday)
Approximately counting list H-colourings (Chair: Simon Puglisi) |
(Chair: Leslie Ann Goldberg) | |
| 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 |
(Chair: Lene Monrad Favrholdt) | |
| Radoslav Fulek. Bounded embeddings of graphs in the plane | |
| Stefan Funke, Filip Krumpe and Sabine Storandt. Crushing Disks 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 |
(Chair: Alexandru Tomescu) | |
| Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi and Luca Versari. Directing Road Networks by Listing Strong Orientations | |
| 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 |
(Chair: Peter Damaschke) | |
| 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)
(Chair: Golnaz Badkobeh) | |
| Joan Boyar, Lene M. Favrholdt, Christian Kudahl and Jesper W. Mikkelsen. Weighted Online Problems with Advice | |
| Yuta Fujishige, Michitaro Nakamura, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda. Finding gapped palindromes online | |
| Jhoirene Clemente, Christian Kudahl, Dennis Komm and Juraj Hromkovič. Advice Complexity of the Online Search Problem | |
| Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane and Hiroki Arimura. Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing |
(Chair: Martin Fürer) | |
| Hassan Aboueisha, Shahid Hussain, Vadim Lozin, Jerome Monnot, Bernard Ries and Viktor Zamaraev. A boundary property for upper domination | |
| Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jerome Monnot and Vangelis Paschos. Upper Domination: Complexity and Approximation | |
| Konrad Kazimierz Dabrowski, Vadim Lozin and Daniel Paulusma. Well-quasi-ordering versus clique-width: new results on bigenic classes | |
| Xujin Chen, Zhuo Diao, Xiaodong Hu and Zhongzheng Tang. Sufficient Conditions for Tuza's Conjecture on Packing and Covering Triangles |
2-Connectivity Problems in Directed Graphs (Chair: Esko Ukkonen) |
(Chair: Shunsuke Inenaga) | |
| Aravind N. R., Subrahmanyam Kalyanasundaram and Anjeneya Swami Kare. Linear Time Algorithms for Happy Vertex Coloring Problems for Trees | |
| Pawel Gawrychowski and Łukasz Zatorski. Speeding up dynamic programming in the line-constrained k-median |
August 19 (Friday)
(Chair: Jukka Suomela) | |
| Guillaume Blin, Marie Gasparoux, Sebastian Ordyniak and Alexandru Popa. SOBRA - Shielding Optimization for BRAchytherapy | |
| Piotr Wojciechowski and K. Subramani. A bit-scaling algorithm for integer feasibility in UTVPI constraints | |
| Markus Chimani, Ivo Hedtke and Tilo Wiedera. Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem | |
| Robert Benkoczi, Ram Dahal and Daya Gaur. Exact Algorithms For Weighted Coloring In Special Classes of Tree and Cactus Graphs |
(Chair: Luisa Gargano) | |
| Petr Golovach, Dieter Kratsch, Daniel Paulusma and Anthony Stewart. Finding Cactus Roots in Polynomial Time | |
| Peter Damaschke. Computing Giant Graph Diameters | |
| Martin Fürer. Faster Computation of Path-Width | |
| Peter Damaschke. The Solution Space of Sorting with Recurring Comparison Faults |
Polynomial representations in algorithm design (Chair: Veli Mäkinen) |
(Chair: Petteri Kaski) | |
| Adrian Dumitrescu, Ritankar Mandal and Csaba Toth. Monotone paths in geometric triangulations | |
| Andreas Baertschi, Barbara Geissmann, Daniel Graf, Tomas Hruz, Paolo Penna and Thomas Tschager. On computing the total displacement number via weighted Motzkin paths |
(Chair: Juha Karkkainen) | |
| Kaushik Sarkar, Charles J. Colbourn, Annalisa De Bonis and Ugo Vaccaro. Partial Covering Arrays: Algorithms and Asymptotics | |
| Moritz von Looz and Henning Meyerhenke. Querying Probabilistic Neighborhoods in Spatial Data Sets Efficiently |