Abstract is missing.
- Finding Linear Arrangements of Hypergraphs with Bounded Cutwidth in Linear TimeThekla Hamm. [doi]
- Clustering to Given ConnectivitiesPetr A. Golovach, Dimitrios M. Thilikos. [doi]
- Improved Analysis of Highest-Degree Branching for Feedback Vertex SetYoichi Iwata, Yusuke Kobayashi. [doi]
- The PACE 2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration (Invited Paper)M. Ayaz Dzulfikar, Johannes Klaus Fichte, Markus Hecher. [doi]
- The Complexity of Packing Edge-Disjoint PathsJan Dreier, Janosch Fuchs, Tim A. Hartmann, Philipp Kuinke, Peter Rossmanith, Bjoern Tauer, Hung-Lung Wang. [doi]
- Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism ProblemsFlorent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, Théo Pierron. [doi]
- Hardness of FO Model-Checking on Random GraphsJan Dreier, Peter Rossmanith. [doi]
- Resolving Infeasibility of Linear Systems: A Parameterized ApproachAlexander Göke, Lydia Mirabel Mendoza Cadena, Matthias Mnich. [doi]
- FPT Inapproximability of Directed Cut and Connectivity ProblemsRajesh Chitnis, Andreas Emil Feldmann. [doi]
- Metric Dimension Parameterized by TreewidthÉdouard Bonnet, Nidhi Purohit. [doi]
- Finding and Counting Permutations via CSPsBenjamin Aram Berendsohn, László Kozma 0002, Dániel Marx. [doi]
- Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and KernelizationGuilherme C. M. Gomes, Ignasi Sau. [doi]
- Computing the Largest Bond of a GraphGabriel L. Duarte, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza. [doi]
- Towards a Theory of Parameterized Streaming AlgorithmsRajesh Chitnis, Graham Cormode. [doi]
- Hierarchy of Transportation Network Parameters and Hardness ResultsJohannes Blum 0001. [doi]
- C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-WidthGiordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta 0002. [doi]
- Parameterized Algorithms for Maximum Cut with Connectivity ConstraintsHiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi 0001. [doi]
- Width Parameterizations for Knot-Free Vertex Deletion on DigraphsStéphane Bessy, Marin Bougeret, Alan Diêgo A. Carneiro, Fábio Protti, Uéverton S. Souza. [doi]
- Subexponential-Time Algorithms for Finding Large Induced Sparse SubgraphsJana Novotná, Karolina Okrasa, Michal Pilipczuk, Pawel Rzazewski, Erik Jan van Leeuwen, Bartosz Walczak. [doi]
- Faster Subgraph Counting in Sparse GraphsMarco Bressan 0002. [doi]
- Beating Treewidth for Average-Case Subgraph IsomorphismGregory Rosenthal. [doi]
- Front Matter, Table of Contents, Preface, Conference Organization [doi]
- The Independent Set Problem Is FPT for Even-Hole-Free GraphsEdin Husic, Stéphan Thomassé, Nicolas Trotignon. [doi]
- Parameterized Valiant's ClassesMarkus Bläser, Christian Engels. [doi]
- On the Fine-Grained Complexity of Least Weight Subsequence in Multitrees and Bounded Treewidth DAGsJiawei Gao 0001. [doi]
- Multistage Vertex CoverTill Fluschnik, Rolf Niedermeier, Valentin Rohm, Philipp Zschoche. [doi]