IEICE SEARCH SYSTEM

Xiao ZHOU

The Coloring Reconfiguration Problem on Specific Graph Classes Tatsuhiko HATANAKA Takehiro ITO Xiao ZHOU
Publication: Publication Date: 2019/03/01 Vol. E102-D No. 3 pp. 423-429 Type of Manuscript: Special Section PAPER (Special Section on Foundations of Computer Science — Algorithm, Theory of Computation, and their Applications —) Category: Keyword: chordal graphs, combinatorial reconfiguration, graph algorithm, graph coloring, PSPACE-complete,
	Summary \| Full Text:PDF(836.5KB)

Computational Power of Threshold Circuits of Energy at most Two Hiroki MANIWA Takayuki OKI Akira SUZUKI Kei UCHIZAWA Xiao ZHOU
Publication: Publication Date: 2018/09/01 Vol. E101-A No. 9 pp. 1431-1439 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: circuit complexity, energy complexity, MOD function, neural network, threshold circuit,
	Summary \| Full Text:PDF(1.4MB)

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 reconfiguration, edge-coloring, planar graph, PSPACE-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: cograph, combinatorial reconfiguration, interval graph, PSPACE-complete, split graph, Steiner 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 reconfiguration, even-hole-free graph, graph algorithm, vertex 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 algorithm, list coloring, pathwidth, PSPACE-complete, reachability on solution space, reconfiguration,
	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 tractability, graph algorithm, independent 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 graph, caterpillar, dynamic programming, graph algorithm, inapproximability,
	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 algorithm, list edge-coloring, reachability on solution space, reconfiguration problem, tree,
	Summary \| Full Text:PDF(357.2KB)

A Novel Noise Suppression Method in Channel Estimation Xiao ZHOU Fang YANG Jian SONG
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2011/10/01 Vol. E94-A No. 10 pp. 2027-2030 Type of Manuscript: LETTER Category: Noise and Vibration Keyword: noise suppression, channel estimation, degree of confidence, false alarm reduction,
	Summary \| Full Text:PDF(496.6KB)

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: algorithm, cost edge-coloring, multitree, perfect matching, tree,
	Summary \| Full Text:PDF(538.5KB)

Sufficient Condition and Algorithm for List Total Colorings of Series-Parallel Graphs Yuki MATSUO Xiao ZHOU Takao NISHIZEKI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2007/05/01 Vol. E90-A No. 5 pp. 907-916 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: algorithm, total coloring, list total coloring, series-parallel graph,
	Summary \| Full Text:PDF(379.3KB)

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: algorithm, choice partition, lower bound, maximum partition problem, minimum partition problem, multi-weighted graph, partial k-tree, series-parallel graph, uniform partition, upper bound,
	Summary \| Full Text:PDF(384.9KB)

Cost Total Colorings of Trees Shuji ISOBE Xiao ZHOU Takao NISHIZEKI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2004/02/01 Vol. E87-D No. 2 pp. 337-342 Type of Manuscript: Special Section PAPER (Special Section on Foundations of Computer Science) Category: Keyword: cost total coloring, dynamic programming, matching, total coloring, tree,
	Summary \| Full Text:PDF(245.6KB)

List Edge-Colorings of Series-Parallel Graphs Tomoya FUJINO Xiao ZHOU Takao NISHIZEKI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2003/05/01 Vol. E86-A No. 5 pp. 1034-1045 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: algorithm, list edge-coloring, series-parallel graph,
	Summary \| Full Text:PDF(487KB)

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: algorithm, multicoloring, partial k-tree,
	Summary \| Full Text:PDF(539.2KB)

Linear Algorithm for Finding List Edge-Colorings of Series-Parallel Graphs Tomoya FUJINO Shuji ISOBE Xiao ZHOU Takao NISHIZEKI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2003/02/01 Vol. E86-D No. 2 pp. 186-190 Type of Manuscript: Special Section PAPER (Special Issue on Selected Papers from LA Symposium) Category: Graph Algorithms Keyword: algorithm, list edge-coloring, series-parallel graph,
	Summary \| Full Text:PDF(241.7KB)

Generalized Vertex-Colorings of Partial k-Trees Xiao ZHOU Yasuaki KANARI Takao NISHIZEKI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2000/04/25 Vol. E83-A No. 4 pp. 671-678 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: algorithm, generalized vertex-coloring, l-coloring, partial k-tree,
	Summary \| Full Text:PDF(562.4KB)

Graph Coloring Algorithms Xiao ZHOU Takao NISHIZEKI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2000/03/25 Vol. E83-D No. 3 pp. 407-417 Type of Manuscript: INVITED SURVEY PAPER Category: Graph Algorithms Keyword: algorithm, edge-coloring, f-coloring, [g,f]-coloring, total coloring,
	Summary \| Full Text:PDF(503.8KB)

Generalized Edge-Rankings of Trees Xiao ZHOU Md. Abul KASHEM Takao NISHIZEKI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1998/02/25 Vol. E81-A No. 2 pp. 310-320 Type of Manuscript: PAPER Category: Algorithms and Data Structures Keyword: algorithm, edge-ranking, tree, separator tree, visible edges,
	Summary \| Full Text:PDF(916.8KB)

Optimal Parallel Algorithms for Edge-Coloring Partial k-Trees with Bounded Degrees Xiao ZHOU Takao NISHIZEKI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1995/04/25 Vol. E78-A No. 4 pp. 463-469 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: edge-coloring, parallel algorithm, DP algorithm,
	Summary \| Full Text:PDF(605KB)