1. Rectilinear steiner trees: Efficient special-case algorithms
2. An integer linear programming approach to the steiner problem in graphs
3. and , Characterization and recognition of partial k-trees. Tech. Rep. TRITA-NA-8402, Dept. of Numerical Analysis and Computing Science, The Royal Inst. of Technology, Stockholm, Sweden (1984).
4. and , Linear time algorithms for NP-hard problems on graphs embedded in k-trees. Tech. Rep. TRITA-NA-8404, Dept. of Numerical Analysis and Computing Science, The Royal Inst. of Technology, Stockholm, Sweden (1984).
5. and , Problem reduction methods and a tree generation algorithm for the Steiner network problem. Unpublished paper (1985).