Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference18 articles.
1. Arnborg, S., Corneil, D., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. Matrix Anal. Appl. 8(2), 277–284 (1987)
2. Barvinok, A.: Two algorithmic results for the traveling salesman problem. Math. Oper. Res. 21, 65–84 (1996)
3. Lecture Notes in Computer Science;D. Berwanger,2006
4. LNCS;D. Berwanger,2005
5. Briquel, I., Koiran, P., Meer, K.: On the expressive power of CNF formulas of bounded tree- and clique-width. Discrete Appl. Math. 159(1), 1–14 (2011)