Tomio Hirata

Publication Activity (10 Years)

Years Active: 1982-2015
Publications (10 Years): 1

Top Topics

Euclidean Distance

Lattice Structure

Undirected Graph

Asymptotic Stability

Top Venues

IEICE Trans. Inf. Syst.

Publications

Hideaki Otsuki, Tomio Hirata
The Biclique Cover Problem and the Modified Galois Lattice. IEICE Trans. Inf. Syst. (3) (2015)
Masahide Takasuga, Tomio Hirata
A Necessary and Sufficient Condition for a Bipartite Distance-Hereditary Graph to Be Hamiltonian. TJJCCGG (2012)
Hideaki Otsuki, Tomio Hirata
Inapproximability of the Minimum Biclique Edge Partition Problem. IEICE Trans. Inf. Syst. (2) (2010)
Ippei Koura, Takao Ono, Tomio Hirata
-free graphs. Inf. Process. Lett. 109 (10) (2009)
Akihisa Kako, Takao Ono, Tomio Hirata, Magnús M. Halldórsson
Approximation algorithms for the weighted independent set problem in sparse graphs. Discret. Appl. Math. 157 (4) (2009)
Isamu Matsuura, Mutsunori Yagiura, Tomio Hirata
A textile design and the boolean rank problem. IADIS AC (1) (2009)
Xuzhen Xie, Mutsunori Yagiura, Takao Ono, Tomio Hirata, Uri Zwick
An Efficient Algorithm for the Nearly Equitable Edge Coloring Problem. J. Graph Algorithms Appl. 12 (4) (2008)
Takao Ono, Mutsunori Yagiura, Tomio Hirata
A Vector Assignment Approach for the Graph Coloring Problem. LION (2007)
Xuzhen Xie, Mutsunori Yagiura, Takao Ono, Tomio Hirata, Uri Zwick
New Bounds for the Nearly Equitable Edge Coloring Problem. ISAAC (2007)
Hideaki Otsuki, Tomio Hirata
Inapproximability of the Edge-Contraction Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (5) (2006)
Masafumi Miyazawa, PeiFeng Zeng, Naoyuki Iso, Tomio Hirata
A Systolic Algorithm for Euclidean Distance Transform. IEEE Trans. Pattern Anal. Mach. Intell. 28 (7) (2006)
Daisuke Adachi, Tomio Hirata
Based on Montgomery Trick. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (1) (2006)
Akihisa Kako, Takao Ono, Tomio Hirata, Magnús M. Halldórsson
Approximation Algorithms for the Weighted Independent Set Problem. WG (2005)
Xuehou Tan, Tomio Hirata
Finding shortest safari routes in simple polygons. Inf. Process. Lett. 87 (4) (2003)
Xuzhen Xie, Takao Ono, Tomio Hirata
-Colorable Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (5) (2003)
PeiFeng Zeng, Tomio Hirata
Distance Map Based Enhancementfor Interpolated Images. Theoretical Foundations of Computer Vision (2002)
Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki
Corrigendum to "An Incremental Algorithm for Constructing Shortest Watchman Routes". Int. J. Comput. Geom. Appl. 9 (3) (1999)
Takao Asano, Kuniaki Hori, Takao Ono, Tomio Hirata
A Theoretical Framework of Hybrid Approaches to MAX SAT. ISAAC (1997)
Naoyuki Iso, Yasushi Kawaguchi, Tomio Hirata
Efficient routability checking for global wires in planar layouts. ASP-DAC (1997)
Tomio Hirata
A Unified Linear-Time Algorithm for Computing Distance Maps. Inf. Process. Lett. 58 (3) (1996)
Toshihiro Kato, Tomio Hirata, Toyofumi Saito, Kenji Kise
An efficient algorithm for the euclidean distance transformation. Systems and Computers in Japan 27 (7) (1996)
Takao Asano, Takao Ono, Tomio Hirata
Approximation Algorithms for the Maximum Satisfiability Problem. SWAT (1996)
Takao Asano, Takao Ono, Tomio Hirata
Approximation Algorithms for the Maximum Satisfiability Problem. Nord. J. Comput. 3 (4) (1996)
Takao Ono, Tomio Hirata, Takao Asano
An Approximation Algorithm for MAX 3-SAT. ISAAC (1995)
Tomio Hirata, Jirí Matousek, Xuehou Tan, Takeshi Tokuyama
Complexity of Projected Images of Convex Subdivisions. Comput. Geom. 4 (1994)
Xuehou Tan, Tomio Hirata
Shortest Safari Routes in Simple Polygon. ISAAC (1994)
Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki
An incremental algorithm for constructing shortest watchman routes. Int. J. Comput. Geom. Appl. 3 (4) (1993)
Xuehou Tan, Tomio Hirata
Constructing Shortest Watchman Routes by Divide-and-Conquer. ISAAC (1993)
Koji Tarora, Tomio Hirata, Yasuyoshi Inagaki
A parallel algorithm for tree pattern matching. Systems and Computers in Japan 24 (5) (1993)
Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki
The Intersection Searching Problem for c-Oriented Polygons. Inf. Process. Lett. 37 (4) (1991)
Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki
An Incremental Algorithm for Constructing Shortest Watchman Routes. ISA (1991)
Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki
Spatial Point Location and Its Applications. SIGAL International Symposium on Algorithms (1990)
Hiroshi Yamasaki, Tomio Hirata, Masaharu Imai, Toshihide Ibaraki
Computational complexity of the file allocation problem in distributed database systems. Systems and Computers in Japan 19 (3) (1988)
Yoshinao Suzuki, Tomio Hirata, Masaharu Imai, Masafumi Yamashita, Toshihide Ibaraki
Reconfiguration of a fault-tolerant rectangular systolic array. Systems and Computers in Japan 19 (1) (1988)
Masanari Arai, Masafumi Yamashita, Tomio Hirata, Toshihide Ibaraki, Namio Honda
Lower bounds on time complexity for some subgraph detection problems. Systems and Computers in Japan 17 (6) (1986)
Tomio Hirata, Kiyohito Kubota, Osami Saito
-linked. J. Comb. Theory, Ser. B 36 (1) (1984)
Takao Asano, Tomio Hirata
Edge-Contraction Problems. J. Comput. Syst. Sci. 26 (2) (1983)
Takao Asano, Tomio Hirata
Edge-Deletion and Edge-Contraction Problems STOC (1982)