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

1 |
Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás' Path Argument |
Majewski, Konrad et al. |
2022 |

2 |
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width |
Ganian, Robert et al. |
2022 |

3 |
Complexity of the List Homomorphism Problem in Hereditary Graph Classes |
Okrasa, Karolina et al. |
2021 |

4 |
Full Complexity Classification of the List Homomorphism Problem for Bounded-Treewidth Graphs |
Okrasa, Karolina et al. |
2020 |

5 |
Sparsification Lower Bounds for List H-Coloring |
Chen, Hubie et al. |
2020 |

6 |
The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs |
Bellitto, Thomas et al. |
2020 |

7 |
Vertex Deletion into Bipartite Permutation Graphs |
Bożyk, Łukasz et al. |
2020 |

8 |
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs |
Novotná, Jana et al. |
2019 |