Publisher
Springer Nature Singapore
Reference23 articles.
1. Atserias, A., Oliva, S.: Bounded-width QBF is PSPACE-complete. J. Comput. Syst. Sci. 80(7), 1415–1429 (2014)
2. Bertelè, U., Brioschi, F.: Contribution to nonserial dynamic programming. J. Math. Anal. Appl. 28(2), 313–325 (1969)
3. Bodlaender, H.L., Koster, A.M.: Combinatorial optimization on graphs of bounded treewidth. Comput. J. 51(3), 255–269 (2008). https://doi.org/10.1093/comjnl/bxm037
4. Chen, H.: Quantified constraint satisfaction and bounded treewidth. In: ECAI’04, pp. 161–165. IOS Press (2004)
5. Chimani, M., Mutzel, P., Zey, B.: Improved Steiner tree algorithms for bounded treewidth. J. Discret. Algorithms 16, 67–78 (2012). https://doi.org/10.1016/j.jda.2012.04.016