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 testinglower bounds
 Summary | Full Text:PDF(289.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: 
algorithmdirected acyclic graphdistance matrixpedigreegenetic distance
 Summary | Full Text:PDF(258.3KB)

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: 
graphedge-connectivitylocation problempolynomial-time algorithmNP-hard
 Summary | Full Text:PDF(288.5KB)

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: 
DNAhybridizationprobefragmentPQ-tree
 Summary | Full Text:PDF(320.7KB)

-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-coloringcycles of odd ordercomplement graphsNP-completeness
 Summary | Full Text:PDF(593.7KB)

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(148.5KB)

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-coloringbipartite graphschordal graphcomplement graphsperfect graphs
 Summary | Full Text:PDF(504.4KB)

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 networkMAC protocolchannel assignmentvoice/data traffic
 Summary | Full Text:PDF(518KB)

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 Theoremplanepartitionconvex
 Summary | Full Text:PDF(406.7KB)

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/25
Vol. E83-A  No. 4  pp. 704-712
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
graphnetwork flowlocation problemnode subsetpolynomial timealgorithm
 Summary | Full Text:PDF(558.8KB)

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/25
Vol. E83-A  No. 4  pp. 590-597
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
reallocationcomputational complexityNP-completeSATsteiner tree problem
 Summary | Full Text:PDF(536.7KB)

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/25
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: 
puzzlemazecomputational complexityNP-hardpolynomial-time
 Summary | Full Text:PDF(472.6KB)

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/25
Vol. E81-A  No. 5  pp. 832-841
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
grapharea graphdiameterdistanceconnectivityNP-completepolynomial timealgorithm
 Summary | Full Text:PDF(821.4KB)

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/25
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: 
graphreallocationlinear-timeNP-complete
 Summary | Full Text:PDF(817KB)

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/25
Vol. E79-A  No. 4  pp. 461-468
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
reallocationgraphlinear timeNP-complete
 Summary | Full Text:PDF(724.1KB)

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/25
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 networkgraphconnectivitydisasterarea
 Summary | Full Text:PDF(629.8KB)

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/25
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)