Algorithms for Finding Non-Crossing Paths with Minimum Total Length in Plane Graphs. - Jun-ya Takahashi; Hitoshi Suzuki; Takao Nishizeki (ISAAC, 1992)

Finding Shortest Non-Crossing Rectilinear Paths in Plane Regions. - Jun-ya Takahashi; Hitoshi Suzuki; Takao Nishizeki (ISAAC, 1993)

Shortest Noncrossing Paths in Plane Graphs. - Jun-ya Takahashi; Hitoshi Suzuki; Takao Nishizeki (Algorithmica, 1996)

Shortest Non-Crossing Rectilinear Paths in Plane Regions. - Jun-ya Takahashi; Hitoshi Suzuki; Takao Nishizeki (Int. J. Comput. Geom. Appl., 1997)

Simple cellular automaton-based simulation of ink behaviour and its application to Suibokuga-like 3D rendering of trees. - Qing Zhang; Youetsu Sato; Jun-ya Takahashi; Kazunobu Muraoka; Norishige Chiba (Comput. Animat. Virtual Worlds, 1999)