Reporting All Segment Intersections Using an Arbitrary Sized Work Space. - Matsuo Konagaya; Tetsuo Asano (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013)

Depth-First Search Using O(n) Bits. - Tetsuo Asano; Taisuke Izumi; Masashi Kiyomi; Matsuo Konagaya; Hirotaka Ono 001; Yota Otachi; Pascal Schweitzer; Jun Tarui; Ryuhei Uehara (ISAAC, 2014)

Polynomial-time algorithms for Subgraph Isomorphism in small graph classes of perfect graphs. - Matsuo Konagaya; Yota Otachi; Ryuhei Uehara (Discret. Appl. Math., 2016)