Takehiro ITO


The Complexity of (List) Edge-Coloring Reconfiguration Problem
Hiroki OSAWA Akira SUZUKI Takehiro ITO Xiao ZHOU 
Publication:   
Publication Date: 2018/01/01
Vol. E101-A  No. 1  pp. 232-238
Type of Manuscript:  PAPER
Category: Algorithms and Data Structures
Keyword: 
combinatorial reconfigurationedge-coloringplanar graphPSPACE-complete
 Summary | Full Text:PDF(1.2MB)

Reconfiguration of Steiner Trees in an Unweighted Graph
Haruka MIZUTA Takehiro ITO Xiao ZHOU 
Publication:   
Publication Date: 2017/07/01
Vol. E100-A  No. 7  pp. 1532-1540
Type of Manuscript:  PAPER
Category: Algorithms and Data Structures
Keyword: 
cographcombinatorial reconfigurationinterval graphPSPACE-completesplit graphSteiner tree
 Summary | Full Text:PDF(662.8KB)

Reconfiguration of Vertex Covers in a Graph
Takehiro ITO Hiroyuki NOOKA Xiao ZHOU 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2016/03/01
Vol. E99-D  No. 3  pp. 598-606
Type of Manuscript:  Special Section PAPER (Special Section on Foundations of Computer Science---Developments of the Theory of Algorithms and Computation---)
Category: 
Keyword: 
combinatorial reconfigurationeven-hole-free graphgraph algorithmvertex cover
 Summary | Full Text:PDF(410.2KB)

The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs
Tatsuhiko HATANAKA Takehiro ITO Xiao ZHOU 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2015/06/01
Vol. E98-A  No. 6  pp. 1168-1178
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
graph algorithmlist coloringpathwidthPSPACE-completereachability on solution spacereconfiguration
 Summary | Full Text:PDF(957.4KB)

Algorithms for the Independent Feedback Vertex Set Problem
Yuma TAMURA Takehiro ITO Xiao ZHOU 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2015/06/01
Vol. E98-A  No. 6  pp. 1179-1188
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
fixed parameter tractabilitygraph algorithmindependent feedback vertex set
 Summary | Full Text:PDF(939KB)

On the Minimum Caterpillar Problem in Digraphs
Taku OKADA Akira SUZUKI Takehiro ITO Xiao ZHOU 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2014/03/01
Vol. E97-A  No. 3  pp. 848-857
Type of Manuscript:  PAPER
Category: Algorithms and Data Structures
Keyword: 
bounded treewidth graphcaterpillardynamic programminggraph algorithminapproximability
 Summary | Full Text:PDF(1.1MB)

An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree
Takehiro ITO Kazuto KAWAMURA Xiao ZHOU 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2012/03/01
Vol. E95-D  No. 3  pp. 737-745
Type of Manuscript:  Special Section PAPER (Special Section on Foundations of Computer Science – Mathematical Foundations and Applications of Computer Science and Algorithms –)
Category: 
Keyword: 
graph algorithmlist edge-coloringreachability on solution spacereconfiguration problemtree
 Summary | Full Text:PDF(357.2KB)

Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings
Takehiro ITO Naoki SAKAMOTO Xiao ZHOU Takao NISHIZEKI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2011/02/01
Vol. E94-D  No. 2  pp. 190-195
Type of Manuscript:  Special Section PAPER (Special Section on Foundations of Computer Science -- Mathematical Foundations and Applications of Algorithms and Computer Science --)
Category: 
Keyword: 
algorithmcost edge-coloringmultitreeperfect matchingtree
 Summary | Full Text:PDF(538.5KB)

Partitioning a Multi-Weighted Graph to Connected Subgraphs of Almost Uniform Size
Takehiro ITO Kazuya GOTO Xiao ZHOU Takao NISHIZEKI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2007/02/01
Vol. E90-D  No. 2  pp. 449-456
Type of Manuscript:  Special Section PAPER (Special Section on Foundations of Computer Science)
Category: Graph Algorithms
Keyword: 
algorithmchoice partitionlower boundmaximum partition problemminimum partition problemmulti-weighted graphpartial k-treeseries-parallel graphuniform partitionupper bound
 Summary | Full Text:PDF(384.9KB)

Algorithms for Multicolorings of Partial k-Trees
Takehiro ITO Takao NISHIZEKI Xiao ZHOU 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2003/02/01
Vol. E86-D  No. 2  pp. 191-200
Type of Manuscript:  Special Section PAPER (Special Issue on Selected Papers from LA Symposium)
Category: Graph Algorithms
Keyword: 
algorithmmulticoloringpartial k-tree
 Summary | Full Text:PDF(539.2KB)