勝又広揮研究業績一覧 | T2R2 東京科学大学リサーチリポジトリ

勝又広揮研究業績一覧 (5件)

Hiroki Katsumata, Satoshi Tayu, Shuichi UENO. On the Complexity of Finding a Largest Common Subtree of Trees, The 20th Japan Conference on Discrete and Computational Geometry, Graphs, and Games, Lecture Notes in Computer Science, pp. 125-126, Aug. 2017.

Hiroki Katsumata, Satoshi Tayu. On Three-Directional Orthogonal Ray Cacti, IPSJ SIGAL, IPSJ SIG Technical Report, Vol. 2020-AL-3, Nov. 2020.
Hiroki Katsumata, Satoshi Tayu, Shuichi Ueno. On the Orthogonal Ray Cacti, 2018 IEICE Society Conference, Proceedings of the 2018 IEICE Society Conference, No. A-1-3, Sept. 2018.
Hiroki Katsumata, Satoshi Tayu, Shuichi UENO. A Note on the Largest Common Subgraph Problem, Proceedings of the 2016 IEICE General Conference, Institute of Electronics, Information and Communication Engineers, No. A-1-6, Mar. 2017.
Hiroki Katsumata, Satoshi Tayu, Shuichi UENO. On the Complexity of Finding a Largest Common Subtree of Trees, Technical Report of the IEICE, Institute of Electronics, Information and Communication Engineers, Vol. 116, No. 315, pp. 89-92, Nov. 2016.