Tomio HIRATA


The Biclique Cover Problem and the Modified Galois Lattice
Hideaki OTSUKI Tomio HIRATA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2015/03/01
Vol. E98-D  No. 3  pp. 497-502
Type of Manuscript:  Special Section PAPER (Special Section on Foundations of Computer Science---New Spirits in Theory of Computation and Algorithm---)
Category: 
Keyword: 
biqlique coverGalois latticedomino-free
 Summary | Full Text:PDF

Inapproximability of the Minimum Biclique Edge Partition Problem
Hideaki OTSUKI Tomio HIRATA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2010/02/01
Vol. E93-D  No. 2  pp. 290-292
Type of Manuscript:  Special Section LETTER (Special Section on Foundations of Computer Science)
Category: 
Keyword: 
bicliqueedge partitionNP-hardinapproximability
 Summary | Full Text:PDF

Inapproximability of the Edge-Contraction Problem
Hideaki OTSUKI Tomio HIRATA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2006/05/01
Vol. E89-A  No. 5  pp. 1425-1427
Type of Manuscript:  Special Section LETTER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
edge-contraction problemNP-hardapproximation algorithmapproximabilityconnected vertex cover problem
 Summary | Full Text:PDF

Refined Computations for Points of the Form 2kP Based on Montgomery Trick
Daisuke ADACHI Tomio HIRATA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2006/01/01
Vol. E89-A  No. 1  pp. 334-339
Type of Manuscript:  LETTER
Category: Information Security
Keyword: 
scalar multiplicationelliptic curve arithmeticMontgomery trickwindow method
 Summary | Full Text:PDF

An Improved Algorithm for the Nearly Equitable Edge-Coloring Problem
Xuzhen XIE Takao ONO Shin-ichi NAKANO Tomio HIRATA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2004/05/01
Vol. E87-A  No. 5  pp. 1029-1033
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
nearly equitable edge coloringEuler circuit
 Summary | Full Text:PDF

On Approximation Algorithms for Coloring k-Colorable Graphs
Xuzhen XIE Takao ONO Tomio HIRATA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2003/05/01
Vol. E86-A  No. 5  pp. 1046-1051
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
graph coloringapproximation algorithmsNP-hardmaximum degree
 Summary | Full Text:PDF

An Improved Algorithm for the Net Assignment Problem
Takao ONO Tomio HIRATA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2001/05/01
Vol. E84-A  No. 5  pp. 1161-1165
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
logic emulatornet assignment problemedge coloringnearly equitable edge coloring
 Summary | Full Text:PDF

Approximation Algorithms for MAX SAT
Tomio HIRATA Takao ONO 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2000/03/25
Vol. E83-D  No. 3  pp. 488-495
Type of Manuscript:  INVITED SURVEY PAPER
Category: Approximate Algorithms for Combinatorial Problems
Keyword: 
MAX SATapproximation algorithmssemidefinite programming
 Summary | Full Text:PDF

FOREWORD
Tomio HIRATA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1998/05/25
Vol. E81-A  No. 5  pp. 723-723
Type of Manuscript:  FOREWORD
Category: 
Keyword: 
 Summary | Full Text:PDF

Efficient Routability Checking for Global Wires in Planar Layouts
Naoyuki ISO Yasushi KAWAGUCHI Tomio HIRATA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1997/10/25
Vol. E80-A  No. 10  pp. 1878-1882
Type of Manuscript:  Special Section PAPER (Special Section on VLSI Design and CAD Algorithms)
Category: 
Keyword: 
layout designroutabilityrouting
 Summary | Full Text:PDF

Designing Efficient Geometric Search Algorithms Using Persistent Binary-Binary Search Trees
Xuehou TAN Tomio HIRATA Yasuyoshi INAGAKI 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1994/04/25
Vol. E77-A  No. 4  pp. 601-607
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
computational geometrypersistent data structurespersistent binary-binary search treesray-shooting
 Summary | Full Text:PDF

On Translating a Set of C-Oriented Faces in Three Dimensions
Xue-Hou TAN Tomio HIRATA Yasuyoshi INAGAKI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 1992/05/25
Vol. E75-D  No. 3  pp. 258-264
Type of Manuscript:  PAPER
Category: Algorithm and Computational Complexity
Keyword: 
computational geometrytranslation problemsc-oriented facesray-shootingpriority search trees
 Summary | Full Text:PDF

Reporting Intersections of C-Oriented Polygons
Xue-Hou TAN Tomio HIRATA Yasuyoshi INAGAKI 
Publication:   IEICE TRANSACTIONS (1976-1990)
Publication Date: 1990/11/25
Vol. E73-E  No. 11  pp. 1886-1892
Type of Manuscript:  PAPER
Category: Algorithm and Computational Complexity
Keyword: 
 Summary | Full Text:PDF