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

1 |
The Longest Run Subsequence Problem: Further Complexity Results |
Dondi, Riccardo et al. |
2021 |

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

3 |
The PACE 2018 Parameterized Algorithms and Computational Experiments Challenge: The Third Iteration |
Bonnet, Édouard et al. |
2019 |

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

5 |
Parameterized Orientable Deletion |
Hanaka, Tesshu et al. |
2018 |

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

7 |
The Graph Motif Problem Parameterized by the Structure of the Input Graph |
Bonnet, Édouard et al. |
2015 |