default search action
Tomio Hirata
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [j23]Hideaki Otsuki, Tomio Hirata:
The Biclique Cover Problem and the Modified Galois Lattice. IEICE Trans. Inf. Syst. 98-D(3): 497-502 (2015) - 2012
- [c15]Masahide Takasuga, Tomio Hirata:
A Necessary and Sufficient Condition for a Bipartite Distance-Hereditary Graph to Be Hamiltonian. TJJCCGG 2012: 143-149 - 2010
- [j22]Hideaki Otsuki, Tomio Hirata:
Inapproximability of the Minimum Biclique Edge Partition Problem. IEICE Trans. Inf. Syst. 93-D(2): 290-292 (2010)
2000 – 2009
- 2009
- [j21]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): 617-626 (2009) - [j20]Ippei Koura, Takao Ono, Tomio Hirata:
A note on the Greedy algorithm for finding independent sets of Ck-free graphs. Inf. Process. Lett. 109(10): 485-489 (2009) - [c14]Isamu Matsuura, Mutsunori Yagiura, Tomio Hirata:
A textile design and the boolean rank problem. IADIS AC (1) 2009: 345-352 - 2008
- [j19]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): 383-399 (2008) - 2007
- [c13]Xuzhen Xie, Mutsunori Yagiura, Takao Ono, Tomio Hirata, Uri Zwick:
New Bounds for the Nearly Equitable Edge Coloring Problem. ISAAC 2007: 280-291 - [c12]Takao Ono, Mutsunori Yagiura, Tomio Hirata:
A Vector Assignment Approach for the Graph Coloring Problem. LION 2007: 167-176 - 2006
- [j18]Daisuke Adachi, Tomio Hirata:
Refined Computations for Points of the Form 2kP Based on Montgomery Trick. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(1): 334-339 (2006) - [j17]Hideaki Otsuki, Tomio Hirata:
Inapproximability of the Edge-Contraction Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(5): 1425-1427 (2006) - [j16]Masafumi Miyazawa, PeiFeng Zeng, Naoyuki Iso, Tomio Hirata:
A Systolic Algorithm for Euclidean Distance Transform. IEEE Trans. Pattern Anal. Mach. Intell. 28(7): 1127-1134 (2006) - 2005
- [c11]Akihisa Kako, Takao Ono, Tomio Hirata, Magnús M. Halldórsson
Approximation Algorithms for the Weighted Independent Set Problem. WG 2005: 341-350 - 2003
- [j15]Xuzhen Xie, Takao Ono, Tomio Hirata:
On Approximation Algorithms for Coloring k-Colorable Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(5): 1046-1051 (2003) - [j14]Xuehou Tan, Tomio Hirata:
Finding shortest safari routes in simple polygons. Inf. Process. Lett. 87(4): 179-186 (2003) - 2002
- [c10]PeiFeng Zeng, Tomio Hirata:
Distance Map Based Enhancementfor Interpolated Images. Theoretical Foundations of Computer Vision 2002: 86-100
1990 – 1999
- 1999
- [j13]Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki:
Corrigendum to "An Incremental Algorithm for Constructing Shortest Watchman Routes". Int. J. Comput. Geom. Appl. 9(3): 319-323 (1999) - 1997
- [c9]Naoyuki Iso, Yasushi Kawaguchi, Tomio Hirata:
Efficient routability checking for global wires in planar layouts. ASP-DAC 1997: 641-644 - [c8]Takao Asano, Kuniaki Hori, Takao Ono, Tomio Hirata:
A Theoretical Framework of Hybrid Approaches to MAX SAT. ISAAC 1997: 153-162 - 1996
- [j12]Tomio Hirata:
A Unified Linear-Time Algorithm for Computing Distance Maps. Inf. Process. Lett. 58(3): 129-133 (1996) - [j11]Takao Asano, Takao Ono, Tomio Hirata:
Approximation Algorithms for the Maximum Satisfiability Problem. Nord. J. Comput. 3(4): 388-404 (1996) - [j10]Toshihiro Kato, Tomio Hirata, Toyofumi Saito, Kenji Kise:
An efficient algorithm for the euclidean distance transformation. Syst. Comput. Jpn. 27(7): 18-24 (1996) - [c7]Takao Asano, Takao Ono, Tomio Hirata:
Approximation Algorithms for the Maximum Satisfiability Problem. SWAT 1996: 100-111 - 1995
- [c6]Takao Ono, Tomio Hirata, Takao Asano:
An Approximation Algorithm for MAX 3-SAT. ISAAC 1995: 163-170 - 1994
- [j9]Tomio Hirata, Jirí Matousek, Xuehou Tan, Takeshi Tokuyama
Complexity of Projected Images of Convex Subdivisions. Comput. Geom. 4: 293-308 (1994) - [c5]Xuehou Tan, Tomio Hirata:
Shortest Safari Routes in Simple Polygon. ISAAC 1994: 523-531 - 1993
- [j8]Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki:
An incremental algorithm for constructing shortest watchman routes. Int. J. Comput. Geom. Appl. 3(4): 351-365 (1993) - [j7]Koji Tarora, Tomio Hirata, Yasuyoshi Inagaki:
A parallel algorithm for tree pattern matching. Syst. Comput. Jpn. 24(5): 30-39 (1993) - [c4]Xuehou Tan, Tomio Hirata:
Constructing Shortest Watchman Routes by Divide-and-Conquer. ISAAC 1993: 68-77 - 1991
- [j6]Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki:
The Intersection Searching Problem for c-Oriented Polygons. Inf. Process. Lett. 37(4): 201-204 (1991) - [c3]Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki:
An Incremental Algorithm for Constructing Shortest Watchman Routes. ISA 1991: 163-175 - 1990
- [c2]Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki:
Spatial Point Location and Its Applications. SIGAL International Symposium on Algorithms 1990: 241-250
1980 – 1989
- 1988
- [j5]Yoshinao Suzuki, Tomio Hirata, Masaharu Imai, Masafumi Yamashita, Toshihide Ibaraki:
Reconfiguration of a fault-tolerant rectangular systolic array. Syst. Comput. Jpn. 19(1): 79-89 (1988) - [j4]Hiroshi Yamasaki, Tomio Hirata, Masaharu Imai, Toshihide Ibaraki:
Computational complexity of the file allocation problem in distributed database systems. Syst. Comput. Jpn. 19(3): 53-63 (1988) - 1986
- [j3]Masanari Arai, Masafumi Yamashita, Tomio Hirata, Toshihide Ibaraki, Namio Honda:
Lower bounds on time complexity for some subgraph detection problems. Syst. Comput. Jpn. 17(6): 95-102 (1986) - 1984
- [j2]Tomio Hirata, Kiyohito Kubota, Osami Saito:
A sufficient condition for a graph to be weakly k-linked. J. Comb. Theory B 36(1): 85-94 (1984) - 1983
- [j1]Takao Asano, Tomio Hirata:
Edge-Contraction Problems. J. Comput. Syst. Sci. 26(2): 197-208 (1983) - 1982
- [c1]Takao Asano, Tomio Hirata:
Edge-Deletion and Edge-Contraction Problems. STOC 1982: 245-254
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: