Toshiki SAITOH

Complexity of the Maximum k-Path Vertex Cover Problem
Eiji MIYANO Toshiki SAITOH Ryuhei UEHARA Tsuyoshi YAGITA Tom C. van der ZANDEN 
Publication:   
Publication Date: 2020/10/01
Vol. E103-A  No. 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, 
 Summary | Full Text:PDF(1.9MB)
Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs
Masashi KIYOMI Toshiki SAITOH Ryuhei UEHARA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2013/03/01
Vol. E96-D  No. 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, 
 Summary | Full Text:PDF(540.1KB)
Voronoi Game on a Path
Masashi KIYOMI Toshiki SAITOH Ryuhei UEHARA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2011/06/01
Vol. E94-D  No. 6  pp. 1185-1189
Type of Manuscript:  PAPER
Category: Fundamentals of Information Systems
Keyword: 
Discrete Voronoi game, combinatorial game theory, 
 Summary | Full Text:PDF(210.5KB)
Random Generation and Enumeration of Proper Interval Graphs
Toshiki SAITOH Katsuhisa YAMANAKA Masashi KIYOMI Ryuhei UEHARA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2010/07/01
Vol. E93-D  No. 7  pp. 1816-1823
Type of Manuscript:  PAPER
Category: Fundamentals of Information Systems
Keyword: 
counting, enumeration, proper interval graphs, random generation, unit interval graphs, 
 Summary | Full Text:PDF(282.6KB)