1. C. Arbib, M Lucertini, and N. Nicoloso (1988). Optimal design of programmed logic arrays, preprint, Università degli Studi di Roma “La Sapienza”.
2. S. Arnborg, D. G. Corneil, and A. Proskurowski (1987). Complexity of finding embeddings in a k-tree, SIAM J. Alg. Disc. Meth. 8, 277–284.
3. Asano, T. (1982). An optimum gate placement algorithm for MOS one-dimensional arrays, Journal of Digital Systems, 1–27.
4. H. L. Bodländer (1987). Dynamic programming on graphs with bounded tree width. Report RUU-CS-87–22, University of Utrecht.
5. H. J. Bandelt and H. M. Mulder (1986). Distance-hereditary graphs, J. Comb. Th. B 41, 182–208.