| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Complexity Framework for Forbidden Subgraphs III: When Problems Are Tractable on Subcubic Graphs | Johnson, Matthew et al. | 2023 |
| 2 | Finding a Small Number of Colourful Components | Bulteau, Laurent et al. | 2019 |
| 3 | Harnessing AI For Research | Johnson, Matthew | 2019 |
| 4 | Deciding the Closure of Inconsistent Rooted Triples Is NP-Complete | Johnson, Matthew P. | 2018 |
| 5 | On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal | Dabrowski, Konrad K. et al. | 2018 |
| 6 | Clique-Width for Graph Classes Closed under Complementation | Blanché, Alexandre et al. | 2017 |
| 7 | Independent Feedback Vertex Set for P_5-free Graphs | Bonamy, Marthe et al. | 2017 |
| 8 | Recognizing Graphs Close to Bipartite Graphs | Bonamy, Marthe et al. | 2017 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 8 |