Tomio Hirata - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 38 from 38

2015

The Biclique Cover Problem and the Modified Galois LatticeHideaki Otsuki, Tomio Hirata. ieicet, 98-D(3):497-502, 2015. [doi]

2012

A Necessary and Sufficient Condition for a Bipartite Distance-Hereditary Graph to Be HamiltonianMasahide Takasuga, Tomio Hirata. tjjccgg 2013: 143-149 [doi]

2010

Inapproximability of the Minimum Biclique Edge Partition ProblemHideaki Otsuki, Tomio Hirata. ieicet, 93-D(2):290-292, 2010. [doi]

2009

Approximation algorithms for the weighted independent set problem in sparse graphsAkihisa Kako, Takao Ono, Tomio Hirata, MagnÃºs M. HalldÃ³rsson. DAM, 157(4):617-626, 2009. [doi]

A note on the Greedy algorithm for finding independent sets of C::k::-free graphsIppei Koura, Takao Ono, Tomio Hirata. ipl, 109(10):485-489, 2009. [doi]

A textile design and the boolean rank problemIsamu Matsuura, Mutsunori Yagiura, Tomio Hirata. iadis 2009: 345-352

2008

An Efficient Algorithm for the Nearly Equitable Edge Coloring ProblemXuzhen Xie, Mutsunori Yagiura, Takao Ono, Tomio Hirata, Uri Zwick. jgaa, 12(4):383-399, 2008. [doi]

2007

A Vector Assignment Approach for the Graph Coloring ProblemTakao Ono, Mutsunori Yagiura, Tomio Hirata. lion 2008: 167-176 [doi]

New Bounds for the Nearly Equitable Edge Coloring ProblemXuzhen Xie, Mutsunori Yagiura, Takao Ono, Tomio Hirata, Uri Zwick. isaac 2007: 280-291 [doi]

2006

Refined Computations for Points of the Form 2:::::::k:::::::::::P:::: Based on Montgomery TrickDaisuke Adachi, Tomio Hirata. ieicet, 89-A(1):334-339, 2006. [doi]

A Systolic Algorithm for Euclidean Distance TransformMasafumi Miyazawa, PeiFeng Zeng, Naoyuki Iso, Tomio Hirata. pami, 28(7):1127-1134, 2006. [doi]

Inapproximability of the Edge-Contraction ProblemHideaki Otsuki, Tomio Hirata. ieicet, 89-A(5):1425-1427, 2006. [doi]

2005

Approximation Algorithms for the Weighted Independent Set ProblemAkihisa Kako, Takao Ono, Tomio Hirata, Magnús M. Halldórsson. criwg 2005: 341-350 [doi]

2003

Finding shortest safari routes in simple polygonsXuehou Tan, Tomio Hirata. ipl, 87(4):179-186, 2003. [doi]

k-Colorable GraphsXuzhen Xie, Takao Ono, Tomio Hirata. ieiceta, 86-A(5):1046-1051, 2003. [doi]

2002

Distance Map Based Enhancementfor Interpolated ImagesPeiFeng Zeng, Tomio Hirata. tfcv 2003: 86-100 [doi]

1999

Corrigendum to An Incremental Algorithm for Constructing Shortest Watchman Routes Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki. ijcga, 9(3):319-323, 1999.

1997

A Theoretical Framework of Hybrid Approaches to MAX SATTakao Asano, Kuniaki Hori, Takao Ono, Tomio Hirata. isaac 1997: 153-162

Efficient routability checking for global wires in planar layoutsNaoyuki Iso, Yasushi Kawaguchi, Tomio Hirata. aspdac 1997: 641-644 [doi]

1996

1995

An Approximation Algorithm for MAX 3-SATTakao Ono, Tomio Hirata, Takao Asano. isaac 1995: 163-170

1994

Complexity of Projected Images of Convex SubdivisionsTomio Hirata, Jirí Matousek, Xuehou Tan, Takeshi Tokuyama. comgeo, 4:293-308, 1994.

Shortest Safari Routes in Simple PolygonXuehou Tan, Tomio Hirata. isaac 1994: 523-531

1993

Constructing Shortest Watchman Routes by Divide-and-ConquerXuehou Tan, Tomio Hirata. isaac 1993: 68-77

An incremental algorithm for constructing shortest watchman routesXuehou Tan, Tomio Hirata, Yasuyoshi Inagaki. ijcga, 3(4):351-365, 1993.

A parallel algorithm for tree pattern matchingKoji Tarora, Tomio Hirata, Yasuyoshi Inagaki. scjapan, 24(5):30-39, 1993. [doi]

1991

An Incremental Algorithm for Constructing Shortest Watchman RoutesXuehou Tan, Tomio Hirata, Yasuyoshi Inagaki. sersc-isa 1991: 163-175

The Intersection Searching Problem for c-Oriented PolygonsXuehou Tan, Tomio Hirata, Yasuyoshi Inagaki. ipl, 37(4):201-204, 1991.

1990

Spatial Point Location and Its ApplicationsXuehou Tan, Tomio Hirata, Yasuyoshi Inagaki. sigal 1990: 241-250

1988

Reconfiguration of a fault-tolerant rectangular systolic arrayYoshinao Suzuki, Tomio Hirata, Masaharu Imai, Masafumi Yamashita, Toshihide Ibaraki. scjapan, 19(1):79-89, 1988. [doi]

Computational complexity of the file allocation problem in distributed database systemsHiroshi Yamasaki, Tomio Hirata, Masaharu Imai, Toshihide Ibaraki. scjapan, 19(3):53-63, 1988. [doi]

1986

Lower bounds on time complexity for some subgraph detection problemsMasanari Arai, Masafumi Yamashita, Tomio Hirata, Toshihide Ibaraki, Namio Honda. scjapan, 17(6):95-102, 1986. [doi]

1984

A sufficient condition for a graph to be weakly ::::k::::-linkedTomio Hirata, Kiyohito Kubota, Osami Saito. JCT, 36(1):85-94, 1984. [doi]

1983

Edge-Contraction ProblemsTakao Asano, Tomio Hirata. jcss, 26(2):197-208, 1983.

1982

Edge-Deletion and Edge-Contraction ProblemsTakao Asano, Tomio Hirata. stoc 1982: 245-254

Sign in or sign up to see more results.

runs on WebDSL