| No. |
Title |
Author |
Year |
| 1 |
Compound Logics for Modification Problems |
Fomin, Fedor V. et al. |
2023 |
| 2 |
Faster Parameterized Algorithms for Modification Problems to Minor-Closed Classes |
Morelle, Laure et al. |
2023 |
| 3 |
A Constant-Factor Approximation for Weighted Bond Cover |
Kim, Eun Jung et al. |
2021 |
| 4 |
A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth |
Kanté, Mamadou Moustapha et al. |
2020 |
| 5 |
An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL |
Fomin, Fedor V. et al. |
2020 |
| 6 |
An FPT-Algorithm for Recognizing k-Apices of Minor-Closed Graph Classes |
Sau, Ignasi et al. |
2020 |
| 7 |
A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth |
Baste, Julien et al. |
2019 |
| 8 |
Clustering to Given Connectivities |
Golovach, Petr A. et al. |
2019 |
| 9 |
Connected Search for a Lazy Robber |
Adler, Isolde et al. |
2019 |
| 10 |
Lean Tree-Cut Decompositions: Obstructions and Algorithms |
Giannopoulou, Archontia C. et al. |
2019 |
| 11 |
Modification to Planarity is Fixed Parameter Tractable |
Fomin, Fedor V. et al. |
2019 |
| 12 |
Contraction-Bidimensionality of Geometric Intersection Graphs |
Baste, Julien et al. |
2018 |
| 13 |
Data-Compression for Parametrized Counting Problems on Sparse Graphs |
Kim, Eun Jung et al. |
2018 |
| 14 |
Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded Treewidth |
Baste, Julien et al. |
2018 |
| 15 |
Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter |
Baste, Julien et al. |
2018 |
| 16 |
Partial Complementation of Graphs |
Fomin, Fedor V. et al. |
2018 |
| 17 |
Cutwidth: Obstructions and Algorithmic Aspects |
Giannopoulou, Archontia C. et al. |
2017 |
| 18 |
Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes |
Giannopoulou, Archontia C. et al. |
2017 |
| 19 |
Structured Connectivity Augmentation |
Fomin, Fedor V. et al. |
2017 |
| 20 |
FPT Algorithms for Plane Completion Problems |
Chatzidimitriou, Dimitris et al. |
2016 |
| 21 |
Bidimensionality and Parameterized Algorithms (Invited Talk) |
Thilikos, Dimitrios M. |
2015 |
| 22 |
Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism |
Kim, Eun Jung et al. |
2015 |
| 23 |
Variants of Plane Diameter Completion |
Golovach, Petr A. et al. |
2015 |
| 24 |
Explicit Linear Kernels via Dynamic Programming |
Garnero, Valentin et al. |
2014 |
| 25 |
Bidimensional Structures: Algorithms, Combinatorics and Logic (Dagstuhl Seminar 13121) |
Demaine, Erik D. et al. |
2013 |
| 26 |
Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs |
Fomin, Fedor V. et al. |
2013 |
| 27 |
Contraction checking in graphs on surfaces |
Kaminski, Marcin et al. |
2012 |
| 28 |
Theory and Applications of Graph Searching Problems (GRASTA 2011) (Dagstuhl Seminar 11071) |
Fomin, Fedor V. et al. |
2011 |
| 29 |
Contraction Bidimensionality: the Accurate Picture |
Fomin, Fedor V. et al. |
2010 |
| 30 |
Approximating Acyclicity Parameters of Sparse Hypergraphs |
Fomin, Fedor V. et al. |
2009 |
