Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Lecture Notes in Computer Science;M. Bläser,2012
2. Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Information and Computation 85(1), 12–75 (1990)
3. Ehrenborg, R., Rota, G.-C.: Apolarity and canonical forms for homogeneous polynomials. European Journal of Combinatorics 14(3), 157–181 (1993)
4. Flum, J., Grohe, M.: The parameterized complexity of counting problems. SIAM Journal on Computing, 538–547 (2002)
5. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer-Verlag New York, Inc., Secaucus (2006)
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献