| No. |
Title |
Author |
Year |
| 1 |
Computing Homomorphisms in Hereditary Graph Classes: The Peculiar Case of the 5-Wheel and Graphs with No Long Claws |
Dębski, Michał et al. |
2022 |
| 2 |
List Locally Surjective Homomorphisms in Hereditary Graph Classes |
Dvořák, Pavel et al. |
2022 |
| 3 |
Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás' Path Argument |
Majewski, Konrad et al. |
2022 |
| 4 |
Taming Graphs with No Large Creatures and Skinny Ladders |
Gajarský, Jakub et al. |
2022 |
| 5 |
Complexity of the List Homomorphism Problem in Hereditary Graph Classes |
Okrasa, Karolina et al. |
2021 |
| 6 |
Faster 3-Coloring of Small-Diameter Graphs |
Dębski, Michał et al. |
2021 |
| 7 |
Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs |
Paesani, Giacomo et al. |
2021 |
| 8 |
Fine-Grained Complexity of the List Homomorphism Problem: Feedback Vertex Set and Cutwidth |
Piecyk, Marta et al. |
2021 |
| 9 |
Finding Large H-Colorable Subgraphs in Hereditary Graph Classes |
Chudnovsky, Maria et al. |
2020 |
| 10 |
Full Complexity Classification of the List Homomorphism Problem for Bounded-Treewidth Graphs |
Okrasa, Karolina et al. |
2020 |
| 11 |
Sparsification Lower Bounds for List H-Coloring |
Chen, Hubie et al. |
2020 |
