1. M.A. Bonuccelli, Dominating sets and domatic numbers of circular-arc graphs, Discrete Appl. Math. 12 (1985), 203–213.
2. L. Chen, Y. Yesha, “Efficient parallel algorithms for recognizing transformable convex bipartite graphs and finding their maximum matchings”, OSU-CISRC-8/88-TR 26, The Ohio State University, 1988.
3. L. Chen, Y. Yesha, “Parallel algorithms: testing for interval graphs and the circular ones property”, OSU-CISRC-9/88-TR 29, The Ohio State University, 1988.
4. L. Chen, Y. Yesha, Fast parallel algorithms for bipartite permutation graphs, in “Proceedings 26th Ann. Allerton Conf. on Communication, Control, and Computing”, University of Illinois at Urbana-Champaign, 1988.
5. L. Chen, Efficient parallel algorithms for several intersection graphs, in “Proceedings Int'l Symp. on Circuits and Systems”, IEEE, 1989.