1. Network Flows;Ahuja,1993
2. N. Alon, B. Schieber, Optimal Preprocessing for Answering On-line Product Queries, 71/87, Tel-Aviv University, 1987
3. All-pairs min-cut in sparse networks;Arikati,1995
4. Efficient algorithms for combinatorial problems on graphs with bounded decomposability—a survey;Arnborg;BIT,1985
5. NC-algorithms for graphs with small treewidth;Bodlaender,1989