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 | Complexity of the List Homomorphism Problem in Hereditary Graph Classes | Okrasa, Karolina et al. | 2021 |
3 | Faster 3-Coloring of Small-Diameter Graphs | Dębski, Michał et al. | 2021 |
4 | Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs | Paesani, Giacomo et al. | 2021 |
5 | Fine-Grained Complexity of the List Homomorphism Problem: Feedback Vertex Set and Cutwidth | Piecyk, Marta et al. | 2021 |
6 | Finding Large H-Colorable Subgraphs in Hereditary Graph Classes | Chudnovsky, Maria et al. | 2020 |
7 | Full Complexity Classification of the List Homomorphism Problem for Bounded-Treewidth Graphs | Okrasa, Karolina et al. | 2020 |
8 | Sparsification Lower Bounds for List H-Coloring | Chen, Hubie et al. | 2020 |
Current Page : | |
Number of result pages: | 1 |
Number of documents: | 8 |