Accepted Papers

(Published in proceedings and presented as 20 minute talks in the conference)

Konrad Dabrowski, Vadim Lozin , Haiko Muller and Dieter Rautenbach. Parameterized Algorithms for the Independent Set Problem in Hereditary Graph Classes
Maxime Crochemore , Marcin Kubica , Jakub Radoszewski, Wojciech Rytter and Tomasz Walen. On the Maximal Sum of Exponents of Runs in a String
Ulrik Brandes , Sabine Cornelsen , Barbara Pampel and Arnaud Sallaberry . Path-Based Supports for Hypergraphs
Francine Blanchet-Sadri , Bob Chen and Aleksandar Chakarov. Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three
Marcin Kaminski , Paul Medvedev and Martin Milanic. Shortest paths between shortest paths and independent sets
Yusaku Kaneta and Hiroki Arimura . Faster Bit-Parallel Algorithms for Unordered Pseudo-Tree Matching and Tree Homeomorphism
Djamal Belazzougui. Worst case efficient single and multiple string matching in the RAM model
Desh Ranjan, John Savage and Mohammad Zubair . Upper and Lower I/O bounds for pebbling r-pyramids
Hajo Broersma , Paul Bonsma , Viresh Patel and Artem Pyatkin. The complexity status of problems related to  sparsest cuts
Alfredo Navarra and Cristina M. Pinotti. Collision-free Routing in Sink-Centric Sensor Networks with Coarse-Grain Coordinates
Cristina Bazgan , Sonia Toubaline and Zsolt Tuza. Complexity of most vital nodes for Independent Set on tree structures
Pinar Heggernes , Pim van 't Hof and Daniel Paulusma . Computing role assignments of proper interval graphs in polynomial time
Tomas Dvorak, Jiri Fink , Petr Gregor and Vaclav Koubek. Efficient connectivity testing of hypercubic networks with faults
Martin Kochol, Nada Krivonakova, Silvia Smejova and Katarina Horvathova. Reductions of Matrices Associated with Nowhere-Zero Flows
Ulrik Brandes , Sabine Cornelsen , Barbara Pampel and Arnaud Sallaberry . Hypergraphs and Outerplanarity
Patrizio Angelini, Giuseppe Di Battista , Fabrizio Frati , Maurizio Patrignani and Ignaz Rutter . Testing the Simultaneous Embeddability of Two Graphs whose Intersection is a Biconnected Graph or a Tree
Prosenjit Bose , Karim Douieb and Pat Morin . Skip Lifts: A Probabilistic Alternative to Red-Black Trees
Riccardo Dondi, Paola Bonizzoni , Gianluca Della Vedova and Yuri Pirola . Parameterized Complexity of k-Anonymity: Hardness and Tractability
Julien Allali , Cedric Chauve , Pascal Ferraro and Anne-Laure Gaillard . Efficient chaining of seeds in ordered trees
Jan Kratochvil, Boris Horvat and Tomaz Pisanski. On the Computational Complexity of Degenerate Unit Distance Representations of Graphs
Ferdinando Cicalese and Martin Milanic. Graphs of separability at most two: structural characterizations and their consequences
Joe Ryan, Oudone Phanalasy, Mirka Miller and Leanne Rylands . On Antimagic Labeling for Generalized Web and Flower Graphs
Tugkan Batu , Petra Berenbrink and Colin Cooper . Chains-into-Bins Processes
Marek Tesar and Bernard Lidicky . Complexity of locally injective homomorphism to the Theta graphs
Geevarghese Philip , Henning Fernau , Fedor V. Fomin , Saket Saurabh , Daniel Lokshtanov and Matthias Mnich. Ranking and Drawing in Subexponential Time
Ferdinando Cicalese, Peter Erdos and Zsuzsanna Liptak . Efficient Reconstruction of RC-Equivalent Strings
Danny Z. Chen and Haitao Wang. Improved Points Approximation Algorithms Based on Simplicial Thickness Data Structures
Mohammed Abdullah , Colin Cooper and Tomasz Radzik . The Cover time of Cartesian Product Graphs
Maxime Crochemore , Laura Giambruno , Alessio Langiu , Filippo Mignosi and Antonio Restivo. Dictionary-Symbolwise Flexible Parsing
Gregory Kucherov , Tamar Pinhas and Michal Ziv-Ukelson. Regular Expression Constrained Sequence Alignment Revisited
Martin Kochol and Riste Skrekovski. Dichotomy for Coloring of Dart Graphs