1. Bellman, R.: Some applications of the theory of dynamic programming - a review. Oper. Res. 2(3), 275–288 (1954)
2. Bertelè, U., Brioschi, F.: On non-serial dynamic programming. J. Comb. Theory Ser. A 14(2), 137–148 (1973)
3. Blume, C., Bruggink, H.J.S., Friedrich, M., König, B.: Treewidth, pathwidth and cospan decompositions with applications to graph-accepting tree automata. J. Vis. Lang. Comput. 24(3), 192–206 (2013)
4. Bodlaender, H.L., Koster, A.M.C.A.: Combinatorial optimization on graphs of bounded treewidth. Comput. J. 51(3), 255–269 (2008)
5. Chiang, D., Andreas, J., Bauer, D., Hermann, K.M., Jones, B.K., Knight, K.: Parsing graphs with hyperedge replacement grammars. In: Proceedings of ACL 2013, Long Papers, vol. 1, pp. 924–932. The Association for Computer Linguistics (2013)