1. , and (1989). Network flows. Handbooks in Operations Research and Management Science, Vol. 1, Optimization ( Kan, and , Eds.) North-Holland, Amsterdam (1989).
2. and , Algorithmic implications of the graph minor Theorem. To appear.
3. On the Complexity of Timetable and Multicommodity Flow Problems
4. The directed subgraph homeomorphism problem
5. and , Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA (1979).