Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2020/10/01 Vol. E103-ANo. 10 ;
pp. 1193-1201 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: complexity theory Keyword: Maximum k-path vertex cover, NP-hardness, polynomial time algorithm, split graphs, bounded treewidth,
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2018/09/01 Vol. E101-ANo. 9 ;
pp. 1344-1354 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: tree structured pattern, graph pattern matching algorithm, polynomial time algorithm, NP-completeness,
Polynomial Time Verification of Reachability in Sound Extended Free-Choice Workflow Nets Shingo YAMAGUCHI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2014/02/01 Vol. E97-ANo. 2 ;
pp. 468-475 Type of Manuscript: Special Section PAPER (Special Section on Mathematical Systems Science and its Applications) Category: Keyword: Petri net, workflow net, reachability, extended free-choice, well-structured, polynomial time algorithm,
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2013/03/01 Vol. E96-DNo. 3 ;
pp. 426-432 Type of Manuscript: Special Section PAPER (Special Section on Foundations of Computer Science — New Trends in Algorithms and Theory of Computation —) Category: Keyword: the graph reconstruction conjecture, permutation graphs, polynomial time algorithm,