IEICE SEARCH SYSTEM

Hiro ITO

Query-Number Preserving Reductions and Linear Lower Bounds for Testing Yuichi YOSHIDA Hiro ITO
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2010/02/01 Vol. E93-D No. 2 pp. 233-240 Type of Manuscript: Special Section PAPER (Special Section on Foundations of Computer Science) Category: Keyword: property testing, lower bounds,
	Summary \| Full Text:PDF (288.1KB)

Inferring Pedigree Graphs from Genetic Distances Takeyuki TAMURA Hiro ITO
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2008/02/01 Vol. E91-D No. 2 pp. 162-169 Type of Manuscript: Special Section PAPER (Special Section on Foundations of Computer Science) Category: Graph Algorithms Keyword: algorithm, directed acyclic graph, distance matrix, pedigree, genetic distance,
	Summary \| Full Text:PDF (259.1KB)

Maximum-Cover Source-Location Problems Kenya SUGIHARA Hiro ITO
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2006/05/01 Vol. E89-A No. 5 pp. 1370-1377 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: graph, edge-connectivity, location problem, polynomial-time algorithm, NP-hard,
	Summary \| Full Text:PDF (289.4KB)

Efficient Methods for Determining DNA Probe Orders Hiro ITO Kazuo IWAMA Takeyuki TAMURA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2006/05/01 Vol. E89-A No. 5 pp. 1292-1298 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: DNA, hybridization, probe, fragment, PQ-tree,
	Summary \| Full Text:PDF (321.4KB)

-Coloring Problem Akihiro UEJIMA Hiro ITO Tatsuie TSUKIJI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2004/05/01 Vol. E87-A No. 5 pp. 1243-1250 Type of Manuscript: PAPER Category: Graphs and Networks Keyword: H-coloring, cycles of odd order, complement graphs, NP-completeness,
	Summary \| Full Text:PDF (589.3KB)

FOREWORD Hiro ITO
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2003/05/01 Vol. E86-A No. 5 pp. 977-977 Type of Manuscript: FOREWORD Category: Keyword:
	Summary \| Full Text:PDF (149.6KB)

On H-Coloring Problems with H Expressed by Complements of Cycles, Bipartite Graphs, and Chordal Graphs Akihiro UEJIMA Hiro ITO
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2002/05/01 Vol. E85-A No. 5 pp. 1026-1030 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: H-coloring, bipartite graphs, chordal graph, complement graphs, perfect graphs,
	Summary \| Full Text:PDF (506.3KB)

Channel Assignment Scheme for Integrated Voice and Data Traffic in Reservation-Type Packet Radio Networks Hideyuki UEHARA Masato FUJIHARA Mitsuo YOKOYAMA Hiro ITO
Publication: IEICE TRANSACTIONS on Communications Publication Date: 2002/01/01 Vol. E85-B No. 1 pp. 191-198 Type of Manuscript: Special Section PAPER (Special Issue on Internet Technology II -- Traffic Control and Performance Evaluation in the Internet) Category: Keyword: wireless network, MAC protocol, channel assignment, voice/data traffic,
	Summary \| Full Text:PDF (520.1KB)

A Generalization of 2-Dimension Ham Sandwich Theorem Hiro ITO Hideyuki UEHARA Mitsuo YOKOYAMA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2001/05/01 Vol. E84-A No. 5 pp. 1144-1151 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: Ham Sandwich Theorem, plane, partition, convex,
	Summary \| Full Text:PDF (408.9KB)

NP-Completeness of Reallocation Problems with Restricted Block Volume Hiroyoshi MIWA Hiro ITO
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2000/04/20 Vol. E83-A No. 4 pp. 590-597 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: reallocation, computational complexity, NP-complete, SAT, steiner tree problem,
	Summary \| Full Text:PDF (540KB)

A Faster and Flexible Algorithm for a Location Problem on Undirected Flow Networks Hiro ITO Hideyuki UEHARA Mitsuo YOKOYAMA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2000/04/20 Vol. E83-A No. 4 pp. 704-712 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: graph, network flow, location problem, node subset, polynomial time, algorithm,
	Summary \| Full Text:PDF (562.3KB)

NP-Hardness of Rotation Type Cell-Mazes Shiro AOKI Hiro ITO Hideyuki UEHARA Mitsuo YOKOYAMA Tsuyoshi HORINOUCHI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2000/03/20 Vol. E83-A No. 3 pp. 492-496 Type of Manuscript: Special Section LETTER (Special Section of Selected Papers from the 12th Workshop on Circuits and Systems in Karuizawa) Category: Keyword: puzzle, maze, computational complexity, NP-hard, polynomial-time,
	Summary \| Full Text:PDF (475.3KB)

Sparse Spanning Subgraphs Preserving Connectivity and Distance between Vertices and Vertex Subsets Hiroyoshi MIWA Hiro ITO
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1998/05/20 Vol. E81-A No. 5 pp. 832-841 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: graph, area graph, diameter, distance, connectivity, NP-complete, polynomial time, algorithm,
	Summary \| Full Text:PDF (823.5KB)

A Linear-Time Algorithm for Determining the Order of Moving Products in Realloction Problems Hiroyoshi MIWA Hiro ITO
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1997/03/20 Vol. E80-A No. 3 pp. 534-543 Type of Manuscript: Special Section PAPER (Special Section of Selected Papers from the 9th Karuizawa Workshop on Circuits and Systems) Category: Keyword: graph, reallocation, linear-time, NP-complete,
	Summary \| Full Text:PDF (818.4KB)

Complexity and Algorithm for Reallocation Problem Hiroyoshi MIWA Hiro ITO
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1996/04/20 Vol. E79-A No. 4 pp. 461-468 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: reallocation, graph, linear time, NP-complete,
	Summary \| Full Text:PDF (726KB)

Connectivity Problems on Area Graphs for Locally Striking Disasters--Direct NA-Connection-- Hiro ITO
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1995/03/20 Vol. E78-A No. 3 pp. 363-370 Type of Manuscript: Special Section PAPER (Special Section of Selected Papers from the 7th Karuizawa Workshop on Circuits and Systems) Category: Graphs and Networks Keyword: telecommunication network, graph, connectivity, disaster, area,
	Summary \| Full Text:PDF (629.9KB)

Advanced Call-Level Routing Schemes for Hybrid Controlled Dynamic Routing Akiya INOUE Hisao YAMAMOTO Hiro ITO Kenichi MASE
Publication: IEICE TRANSACTIONS on Communications Publication Date: 1991/12/20 Vol. E74-B No. 12 pp. 4025-4033 Type of Manuscript: Special Section PAPER (Special Issue on Network Control) Category: Keyword:
	Summary \| Full Text:PDF (714.2KB)