Tomio Hirata

According to our database, Tomio Hirata authored at least 36 papers between 1982 and 2015.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2015

The Biclique Cover Problem and the Modified Galois Lattice.

Hideaki Otsuki, Tomio Hirata

IEICE Trans. Inf. Syst., 2015

2012

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

Masahide Takasuga, Tomio Hirata

Proceedings of the Computational Geometry and Graphs - Thailand-Japan Joint Conference, 2012

2010

Inapproximability of the Minimum Biclique Edge Partition Problem.

Hideaki Otsuki, Tomio Hirata

IEICE Trans. Inf. Syst., 2010

2009

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

Ippei Koura, Takao Ono, Tomio Hirata

Inf. Process. Lett., 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 textile design and the boolean rank problem.

Isamu Matsuura, Mutsunori Yagiura, Tomio Hirata

Proceedings of the IADIS International Conference Applied Computing 2009, 2009

2008

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

2007

A Vector Assignment Approach for the Graph Coloring Problem.

Takao Ono, Mutsunori Yagiura, Tomio Hirata

Proceedings of the Learning and Intelligent Optimization, Second International Conference, 2007

New Bounds for the Nearly Equitable Edge Coloring Problem.

Xuzhen Xie, Mutsunori Yagiura, Takao Ono, Tomio Hirata, Uri Zwick

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

2006

A Systolic Algorithm for Euclidean Distance Transform.

Masafumi Miyazawa, PeiFeng Zeng, Naoyuki Iso, Tomio Hirata

IEEE Trans. Pattern Anal. Mach. Intell., 2006

Inapproximability of the Edge-Contraction Problem.

Hideaki Otsuki, Tomio Hirata

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006

Refined Computations for Points of the Form 2^<i>k</i><i>P</i> Based on Montgomery Trick.

Daisuke Adachi, Tomio Hirata

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006

2005

Approximation Algorithms for the Weighted Independent Set Problem.

Akihisa Kako, Takao Ono, Tomio Hirata, Magnús M. Halldórsson

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

2003

Finding shortest safari routes in simple polygons.

Xuehou Tan, Tomio Hirata

Inf. Process. Lett., 2003

On Approximation Algorithms for Coloring <i>k</i>-Colorable Graphs.

Xuzhen Xie, Takao Ono, Tomio Hirata

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003

2002

Distance Map Based Enhancementfor Interpolated Images.

PeiFeng Zeng, Tomio Hirata

Proceedings of the Geometry, 2002

1999

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

Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki

Int. J. Comput. Geom. Appl., 1999

1997

A Theoretical Framework of Hybrid Approaches to MAX SAT.

Takao Asano, Kuniaki Hori, Takao Ono, Tomio Hirata

Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

Efficient routability checking for global wires in planar layouts.

Naoyuki Iso, Yasushi Kawaguchi, Tomio Hirata

Proceedings of the ASP-DAC '97 Asia and South Pacific Design Automation Conference, 1997

1996

An efficient algorithm for the euclidean distance transformation.

Toshihiro Kato, Tomio Hirata, Toyofumi Saito, Kenji Kise

Syst. Comput. Jpn., 1996

Approximation Algorithms for the Maximum Satisfiability Problem.

Takao Asano, Takao Ono, Tomio Hirata

Nord. J. Comput., 1996

A Unified Linear-Time Algorithm for Computing Distance Maps.

Tomio Hirata

Inf. Process. Lett., 1996

1995

An Approximation Algorithm for MAX 3-SAT.

Takao Ono, Tomio Hirata, Takao Asano

Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

1994

Complexity of Projected Images of Convex Subdivisions.

Tomio Hirata, Jirí Matousek, Xuehou Tan, Takeshi Tokuyama

Comput. Geom., 1994

Shortest Safari Routes in Simple Polygon.

Xuehou Tan, Tomio Hirata

Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

1993

A parallel algorithm for tree pattern matching.

Koji Tarora, Tomio Hirata, Yasuyoshi Inagaki

Syst. Comput. Jpn., 1993

An incremental algorithm for constructing shortest watchman routes.

Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki

Int. J. Comput. Geom. Appl., 1993

Constructing Shortest Watchman Routes by Divide-and-Conquer.

Xuehou Tan, Tomio Hirata

Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

1991

The Intersection Searching Problem for c-Oriented Polygons.

Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki

Inf. Process. Lett., 1991

1990

Spatial Point Location and Its Applications.

Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki

Proceedings of the Algorithms, 1990

1988

Computational complexity of the file allocation problem in distributed database systems.

Hiroshi Yamasaki, Tomio Hirata, Masaharu Imai, Toshihide Ibaraki

Syst. Comput. Jpn., 1988

Reconfiguration of a fault-tolerant rectangular systolic array.

Yoshinao Suzuki, Tomio Hirata, Masaharu Imai, Masafumi Yamashita, Toshihide Ibaraki

Syst. Comput. Jpn., 1988

1986

Lower bounds on time complexity for some subgraph detection problems.

Masanari Arai, Masafumi Yamashita, Tomio Hirata, Toshihide Ibaraki, Namio Honda

Syst. Comput. Jpn., 1986

1984

A sufficient condition for a graph to be weakly <i>k</i>-linked.

Tomio Hirata, Kiyohito Kubota, Osami Saito

J. Comb. Theory, Ser. B, 1984

1983

Edge-Contraction Problems.

Takao Asano, Tomio Hirata

J. Comput. Syst. Sci., 1983

1982

Edge-Deletion and Edge-Contraction Problems

Takao Asano, Tomio Hirata

Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982