最終修正 2007/10/17/

Y.Kusakari, Y.Sugimoto, J.Notoya, and M.Kasai,
''Methods for Searching Mutual Visible Intervals on Moving Objects,''
Proc. of Workshop on Algorithms and Computation(WALCOM2007), pp.13-27,Dhaka,Feb. 2007. ((Slides), (pdf))

Y.Kusakari,
''On reconfiguring radial trees,''
Proc. of JCDCG 2002,Dec. 2002, Lecture Notes in Computer Science 2866,pp.182-191,2003.
( (Slides), (pdf))

Y.Kusakari, T.Ishimura, and T.Nishizeki,
''Maximizing the area of polygonal linkages,''
Proc. of JCDCG,pp.15-16,Nov.,2000.

Y.Kusakari , D.Masubuchi,  and T.Nishizeki,
''Algorithms for finding noncrossing Steiner forests in plane graphs,''
Proc. of ISAAC'99(Lecture Notes in Computer Science 1741),pp.337-346,1999.

Y.Kusakari and T.Nishizeki,
''An algorithm for finding a region with the minimum total L_1-distance from prescribed terminals,''
Proc. of ISAAC'97(Lecture Notes in Computer Science 1350),pp.324-333, 1997.

Y.Kusakari, H. Suzuki, and T.Nishizeki,
''Finding a shortest pair of paths on th plane with obstacles and crossing areas,''
Proc. of ISAAC'95(Lecture Notes in Computer Science 1004),pp.42-51,1995.