Accepted Papers

  • Meirav Zehavi. The k-Leaf Spanning Tree Problem Admits a Klam Value of 39
  • Francine Blanchet-Sadri, Rachel Harred and Justin Lazarow. Longest Common Extensions in Partial Words
  • Mohammed Abdullah, Colin Cooper and Moez Draief. Speeding Up Cover Time of Sparse Graphs Using Local Knowledge
  • Dušan Knop and Tomáš Masařík. Computational complexity of distance edge labeling
  • Luca Ferrari. Schröder partitions and Schröder tableaux
  • Joan Boyar and Christian Kudahl. Adding isolated vertices makes some online algorithms optimal
  • Klaus Jansen and Stefan Kraft. A Faster FPTAS for the Unbounded Knapsack Problem
  • Petr Golovach, Pinar Heggernes and Dieter Kratsch. Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs
  • Carla Binucci, Emilio Di Giacomo, Md. Iqbal Hossain and Giuseppe Liotta. 1-page and 2-page Drawings with Bounded Number of Crossings per Edge
  • Robert Ganian, Eduard Eiben and Juho Lauri. On the Complexity of Rainbow Coloring Problems
  • Hasna Mohsen Alqahtani and Thomas Erlebach. Minimum Activation Cost Edge-Disjoint Paths in Graphs with Bounded Tree-Width
  • Konrad Dabrowski, Francois Dross, Matthew Johnson and Daniel Paulusma. Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs
  • Daniel Freund, Matthias Poloczek and Daniel Reichman. Contagious Sets in Dense Graphs
  • Jou-Ming Chang, Ton Kloks and Hung-Lung Wang. Gray codes for AT-free orders via antimatroids
  • Alessio Conte, Roberto Grossi, Andrea Marino and Romeo Rizzi. Enumerating Cyclic Orientations of a Graph
  • Guillaume Fertin, Irena Rusu and Stéphane Vialette. Algorithmic aspects of the S-Labeling problem
  • Myoungji Han, Munseong Kang, Sukhyeun Cho, Geonmo Gu, Jeong Seop Sim and Kunsoo Park. Fast Multiple Order-Preserving Matching Algorithms
  • Gabriele Farina and Luigi Laura. Dynamic subtrees queries revisited: the Depth First Tour Tree
  • Gilad Kutiel, Reuven Bar-Yehuda and Dror Rawitz. 1.5-Approximation Algorithm for the 2-Convex Recoloring Problem
  • Felipe A. Louza and Guilherme P. Telles. Computing the BWT and the LCP Array in Constant Space
  • Mikhail Rubinchik and Arseny Shur. Eertree: An Efficient Data Structure for Processing Palindromes in Strings
  • Vít Jelínek, Eva Jelinkova and Jan Kratochvil. On the hardness of switching to a small number of edges
  • Toru Hasunuma. Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees
  • Frederic Giroire, Stephane Perennes and Issam Tahiri. How to design graphs with low forwarding index and limited number of edges
  • Gabriele Di Stefano, Pietro Montanari and Alfredo Navarra. About Ungatherability of Oblivious and Asynchronous Robots on Anonymous Rings
  • Denys Shcherbak, Gerold Jäger and Lars-Daniel Öhman. The Zero Forcing Number of Bijection Graphs
  • Stepan Artamonov and Maxim Babenko. A Fast Scaling Algorithm for the Weighted Triangle-Free 2-Matching Problem
  • Philippe Gambette, Andreas Gunawan, Anthony Labarre, Stéphane Vialette and Louxin Zhang. Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time
  • Irving Dai. Combinatorial Properties of Full-Flag Johnson Graphs
  • Martin Derka, Alejandro Lopez-Ortiz and Daniela Maftuleac. List Colouring and Partial List Colouring of Graphs On-Line