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

1 |
Grundy Coloring & Friends, Half-Graphs, Bicliques |
Aboulker, Pierre et al. |
2020 |

2 |
Grundy Distinguishes Treewidth from Pathwidth |
Belmonte, Rémy et al. |
2020 |

3 |
Towards Constant-Factor Approximation for Chordal / Distance-Hereditary Vertex Deletion |
Ahn, Jungho et al. |
2020 |

4 |
Token Sliding on Split Graphs |
Belmonte, Rémy et al. |
2019 |

5 |
Data-Compression for Parametrized Counting Problems on Sparse Graphs |
Kim, Eun Jung et al. |
2018 |

6 |
Finding Branch-Decompositions of Matroids, Hypergraphs, and More |
Jeong, Jisu et al. |
2018 |

7 |
New Results on Directed Edge Dominating Set |
Belmonte, Rémy et al. |
2018 |

8 |
QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs |
Bonnet, Édouard et al. |
2018 |

9 |
A Polynomial Kernel for Block Graph Deletion |
Kim, Eun Jung et al. |
2015 |

10 |
An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion |
Kanté, Mamadou Moustapha et al. |
2015 |

11 |
Complexity and Approximability of Parameterized MAX-CSPs |
Dell, Holger et al. |
2015 |

12 |
Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism |
Kim, Eun Jung et al. |
2015 |