2017
Satoshi Tayu and Shuichi Ueno:
On the Recognition of Unit Grid Intersection Graphs;
IEICE Technical Report, Vol.117, No.300, pp.15-20, 2017.
Hiroki Katsumata, Satoshi Tayu, and Shuichi Ueno:
On the Complexity of Finding a Largest Common Subtree of Trees;
Proc. of the 20th Japan Conference on Discrete and Computational Geometry, Graphs, and Games, pp.125-126, 2017.
S. Tayu and S. Ueno:
Stable Matchings in Trees,
Lecture Notes in Computer Science, Vol. 10392, pp.492-503, 2017.
Hiroki Katsumata, Satoshi Tayu, and Shuichi Ueno:
A Note on the Largest Common Subgraph Problem;
Proceedings of the 2017 IEICE General Conference, A-1-6, 2017.
Kotaro Mure, Satoshi Tayu, and Shuichi Ueno:
A Note on the Subgraph Isomorphism Problem;
Proceedings of the 2017 IEICE General Conference, A-1-7, 2017.
|