1. R. Ahuja, T. Magnanti and J. Orlin, “Network Flows”, Prentice-Hall, 1993.
2. N. Alon and B. Schieber, “Optimal Preprocessing for Answering On-line Product Queries”, Tech. Rep. No. 71/87, Tel-Aviv University, 1987.
3. S. Arnborg, “Efficient Algorithms for Combinatorial Problems on Graphs with Bounded Decomposability — A Survey”, BIT, 25, pp.2–23, 1985.
4. H. Bodlaender, “A Linear Time Algorithm for Finding Tree-decompositions of Small Treewidth”, Proc. 25th ACM STOC, pp.226–234, 1993.
5. H. Bodlaender, “A Tourist Guide through Treewidth”, Acta Cybernetica, Vol.11, No.1–2, pp.1–21, 1993.