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

1 |
Finding a Small Number of Colourful Components |
Bulteau, Laurent et al. |
2019 |

2 |
Harnessing AI For Research |
Johnson, Matthew |
2019 |

3 |
Deciding the Closure of Inconsistent Rooted Triples Is NP-Complete |
Johnson, Matthew P. |
2018 |

4 |
On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal |
Dabrowski, Konrad K. et al. |
2018 |

5 |
Clique-Width for Graph Classes Closed under Complementation |
BlanchÃ©, Alexandre et al. |
2017 |

6 |
Independent Feedback Vertex Set for P_5-free Graphs |
Bonamy, Marthe et al. |
2017 |

7 |
Recognizing Graphs Close to Bipartite Graphs |
Bonamy, Marthe et al. |
2017 |