No. |
Title |
Author |
Year |
---|

1 |
A Polynomial Kernel for Bipartite Permutation Vertex Deletion |
Kanesh, Lawqueen et al. |
2021 |

2 |
A Polynomial Kernel for Deletion to Ptolemaic Graphs |
Agrawal, Akanksha et al. |
2021 |

3 |
An ETH-Tight Algorithm for Multi-Team Formation |
Lokshtanov, Daniel et al. |
2021 |

4 |
An FPT Algorithm for Elimination Distance to Bounded Degree Graphs |
Agrawal, Akanksha et al. |
2021 |

5 |
Diverse Collections in Matroids and Graphs |
Fomin, Fedor V. et al. |
2021 |

6 |
ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space |
Fomin, Fedor V. et al. |
2021 |

7 |
Exploiting Dense Structures in Parameterized Complexity |
Lochet, William et al. |
2021 |

8 |
k-Distinct Branchings Admits a Polynomial Kernel |
Bang-Jensen, Jørgen et al. |
2021 |

9 |
A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion |
Lokshtanov, Daniel et al. |
2020 |

10 |
A Polynomial Kernel for Paw-Free Editing |
Eiben, Eduard et al. |
2020 |

11 |
Approximation in (Poly-) Logarithmic Space |
Biswas, Arindam et al. |
2020 |

12 |
Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds |
Fomin, Fedor V. et al. |
2020 |

13 |
ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs |
Fomin, Fedor V. et al. |
2020 |

14 |
Fault Tolerant Subgraphs with Applications in Kernelization |
Lochet, William et al. |
2020 |

15 |
Improved FPT Algorithms for Deletion to Forest-Like Structures |
Gowda, Kishen N. et al. |
2020 |

16 |
On the (Parameterized) Complexity of Almost Stable Marriage |
Gupta, Sushmita et al. |
2020 |

17 |
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs |
Gunda, Spoorthy et al. |
2020 |

18 |
On the Parameterized Complexity of Deletion to ℋ-Free Strong Components |
Neogi, Rian et al. |
2020 |

19 |
On the Parameterized Complexity of Grid Contraction |
Saurabh, Saket et al. |
2020 |

20 |
On the Parameterized Complexity of Maximum Degree Contraction Problem |
Saurabh, Saket et al. |
2020 |

21 |
Optimal Output Sensitive Fault Tolerant Cuts |
Banerjee, Niranka et al. |
2020 |

22 |
Parameterization Above a Multiplicative Guarantee |
Fomin, Fedor V. et al. |
2020 |

23 |
Parameterized Complexity of Directed Spanner Problems |
Fomin, Fedor V. et al. |
2020 |

24 |
Parameterized Complexity of Feedback Vertex Sets on Hypergraphs |
Choudhary, Pratibha et al. |
2020 |

25 |
Quick Separation in Chordal and Split Graphs |
Misra, Pranabendu et al. |
2020 |

26 |
The Parameterized Complexity of Guarding Almost Convex Polygons |
Agrawal, Akanksha et al. |
2020 |

27 |
A Strongly-Uniform Slicewise Polynomial-Time Algorithm for the Embedded Planar Diameter Improvement Problem |
Lokshtanov, Daniel et al. |
2019 |

28 |
Approximate Counting of k-Paths: Deterministic and in Polynomial Space |
Björklund, Andreas et al. |
2019 |

29 |
Connecting the Dots (with Minimum Crossings) |
Agrawal, Akanksha et al. |
2019 |

30 |
Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals |
Fomin, Fedor V. et al. |
2019 |