Author:
MISHRA SUCHISMITA,Komarath Balagopal,Kumar Anant,Sethia Aditi
Reference23 articles.
1. Maximum Two-Satisfiability
2. On the complexity of the subgraph problem;J Ne�et?il;Commentationes Mathematicae Universitatis Carolinae,1985
3. Finding and counting small induced subgraphs efficiently;T Kloks;Inf. Process. Lett,2000
4. Finding paths of length k in o*(2k) time;R Williams;Inf. Process. Lett,2009
5. Homomorphisms are a good basis for counting small subgraphs;R Curticapean;Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC,2017