2016

Satoshi Tayu and Shuichi Ueno: On Evasion Games on Graphs , Lecture Notes in Computer Science, Vol. 9943, pp.253-264, 2016

Satoshi Tayu and Shuichi Ueno: A Note on the Spanning Subgraph Isomorphism Problem; IEICE Technical Report, vol.116, no.315, pp.83-88, 2016.

Hiroki Katsumata, Satoshi Tayu, and Shuichi Ueno: On the Complexity of Finding a Largest Common Subtree of Trees; IEICE Technical Report, vol.116, no.315, pp.89-92, 2016.

Yuta Inaba, Satoshi Tayu, and Shuichi Ueno: A 3/2-Approximation Algorithm for the Bipartite Dense Subgraph Problem on Bipartite Permutation Graphs; IEICE Technical Report, vol.116, no.315, pp.93-96, 2016.

Satoshi Tayu, Toshihiko Takahashi, Eita Kobayashi, and Shuichi Ueno: On the Three-Dimensional Channel Routing; IEICE Trans. Fundamentals, Vol.E99-A, No.10, pp.1813-1821, 2016.

Tsukasa Kobayashi, Satoshi Tayu, and Shuichi Ueno: A Note on the Parallel Complexity of Doubly Lexical Orderings; Proceedings of the 2016 IEICE Society Conference, A-1-10, 2016.

Ryu Sugimoto, Satoshi Tayu, and Shuichi Ueno: A Parallel Matching Algorithm for Chain Graphs; Proceedings of the 2016 IEICE Society Conference, A-1-11, 2016.

Yuta Inaba, Satoshi Tayu, and Shuichi Ueno: A 3/2-Approximation Algorithm for the Bipartite Dense Subgraph Problem on Bipartite Permutation Graphs; Proceedings of the 2016 IEICE General Conference, AS-1-3, 2016.

Hiroyuki Gunji, Satoshi Tayu, and Shuichi Ueno: On the Three-Dimensional Routing; Proceedings of the 2016 IEICE General Conference, AS-1-4, 2016.

Kenji Ichikawa, Satoshi Tayu, and Shuichi Ueno: A Note on the Spanning Subgraph Isomorphism Problem; Proceedings of the 2016 IEICE General Conference, AS-1-5, 2016.

Irina Mustaţă, Kousuke Nishikawa, Asahi Takaoka, Satoshi Tayu, and Shuichi Ueno: On orthogonal ray trees; Discrete Applied Mathematics, Vol.201, pp.201-212, 2016. DOI:10.1016/j.dam.2015.07.034