Abstract is missing.
- Front Matter, Table of Contents, Preface, Program Committee, External Reviewers, List of Authors [doi]
- Bidimensionality and Parameterized Algorithms (Invited Talk)Dimitrios M. Thilikos. 1-16 [doi]
- Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk)Virginia Vassilevska Williams. 17-29 [doi]
- Variants of Plane Diameter CompletionPetr A. Golovach, Clément Requilé, Dimitrios M. Thilikos. 30-42 [doi]
- Parameterized and Approximation Algorithms for the Load Coloring ProblemFlorian Barbero, Gregory Gutin, Mark Jones, Bin Sheng. 43-54 [doi]
- Scheduling Two Competing Agents When One Agent Has Significantly Fewer JobsDanny Hermelin, Judith-Madeleine Kubitza, Dvir Shabtay, Nimrod Talmon, Gerhard J. Woeginger. 55-65 [doi]
- On the Workflow Satisfiability Problem with Class-independent ConstraintsJason Crampton, Andrei V. Gagarin, Gregory Gutin, Mark Jones. 66-77 [doi]
- Parameterized Algorithms for Min-Max Multiway Cut and List Digraph HomomorphismEun Jung Kim 0002, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos. 78-89 [doi]
- Improved Exact Algorithms for Mildly Sparse Instances of Max SATTakayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama. 90-101 [doi]
- Polynomial Fixed-parameter Algorithms: A Case Study for Longest Path on Interval GraphsArchontia C. Giannopoulou, George B. Mertzios, Rolf Niedermeier. 102-113 [doi]
- Meta-kernelization using Well-structured ModulatorsEduard Eiben, Robert Ganian, Stefan Szeider. 114-126 [doi]
- Parameter CompilationHubie Chen. 127-137 [doi]
- An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex DeletionMamadou Moustapha Kanté, Eun Jung Kim 0002, O.-joung Kwon, Christophe Paul. 138-150 [doi]
- Extending the Kernel for Planar Steiner Tree to the Number of Steiner VerticesOndrej Suchý. 151-162 [doi]
- Sparsification Upper and Lower Bounds for Graphs Problems and Not-All-Equal SATBart M. P. Jansen, Astrid Pieterse. 163-174 [doi]
- Definability Equals Recognizability for k-Outerplanar GraphsLars Jaffke, Hans L. Bodlaender. 175-186 [doi]
- Practical Algorithms for Linear Boolean-widthChiel B. Ten Brinke, Frank J. P. van Houten, Hans L. Bodlaender. 187-198 [doi]
- Linear Kernels for Outbranching Problems in Sparse DigraphsMarthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala. 199-211 [doi]
- Maximum Matching Width: New Characterizations and a Fast Algorithm for Dominating SetJisu Jeong, Sigve Hortemo Sæther, Jan Arne Telle. 212-223 [doi]
- Fast Parallel Fixed-parameter Algorithms via Color CodingMax Bannach, Christoph Stockhusen, Till Tantau. 224-235 [doi]
- Fixed-parameter Tractable Distances to Sparse Graph ClassesJannis Bulian, Anuj Dawar. 236-247 [doi]
- Strong ETH and Resolution via Games and the Multiplicity of StrategiesIlario Bonacina, Navid Talebanfard. 248-257 [doi]
- Quick but Odd Growth of CactiSudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh. 258-269 [doi]
- A Polynomial Kernel for Block Graph DeletionEun Jung Kim 0002, O.-joung Kwon. 270-281 [doi]
- Parameterized Complexity of Graph Constraint LogicTom C. van der Zanden. 282-293 [doi]
- Complexity and Approximability of Parameterized MAX-CSPsHolger Dell, Eun Jung Kim 0002, Michael Lampis, Valia Mitsou, Tobias Mömke. 294-306 [doi]
- Enumerating Minimal Connected Dominating Sets in Graphs of Bounded ChordalityPetr A. Golovach, Pinar Heggernes, Dieter Kratsch. 307-318 [doi]
- The Graph Motif Problem Parameterized by the Structure of the Input GraphEdouard Bonnet, Florian Sikora. 319-330 [doi]
- Kernels for Structural Parameterizations of Vertex Cover - Case of Small Degree ModulatorsDiptapriyo Majumdar, Venkatesh Raman, Saket Saurabh. 331-342 [doi]
- Parameterized Complexity of Critical Node CutsDanny Hermelin, Moshe Kaspi, Christian Komusiewicz, Barak Navon. 343-354 [doi]
- Parameterized Complexity of Sparse Linear Complementarity ProblemsHanna Sumita, Naonori Kakimura, Kazuhisa Makino. 355-364 [doi]
- Parameterized Lower Bound and Improved Kernel for Diamond-free Edge DeletionR. B. Sandeep, Naveen Sivadasan. 365-376 [doi]
- On Kernelization and Approximation for the Vector Connectivity ProblemStefan Kratsch, Manuel Sorge. 377-388 [doi]
- B-Chromatic Number: Beyond NP-HardnessFahad Panolan, Geevarghese Philip, Saket Saurabh. 389-401 [doi]
- Fast Biclustering by Dual ParameterizationPål Grønås Drange, Felix Reidl, Fernando Sanchez Villaamil, Somnath Sikdar. 402-413 [doi]