Accepted papers
- Yuta Fujishige, Michitaro Nakamura, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda. Finding gapped palindromes online
- Yuya Higashikawa, Siu-Wing Cheng, Tsunehiko Kameda, Naoki Katoh and Shun Saburi. Minimax Regret 1-Median Problem in Dynamic Path Networks
- Max Alekseyev. Weighted de Bruijn Graphs for the Menage Problem and Its Generalizations
- Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari and Michiel Smid. Plane Bichromatic Trees of Low Degree
- Pawel Gawrychowski and Łukasz Zatorski. Speeding up dynamic programming in the line-constrained k-median
- Gianlorenzo D'Angelo, Mattia D'Emidio and Daniele Frigioni. Distance Queries in Large-Scale Fully Dynamic Complex Networks
- Andreas Baertschi, Barbara Geissmann, Daniel Graf, Tomas Hruz, Paolo Penna and Thomas Tschager. On computing the total displacement number via weighted Motzkin paths
- Peter Damaschke. The Solution Space of Sorting with Recurring Comparison Faults
- Peter Damaschke. Computing Giant Graph Diameters
- Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet and Michiel Smid. Essential Constraints of Edge-Constrained Proximity Graphs
- Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane and Hiroki Arimura. Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing
- Piotr Wojciechowski and K. Subramani. A bit-scaling algorithm for integer feasibility in UTVPI constraints
- Xujin Chen, Zhuo Diao, Xiaodong Hu and Zhongzheng Tang. Sufficient Conditions for Tuza's Conjecture on Packing and Covering Triangles
- Guillaume Blin, Marie Gasparoux, Sebastian Ordyniak and Alexandru Popa. SOBRA - Shielding Optimization for BRAchytherapy
- Joan Boyar, Lene M. Favrholdt, Christian Kudahl and Jesper W. Mikkelsen. Weighted Online Problems with Advice
- Aravind N. R., Subrahmanyam Kalyanasundaram and Anjeneya Swami Kare. Linear Time Algorithms for Happy Vertex Coloring Problems for Trees
- Guillaume Ducoffe, Sylvain Legay and Nicolas Nisse. On the complexity of computing the tree-breadth
- 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
- Markus Chimani, Ivo Hedtke and Tilo Wiedera. Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem
- Stefan Funke, Filip Krumpe and Sabine Storandt. Crushing Balls Efficiently
- Martin Fürer. Faster Computation of Path-Width
- Radoslav Fulek. Bounded embeddings of graphs in the plane
- Konrad Kazimierz Dabrowski, Vadim Lozin and Daniel Paulusma. Well-quasi-ordering versus clique-width: new results on bigenic classes
- Jhoirene Clemente, Christian Kudahl, Dennis Komm and Juraj Hromkovič. Advice Complexity of the Online Search Problem
- Hassan Aboueisha, Shahid Hussain, Vadim Lozin, Jerome Monnot, Bernard Ries and Viktor Zamaraev. A boundary property for upper domination
- Gennaro Cordasco, Luisa Gargano, Adele Rescigno and Ugo Vaccaro. Evangelism in Social Networks
- Petr Golovach, Dieter Kratsch, Daniel Paulusma and Anthony Stewart. Finding Cactus Roots in Polynomial Time
- Robert Benkoczi, Ram Dahal and Daya Gaur. Exact Algorithms For Weighted Coloring In Special Classes of Tree and Cactus Graphs
- Kaushik Sarkar, Charles J. Colbourn, Annalisa De Bonis and Ugo Vaccaro. Partial Covering Arrays: Algorithms and Asymptotics
- Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi and Luca Versari. Directing Road Networks in Each Feasible Way
- Martin Böhm and Pavel Veselý. Online Chromatic Number is PSPACE-Complete
- Adrian Dumitrescu, Ritankar Mandal and Csaba Toth. Monotone paths in geometric triangulations
- Haruka Mizuta, Takehiro Ito and Xiao Zhou. Reconfiguration of Steiner Trees in an Unweighted Graph
- Moritz von Looz and Henning Meyerhenke. Querying Probabilistic Neighborhoods in Spatial Data Sets Efficiently
- Tiziana Calamoneri, Mattia Gastaldello, Arnaud Mary, Marie-France Sagot and Blerina Sinaimeri. On Maximal Chain Subgraphs and Covers of Bipartite Graphs