DROPS - Results

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	Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás' Path Argument	Majewski, Konrad et al.	2022
3	The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width	Ganian, Robert et al.	2022
4	Complexity of the List Homomorphism Problem in Hereditary Graph Classes	Okrasa, Karolina et al.	2021
5	Full Complexity Classification of the List Homomorphism Problem for Bounded-Treewidth Graphs	Okrasa, Karolina et al.	2020
6	Sparsification Lower Bounds for List H-Coloring	Chen, Hubie et al.	2020
7	The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs	Bellitto, Thomas et al.	2020
8	Vertex Deletion into Bipartite Permutation Graphs	Bożyk, Łukasz et al.	2020
9	Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs	Novotná, Jana et al.	2019