Cited By
View all- Ganian RHamm TKorchemna VOkrasa KSimonov K(2024)The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-WidthACM Transactions on Algorithms10.1145/365251420:3(1-26)Online publication date: 25-Mar-2024
- Björklund AKaski PMarx D(2021)The fine-grained complexity of computing the tutte polynomial of a linear matroidProceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3458064.3458203(2333-2345)Online publication date: 10-Jan-2021
- Fomin FLokshtanov DMihajlin ISaurabh SZehavi M(2021)Computation of Hadwiger Number and Related Contraction ProblemsACM Transactions on Computation Theory10.1145/344863913:2(1-25)Online publication date: 26-Mar-2021
- Show More Cited By