Abstract is missing.
- The PACE 2018 Parameterized Algorithms and Computational Experiments Challenge: The Third IterationÉdouard Bonnet, Florian Sikora. [doi]
- Parameterized Leaf Power Recognition via Embedding into Graph ProductsDavid Eppstein, Elham Havvaei. [doi]
- Resolving Conflicts for Lower-Bounded ClusteringKatrin Casel. [doi]
- Front Matter, Table of Contents, Preface, Conference Organization [doi]
- The Parameterised Complexity of Computing the Maximum Modularity of a GraphKitty Meeks, Fiona Skerman. [doi]
- Solving Target Set Selection with Bounded Thresholds Faster than 2^nIvan Bliznets, Danil Sagunov. [doi]
- A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by TreewidthJulien Baste, Ignasi Sau, Dimitrios M. Thilikos. [doi]
- Best-Case and Worst-Case Sparsifiability of Boolean CSPsHubie Chen, Bart M. P. Jansen, Astrid Pieterse. [doi]
- Multivariate Analysis of Orthogonal Range Searching and Graph DistancesKarl Bringmann, Thore Husfeldt, Måns Magnusson. [doi]
- Matching Cut: Kernelization, Single-Exponential Time FPT, and Exact Exponential AlgorithmsChristian Komusiewicz, Dieter Kratsch, Van Bang Le. [doi]
- Subset Feedback Vertex Set on Graphs of Bounded Independent Set SizeCharis Papadopoulos, Spyridon Tzimas. [doi]
- Lower Bounds for Dynamic Programming on Planar Graphs of Bounded CutwidthBas A. M. van Geffen, Bart M. P. Jansen, Arnoud A. W. M. de Kroon, Rolf Morel. [doi]
- On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on GraphsFlorian Barbero, Lucas Isenmann, Jocelyn Thiebaut. [doi]
- Multi-Budgeted Directed CutsStefan Kratsch, Shaohua Li, Dániel Marx, Marcin Pilipczuk, Magnus Wahlström. [doi]
- Computing Kernels in Parallel: Lower and Upper BoundsMax Bannach, Till Tantau. [doi]
- The Parameterized Complexity of Finding Point Sets with Hereditary PropertiesDavid Eppstein, Daniel Lokshtanov. [doi]
- A Faster Tree-Decomposition Based Algorithm for Counting Linear ExtensionsKustaa Kangas, Mikko Koivisto, Sami Salonen. [doi]
- Exploring the Kernelization Borders for Hitting CyclesAkanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Pranabendu Misra, Saket Saurabh 0001. [doi]
- Dual Parameterization of Weighted ColoringJúlio Araújo, Victor A. Campos, Carlos Vinícius G. C. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Ana Silva. [doi]
- Integer Programming in Parameterized Complexity: Three MiniaturesTomas Gavenciak, Dusan Knop, Martin Koutecký. [doi]
- A Strongly-Uniform Slicewise Polynomial-Time Algorithm for the Embedded Planar Diameter Improvement ProblemDaniel Lokshtanov, Mateus de Oliveira Oliveira, Saket Saurabh 0001. [doi]
- Parameterized Complexity of Independent Set in H-Free GraphsÉdouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, Rémi Watrigant. [doi]
- Generalized Distance Domination Problems and Their Complexity on Graphs of Bounded mim-widthLars Jaffke, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle. [doi]
- Counting Problems in Parameterized ComplexityRadu Curticapean. [doi]
- A Parameterized Complexity View on Collapsing k-CoresJunjie Luo, Hendrik Molter, Ondrej Suchý. [doi]
- Parameterized Complexity of Multi-Node HubsSaket Saurabh 0001, Meirav Zehavi. [doi]
- Counting Induced Subgraphs: A Topological Approach to #W[1]-hardnessMarc Roth, Johannes Schmitt. [doi]