1. Parallelism and greedy algorithms;Anderson;Adv. Comput. Res.,1987
2. A P-complete problem and approximations to it;Anderson,1984
3. Efficient algorithms for combinatorial problems on graphs with bounded decomposability (a survey);Amborg;BIT,1985
4. Graph searching, path-width, tree-width and related problems (a survey);Bienstock;DIMACS Ser. Discrete Math. Theoret. Comput. Sci.,1991
5. Quickly excluding a forest;Bienstock;J. Combin. Theory Ser. B,1991