Seinosuke Toda

Colored Hypergraph Isomorphism is Fixed Parameter Tractable 

Proceedings of IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 327-337, Dec, 2010  Peer-reviewed

Computational complexity of computing a partial solution for the Graph Automorphism problems 

Theoretical Computer Science, 410(21-23) 2064-2071, May, 2009  Peer-reviewed

Computational complexity of computing a partial solution for the graph automorphism problems 

Annual Reports of The Institute of Information Sciences, (8) 1-18, Mar, 2009  

Ｃ言語におけるポインタ概念の論理形式 

「知識構造科学の創造へ向けての基礎研究」，日本大学精神文化研究所・共同研究成果報告書（単行書）, 41-61, Mar 21, 2008  

Relating Complete and Partial Solution for Problems Similar to Graph Automorphism 

Lecture Notes in Computer Science(32nd International Symposium on Mathematical Foundations of Computer Science), 4708 584-595, Aug, 2007  Peer-reviewed

Computing Automorphism Groups of Chordal Graphs Whose Simplicial Components Are of Small Size 

IEICE Transactions on Information Systems, 89-D(8) 2388-2401, Aug, 2006  Peer-reviewed

文書資料における知識構造の解析 

「近現代知識論の動向とその21世紀的展望」，日本大学精神文化研究所・共同研究報告書（単行書）, 183-208, Feb 25, 2005  

Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs 

Discrete Applied Mathematics, 145(3) 479-482, Jan, 2005  

The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes 

Theoretical Computer Science, 304 129-156, 2003  

グラフ同型写像の数え上げ問題に対するアルゴリズム 

電子情報通信学会論文誌, J85-D1(5) 424-435, 2002  

グラフ同型性判定問題の計算量 

電子情報通信学会論文誌, J85-DⅠ(2) 100-115, 2002  

グラフ同型性判定問題 

冨山房, 2001  

Traversing Graphs in Small Space 

IEICE Transactions on Information and Systems, E83-D(3) 392-396, 2000  

Some Observations on the Computational Complexity of Graph Accessibility Problem 

Proceedings of the 5th Annual International Conference on Computing and Combinatorics, COCOON'99, 18-30, 1999  

On the computational complexity of graph accessibility problem 

Technical Report of IEICE, 17-24, 1998  

The Complpxity of Selecting Maximal Solutions 

Information and Computation, 119(2) 231-239, 1995  

On closure properties of GapP 

Computational Complexity, 54(2) 242-261, 1994  

Space-efficient recognition of sparse self-reducible languages 

Computational Complexity, 54(2) 262-296, 1994  

Simple characterizations of P(#P) and complete problems 

Journal of Computer and System Sciences, 49(1) 1-17, 1994