Finding a Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas. - Yoshiyuki Kusakari; Hitoshi Suzuki; Takao Nishizeki (ISAAC, 1995)

An Algorithm for Finding a Region with the Minimum Lotal L1 from Prescribed Terminals. - Yoshiyuki Kusakari; Takao Nishizeki (ISAAC, 1997)

Algorithms for Finding Noncrossing Steiner Forests in Plane Graphs. - Yoshiyuki Kusakari; Daisuke Masubuchi; Takao Nishizeki (ISAAC, 1999)

A Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas. - Yoshiyuki Kusakari; Hitoshi Suzuki; Takao Nishizeki (Int. J. Comput. Geom. Appl., 1999)

Finding a Noncrossing Steiner Forest in Plane Graphs Under a 2-Face Condition. - Yoshiyuki Kusakari; Daisuke Masubuchi; Takao Nishizeki (J. Comb. Optim., 2001)

Planar Reconfiguration of Monotone Trees. - Yoshiyuki Kusakari; Masaki Sato; Takao Nishizeki (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002)

On Reconfiguring Radial Trees. - Yoshiyuki Kusakari (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006)

Methods for Searching Mutual Visible-Intervals on Moving Object. - Yoshiyuki Kusakari; Yuta Sugimoto; Junichi Notoya; Masao Kasai (WALCOM, 2007)