| Acyclic matchings in graphs of bounded maximum degree | 0 | 0.34 | 2022 |
| Contraction Bidimensionality of Geometric Intersection Graphs | 0 | 0.34 | 2022 |
| Minimum Reload Cost Graph Factors | 0 | 0.34 | 2021 |
| Linear programming based approximation for unweighted induced matchings—Breaking the Δ barrier | 1 | 0.35 | 2020 |
| Domination versus edge domination | 0 | 0.34 | 2020 |
| A complexity dichotomy for hitting connected minors on bounded treewidth graphs - the chair and the banner draw the boundary. | 0 | 0.34 | 2020 |
| Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms | 0 | 0.34 | 2020 |
| Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds | 1 | 0.35 | 2020 |
| Parameterized complexity of finding a spanning tree with minimum reload cost diameter. | 0 | 0.34 | 2020 |
| Hitting minors on bounded treewidth graphs. III. Lower bounds. | 1 | 0.36 | 2020 |
| Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory | 0 | 0.34 | 2020 |
| Approximating Maximum Acyclic Matchings by Greedy and Local Search Strategies. | 0 | 0.34 | 2020 |
| Approximating maximum uniquely restricted matchings in bipartite graphs | 0 | 0.34 | 2019 |
| Diversity in Combinatorial Optimization. | 0 | 0.34 | 2019 |
| FPT Algorithms for Diverse Collections of Hitting Sets | 0 | 0.34 | 2019 |
| Upper bounds on the uniquely restricted chromatic index: BASTE et al. | 0 | 0.34 | 2019 |
| Composing dynamic programming tree-decomposition-based algorithms. | 0 | 0.34 | 2019 |
| A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth. | 2 | 0.38 | 2018 |
| On The Number Of Labeled Graphs Of Bounded Treewidth | 1 | 0.36 | 2018 |
| Degenerate matchings and edge colorings. | 1 | 0.37 | 2018 |
| Ruling out FPT algorithms for Weighted Coloring on forests. | 1 | 0.37 | 2017 |
| Optimal algorithms for hitting (topological) minors on graphs of bounded treewidth. | 3 | 0.40 | 2017 |
| Uniquely Restricted Matchings And Edge Colorings | 0 | 0.34 | 2017 |
| Parameterized complexity of finding a spanning tree with minimum reload cost diameter. | 0 | 0.34 | 2017 |
| On the parameterized complexity of the Edge Monitoring problem. | 1 | 0.35 | 2017 |
| Contraction-Bidimensionality of Geometric Intersection Graphs. | 1 | 0.36 | 2017 |
| Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion | 0 | 0.34 | 2017 |
| Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees. | 3 | 0.39 | 2016 |
| The role of planarity in connectivity problems parameterized by treewidth | 2 | 0.38 | 2015 |
