Cited By
View all- Thilikos DWiederrecht S(2024)Killing a VortexJournal of the ACM10.1145/366464871:4(1-56)Online publication date: 14-May-2024
- Yang PHuang YFu Z(2024)The computational complexity of Holant problems on 3-regular graphsTheoretical Computer Science10.1016/j.tcs.2023.114256982:COnline publication date: 8-Jan-2024
- Cai JMaran ASaha BServedio R(2023)The Complexity of Counting Planar Graph Homomorphisms of Domain Size 3Proceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585173(1285-1297)Online publication date: 2-Jun-2023
- Show More Cited By