Tomio Hirata

发表

A textile design and the boolean rank problem

Isamu Matsuura, Mutsunori Yagiura, Tomio Hirata, 2009, IADIS AC.

The Biclique Cover Problem and the Modified Galois Lattice

Tomio Hirata, Hideaki Otsuki, 2015, IEICE Trans. Inf. Syst..

Shortest Safari Routes in Simple Polygon

Tomio Hirata, Xuehou Tan, X. Tan, 1994, ISAAC.

An incremental algorithm for constructing shortest watchman routes

Tomio Hirata, Yasuyoshi Inagaki, Xuehou Tan, 1993, Int. J. Comput. Geom. Appl..

Efficient routability checking for global wires in planar layouts

Tomio Hirata, Yasushi Kawaguchi, Naoyuki Iso, 1997, Proceedings of ASP-DAC '97: Asia and South Pacific Design Automation Conference.

An Approximation Algorithm for MAX 3-SAT

Takao Asano, Tomio Hirata, Takao Ono, 1995, ISAAC.

Reconfiguration of a fault-tolerant rectangular systolic array

Toshihide Ibaraki, Masafumi Yamashita, Tomio Hirata, 1988, Systems and Computers in Japan.

A Unified Linear-Time Algorithm for Computing Distance Maps

Tomio Hirata, T. Hirata, 1996, Inf. Process. Lett..

Finding shortest safari routes in simple polygons

Tomio Hirata, Xuehou Tan, X. Tan, 2003, Inf. Process. Lett..

A sufficient condition for a graph to be weakly k-linked

Tomio Hirata, Osami Saito, Kiyohito Kubota, 1984, J. Comb. Theory, Ser. B.

Edge-deletion and edge-contraction problems

Takao Asano, Tomio Hirata, 1982, STOC '82.

Number of Possible Weave Patterns Increased by Introducing Long-Eye Heald

Isamu Matsuura, Tomio Hirata, Masayoshi Andoh, 2006 .

Inapproximability of the Minimum Biclique Edge Partition Problem

Tomio Hirata, Hideaki Otsuki, 2010, IEICE Trans. Inf. Syst..

New Bounds for the Nearly Equitable Edge Coloring Problem

Uri Zwick, Mutsunori Yagiura, Tomio Hirata, 2007, ISAAC.

Approximation Algorithms for the Maximum Satisfiability Problem

Takao Asano, Tomio Hirata, Takao Ono, 1996, Nord. J. Comput..

Designing Efficient Geometric Search Algorithms Using Persistent Binary-Binary Search Trees

Tomio Hirata, Yasuyoshi Inagaki, Xuehou Tan, 1994 .

Computational complexity of the file allocation problem in distributed database systems

Toshihide Ibaraki, Tomio Hirata, Masaharu Imai, 1988, Systems and Computers in Japan.

A parallel algorithm for tree pattern matching

Tomio Hirata, Yasuyoshi Inagaki, Koji Tarora, 1993, Systems and Computers in Japan.

Spatial Point Location and Its Applications

Tomio Hirata, Yasuyoshi Inagaki, Xuehou Tan, 1990, SIGAL International Symposium on Algorithms.

A Necessary and Sufficient Condition for a Bipartite Distance-Hereditary Graph to Be Hamiltonian

Tomio Hirata, Masahide Takasuga, 2012, TJJCCGG.

A note on the Greedy algorithm for finding independent sets of Ck-free graphs

Tomio Hirata, Takao Ono, Ippei Koura, 2009, Inf. Process. Lett..

Distance Map Based Enhancementfor Interpolated Images

Tomio Hirata, PeiFeng Zeng, T. Hirata, 2002, Theoretical Foundations of Computer Vision.

Interior materials for motor vehicles

Tomio Hirata, Akira Kawai, Kazuyuki Yamamoto, 1997 .

Edge-Contraction Problems

Takao Asano, Tomio Hirata, 1983, J. Comput. Syst. Sci..

An efficient algorithm for the euclidean distance transformation

Kenji Kise, Tomio Hirata, Toyofumi Saito, 1996, Systems and Computers in Japan.

Fast defect detection in cloths with B-splines

Tomio Hirata, Peifeng Zeng, 2002 .

Approximation algorithms for the weighted independent set problem in sparse graphs

Tomio Hirata, Magnús M. Halldórsson, Takao Ono, 2009, Discret. Appl. Math..

Constructing Shortest Watchman Routes by Divide-and-Conquer

Tomio Hirata, Xuehou Tan, X. Tan, 1993, ISAAC.

Refined Computations for Points of the Form 2kP Based on Montgomery Trick

Tomio Hirata, Daisuke Adachi, T. Hirata, 2006, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

Approximation Algorithms for the Weighted Independent Set Problem

Tomio Hirata, Magnús M. Halldórsson, Takao Ono, 2005, WG.

Development of Demand Responsive Bus System in Rural Areas -Practical Routing Algorithm-

Tomio Hirata, Yasuhide Konda, Masahiro Okaya, 2001 .

Approximation algorithms for MAX SAT

Tomio Hirata, Takao Ono, 2000 .

A systolic algorithm for Euclidean distance transform

Tomio Hirata, Masafumi Miyazawa, Naoyuki Iso, 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

A Theoretical Framework of Hybrid Approaches to MAX SAT

Takao Asano, Tomio Hirata, Takao Ono, 1997, ISAAC.

Inapproximability of the Edge-Contraction Problem

Tomio Hirata, Hideaki Otsuki, T. Hirata, 2006, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

Corrigendum to "An Incremental Algorithm for Constructing Shortest Watchman Routes"

Tomio Hirata, Yasuyoshi Inagaki, Xuehou Tan, 1991, Int. J. Comput. Geom. Appl..

Complexity of Projected Images of Convex Subdivisions

Jirí Matousek, Takeshi Tokuyama, Tomio Hirata, 1994, Comput. Geom..

The Intersection Searching Problem for c-Oriented Polygons

Tomio Hirata, Yasuyoshi Inagaki, Xuehou Tan, 1991, Inf. Process. Lett..

An Efficient Algorithm for the Nearly Equitable Edge Coloring Problem

Uri Zwick, Mutsunori Yagiura, Tomio Hirata, 2008, J. Graph Algorithms Appl..

A Vector Assignment Approach for the Graph Coloring Problem

Mutsunori Yagiura, Tomio Hirata, Takao Ono, 2007, LION.

Steering wheel with built-in heater

Tomio Hirata, Kazuo Inaba, Hidenori Kurata, 1983 .

Lower bounds on time complexity for some subgraph detection problems

Toshihide Ibaraki, Masafumi Yamashita, Tomio Hirata, 1986, Systems and Computers in Japan.

An Improved Algorithm for the Nearly Equitable Edge-Coloring Problem

Tomio Hirata, Shin-ichi Nakano, Takao Ono, 2004 .

Approximation Algorithms for MAX SAT : Semidefinite Programming and Network Flows Approach

Takao Asano, Tomio Hirata, Takao Ono, 1997 .