Tomio Hirata

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