IPEC
Accepted Papers
| Authors | Title |
| Guilherme C. M. Gomes and Ignasi Sau | Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization |
| Gabriel Duarte, Lehilton Pedrosa, Rafael Schouery, Uéverton Souza and Daniel Lokshtanov | Computing the largest bond of a graph |
| Markus Blaeser and Christian Engels | Parameterized Valiant's classes |
| Johannes Blum | Hierarchy of Transportation Network Parameters and Hardness Results |
| Marco Bressan | Counting subgraphs via DAG tree decompositions |
| Gregory Rosenthal | Beating Treewidth for Average-Case Subgraph Isomorphism |
| Yoichi Iwata and Yusuke Kobayashi | Improved Analysis of Highest-Degree Branching for Feedback Vertex Set |
| Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi and Yusuke Kobayashi | Parameterized Algorithms for Maximum Cut with Connectivity Constraints |
| Petr Golovach and Dimitrios Thilikos | Clustering to Given Connectivities |
| Édouard Bonnet and Nidhi Purohit | Metric Dimension Parameterized by Treewidth |
| Edin Husic, Stephan Thomasse and Nicolas Trotignon | The independent set problem is FPT for even-hole-free graphs |
| Jana Novotná, Karolina Okrasa, Michal Pilipczuk, Pawel Rzazewski, Erik Jan van Leeuwen and Bartosz Walczak | Subexponential-time algorithms for finding large induced sparse subgraphs |
| Till Fluschnik, Rolf Niedermeier, Valentin Rohm and Philipp Zschoche | Multistage Vertex Cover |
| Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou and Théo Pierron | Parameterized complexity of edge-coloured and signed graph homomorphism problems |
| Tim A. Hartmann, Jan Dreier, Janosch Fuchs, Philipp Kuinke, Peter Rossmanith, Hung-Lung Wang and Bjoern Tauer | The Complexity of Packing Edge-Disjoint Paths |
| Jan Dreier and Peter Rossmanith | Hardness of FO Model-Checking on Random Graphs |
| Rajesh Chitnis and Andreas Emil Feldmann | FPT Inapproximability of Directed Cut and Connectivity Problems |
| Alexander Göke, Lydia Mirabel Mendoza Cadena and Matthias Mnich | Resolving Infeasibility of Linear Systems: A Parameterized Approach |
| Thekla Hamm | Finding Linear Arrangements of Hypergraphs with Bounded Cutwidth in Linear Time |
| Benjamin Aram Berendsohn, László Kozma and Dániel Marx | Finding and counting permutations via CSPs |
| Giordano Da Lozzo, David Eppstein, Michael Goodrich and Siddharth Gupta | C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width |
| Stéphane Bessy, Marin Bougeret, Alan D. A. Carneiro, Fábio Protti and Uéverton S. Souza | Width Parameterizations for Knot-free Vertex Deletion on Digraphs |
| Jiawei Gao | On the Fine-grained Complexity of Least Weight Subsequence in Multitrees and Bounded Treewidth DAGs |
| Rajesh Chitnis and Graham Cormode | Towards a Theory of Parameterized Streaming Algorithms |
