Edge-Deletion and Edge-Contraction Problems - Takao Asano; Tomio Hirata (STOC, 1982)

Edge-Contraction Problems. - Takao Asano; Tomio Hirata (J. Comput. Syst. Sci., 1983)

A sufficient condition for a graph to be weakly k-linked. - Tomio Hirata; Kiyohito Kubota; Osami Saito (J. Comb. Theory B, 1984)

Lower bounds on time complexity for some subgraph detection problems. - Masanari Arai; Masafumi Yamashita; Tomio Hirata; Toshihide Ibaraki; Namio Honda (Syst. Comput. Jpn., 1986)

Reconfiguration of a fault-tolerant rectangular systolic array. - Yoshinao Suzuki; Tomio Hirata; Masaharu Imai; Masafumi Yamashita; Toshihide Ibaraki (Syst. Comput. Jpn., 1988)

Computational complexity of the file allocation problem in distributed database systems. - Hiroshi Yamasaki; Tomio Hirata; Masaharu Imai; Toshihide Ibaraki (Syst. Comput. Jpn., 1988)

Spatial Point Location and Its Applications. - Xuehou Tan; Tomio Hirata; Yasuyoshi Inagaki (SIGAL International Symposium on Algorithms, 1990)

The Intersection Searching Problem for c-Oriented Polygons. - Xuehou Tan; Tomio Hirata; Yasuyoshi Inagaki (Inf. Process. Lett., 1991)

Constructing Shortest Watchman Routes by Divide-and-Conquer. - Xuehou Tan; Tomio Hirata (ISAAC, 1993)

An incremental algorithm for constructing shortest watchman routes. - Xuehou Tan; Tomio Hirata; Yasuyoshi Inagaki (Int. J. Comput. Geom. Appl., 1993)

A parallel algorithm for tree pattern matching. - Koji Tarora; Tomio Hirata; Yasuyoshi Inagaki (Syst. Comput. Jpn., 1993)

Shortest Safari Routes in Simple Polygon. - Xuehou Tan; Tomio Hirata (ISAAC, 1994)

Complexity of Projected Images of Convex Subdivisions. - Tomio Hirata; Jirí Matousek 001; Xuehou Tan; Takeshi Tokuyama (Comput. Geom., 1994)

An Approximation Algorithm for MAX 3-SAT. - Takao Ono; Tomio Hirata; Takao Asano (ISAAC, 1995)

A Unified Linear-Time Algorithm for Computing Distance Maps. - Tomio Hirata (Inf. Process. Lett., 1996)

Approximation Algorithms for the Maximum Satisfiability Problem. - Takao Asano; Takao Ono; Tomio Hirata (Nord. J. Comput., 1996)

An efficient algorithm for the euclidean distance transformation. - Toshihiro Kato; Tomio Hirata; Toyofumi Saito; Kenji Kise (Syst. Comput. Jpn., 1996)

Efficient routability checking for global wires in planar layouts. - Naoyuki Iso; Yasushi Kawaguchi; Tomio Hirata (ASP-DAC, 1997)

A Theoretical Framework of Hybrid Approaches to MAX SAT. - Takao Asano; Kuniaki Hori; Takao Ono; Tomio Hirata (ISAAC, 1997)

Corrigendum to "An Incremental Algorithm for Constructing Shortest Watchman Routes". - Xuehou Tan; Tomio Hirata; Yasuyoshi Inagaki (Int. J. Comput. Geom. Appl., 1999)

Distance Map Based Enhancementfor Interpolated Images. - PeiFeng Zeng; Tomio Hirata (Theoretical Foundations of Computer Vision, 2002)

On Approximation Algorithms for Coloring k-Colorable Graphs. - Xuzhen Xie; Takao Ono; Tomio Hirata (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003)

Finding shortest safari routes in simple polygons. - Xuehou Tan; Tomio Hirata (Inf. Process. Lett., 2003)

Approximation Algorithms for the Weighted Independent Set Problem. - Akihisa Kako; Takao Ono; Tomio Hirata; Magnús M. Halldórsson (WG, 2005)

Refined Computations for Points of the Form 2kP Based on Montgomery Trick. - Daisuke Adachi; Tomio Hirata (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006)

Inapproximability of the Edge-Contraction Problem. - Hideaki Otsuki; Tomio Hirata (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006)

A Systolic Algorithm for Euclidean Distance Transform. - Masafumi Miyazawa; PeiFeng Zeng; Naoyuki Iso; Tomio Hirata (IEEE Trans. Pattern Anal. Mach. Intell., 2006)

New Bounds for the Nearly Equitable Edge Coloring Problem. - Xuzhen Xie; Mutsunori Yagiura; Takao Ono; Tomio Hirata; Uri Zwick (ISAAC, 2007)

A Vector Assignment Approach for the Graph Coloring Problem. - Takao Ono; Mutsunori Yagiura; Tomio Hirata (LION, 2007)

An Efficient Algorithm for the Nearly Equitable Edge Coloring Problem. - Xuzhen Xie; Mutsunori Yagiura; Takao Ono; Tomio Hirata; Uri Zwick (J. Graph Algorithms Appl., 2008)

A textile design and the boolean rank problem. - Isamu Matsuura; Mutsunori Yagiura; Tomio Hirata (IADIS AC (1), 2009)

Approximation algorithms for the weighted independent set problem in sparse graphs. - Akihisa Kako; Takao Ono; Tomio Hirata; Magnús M. Halldórsson (Discret. Appl. Math., 2009)

A note on the Greedy algorithm for finding independent sets of Ck-free graphs. - Ippei Koura; Takao Ono; Tomio Hirata (Inf. Process. Lett., 2009)

Inapproximability of the Minimum Biclique Edge Partition Problem. - Hideaki Otsuki; Tomio Hirata (IEICE Trans. Inf. Syst., 2010)

A Necessary and Sufficient Condition for a Bipartite Distance-Hereditary Graph to Be Hamiltonian. - Masahide Takasuga; Tomio Hirata (TJJCCGG, 2012)

The Biclique Cover Problem and the Modified Galois Lattice. - Hideaki Otsuki; Tomio Hirata (IEICE Trans. Inf. Syst., 2015)