Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Bodlaender, H.L., Kloks, T.: Efficient and constructive algorithms for the pathwidth and treewidth of graphs. J. Alg. 21(2), 358–402 (1996)
2. Büchi, J.R.: On a decision method in restricted second-order arithmetic. In: Logic, Methodology, Philosophy and Science, pp. 1–11. Stanford Univ. Press, Stanford (1962)
3. Courcelle, B.: The monadic second-order logic of graphs I: Recognizable sets of finite graphs. Information and Computation 85, 12–75 (1990)
4. Demri, S., Laroussinie, F., Schnoebelen, P.: A parametric analysis of the state-explosion problem in model checking. J. Comput. Syst. Sci. 72(4), 547–575 (2006)
5. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Nested-unit Petri nets;Journal of Logical and Algebraic Methods in Programming;2019-04
2. A multi-parameter analysis of hard problems on deterministic finite automata;Journal of Computer and System Sciences;2015-06