1. , and , The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Ma. (1974).
2. Linear-time approximation algorithms for finding the minimum-weight perfect matching on a plane
3. , and , An approximate solution for the problem of optimizing the plotter pen movement. In Proc. 10th IFIP Conference on System Modeling and Optimization Lecture Notes in Control and Information Sciences, 38, and , Eds. Springer-Verlag, New York (1982) 572–580.
4. , and , Linear-time heuristics for the minimum-weight perfect matching on a plane with an application to the plotter algorithm. Research Memorandum RMI 81–07. Department of Mathematical Engineering and Instrumentation Physics, University of Tokyo (1981).
5. and , The determination of the pen-movement of an X Y-plotter and its computational complexity (in Japanese). In Proc. Spring Conference of the Operations Research Society of Japan, P–8, 1980, pp. 204, 205.