Funder
H2020 European Research Council
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference24 articles.
1. Arvind, V., Raman, V.: Approximation Algorithms for Some Parameterized Counting Problems, pp. 453–464. Springer, Berlin (2002)
2. Cai, J.-Y., Galanis, A., Goldberg, L.A., Guo, H., Jerrum, M., Stefankovic, D., Vigoda, E.: #BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region. J. Comput. Syst. Sci. 82(5), 690–711 (2016)
3. Curticapean, R., Dell, H., Fomin, F., Goldberg, L.A., Lapinskas, J.: A fixed-parameter perspective on #BIS. In: 12th International Symposium on Parameterized and Exact Computation (IPEC), pp. 13:1–13:13 (2017)
4. Curticapean, R., Dell, H., Marx, D.: Homomorphisms are a good basis for counting small subgraphs. In: Proceedings of the 49th Annual ACM Symposium on Theory of Computing, pp. 210–213 (2017)
5. Curticapean, R., Marx, D.: Complexity of counting subgraphs: only the boundedness of the vertex-cover number counts. In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, 18–21 Oct 2014, pp. 130–139 (2014)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献