Abstract is missing.
- Front Matter, Table of Contents, Preface, Conference Organization [doi]
- Relativization and Interactive Proof Systems in Parameterized Complexity TheoryRalph Bottesch. [doi]
- An Improved Fixed-Parameter Algorithm for One-Page Crossing MinimizationYasuaki Kobayashi, Hiromu Ohtsuka, Hisao Tamaki. [doi]
- The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second IterationHolger Dell, Christian Komusiewicz, Nimrod Talmon, Mathias Weller. [doi]
- On the Parameterized Complexity of Contraction to Generalization of TreesAkanksha Agrawal, Saket Saurabh 0001, Prafullkumar Tale. [doi]
- Merging Nodes in Search Trees: an Exact Exponential Algorithm for the Single Machine Total Tardiness Scheduling ProblemLei Shang, Michele Garraffa, Federico Della Croce, Vincent T'Kindt. [doi]
- Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost DiameterJulien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos. [doi]
- On the Parameterized Complexity of Red-Blue Points SeparationÉdouard Bonnet, Panos Giannopoulos, Michael Lampis. [doi]
- The Dominating Set Problem in Geometric Intersection GraphsMark de Berg, Sándor Kisfaludi-Bak, Gerhard J. Woeginger. [doi]
- Generalized Kakeya Sets for Polynomial Evaluation and Faster Computation of FermionantsAndreas Björklund, Petteri Kaski, R. Ryan Williams. [doi]
- FO Model Checking of Geometric GraphsPetr Hlinený, Filip Pokrývka, Bodhayan Roy. [doi]
- Optimal Data Reduction for Graph Coloring Using Low-Degree PolynomialsBart M. P. Jansen, Astrid Pieterse. [doi]
- Contraction-Bidimensionality of Geometric Intersection GraphsJulien Baste, Dimitrios M. Thilikos. [doi]
- How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs?Marin Bougeret, Ignasi Sau. [doi]
- Turing Kernelization for Finding Long Paths in Graphs Excluding a Topological MinorBart M. P. Jansen, Marcin Pilipczuk, Marcin Wrochna. [doi]
- Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded TreewidthJulien Baste, Ignasi Sau, Dimitrios M. Thilikos. [doi]
- An Exponential Lower Bound for Cut Sparsifiers in Planar GraphsNikolai Karpov, Marcin Pilipczuk, Anna Zych-Pawlewicz. [doi]
- Finding Connected Secluded SubgraphsPetr A. Golovach, Pinar Heggernes, Paloma T. Lima, Pedro Montealegre. [doi]
- A Fixed-Parameter Perspective on #BISRadu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas. [doi]
- Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality Is the Key to Single-Exponential Parameterized AlgorithmsÉdouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx. [doi]
- Solving and Sampling with Many Solutions: Satisfiability and Other Hard ProblemsJean Cardinal, Jerri Nummenpalo, Emo Welzl. [doi]
- Tight Conditional Lower Bounds for Longest Common Increasing SubsequenceLech Duraj, Marvin Künnemann, Adam Polak. [doi]
- Polynomial-Time Algorithms for the Longest Induced Path and Induced Disjoint Paths Problems on Graphs of Bounded Mim-WidthLars Jaffke, O-joung Kwon, Jan Arne Telle. [doi]
- K-Best Solutions of MSO Problems on Tree-Decomposable GraphsDavid Eppstein, Denis Kurz. [doi]
- Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter TractableVikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán. [doi]
- DynASP2.5: Dynamic Programming on Tree Decompositions in ActionJohannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran. [doi]
- An Output Sensitive Algorithm for Maximal Clique Enumeration in Sparse GraphsGeorge Manoussakis. [doi]
- Smaller Parameters for Vertex Cover KernelizationEva-Maria C. Hols, Stefan Kratsch. [doi]
- Computing Treewidth on the GPUTom C. van der Zanden, Hans L. Bodlaender. [doi]
- Odd Multiway Cut in Directed Acyclic GraphsKarthekeyan Chandrasekaran, Sahand Mozaffari. [doi]
- Treewidth with a Quantifier Alternation RevisitedMichael Lampis, Valia Mitsou. [doi]