Tomio Hirata

2007
24	EE	Xuzhen Xie, Mutsunori Yagiura, Takao Ono, Tomio Hirata, Uri Zwick: New Bounds for the Nearly Equitable Edge Coloring Problem. ISAAC 2007: 280-291
23	EE	Takao Ono, Mutsunori Yagiura, Tomio Hirata: A Vector Assignment Approach for the Graph Coloring Problem. LION 2007: 167-176
2006
22	EE	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)
21	EE	Daisuke Adachi, Tomio Hirata: Refined Computations for Points of the Form 2kP Based on Montgomery Trick. IEICE Transactions 89-A(1): 334-339 (2006)
20	EE	Hideaki Otsuki, Tomio Hirata: Inapproximability of the Edge-Contraction Problem. IEICE Transactions 89-A(5): 1425-1427 (2006)
2005
19	EE	Akihisa Kako, Takao Ono, Tomio Hirata, Magnús M. Halldórsson: Approximation Algorithms for the Weighted Independent Set Problem. WG 2005: 341-350
2003
18	EE	Xuehou Tan, Tomio Hirata: Finding shortest safari routes in simple polygons. Inf. Process. Lett. 87(4): 179-186 (2003)
2002
17	EE	PeiFeng Zeng, Tomio Hirata: Distance Map Based Enhancementfor Interpolated Images. Theoretical Foundations of Computer Vision 2002: 86-100
1999
16		Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki: Corrigendum to ``An Incremental Algorithm for Constructing Shortest Watchman Routes''. Int. J. Comput. Geometry Appl. 9(3): 319-323 (1999)
1997
15		Takao Asano, Kuniaki Hori, Takao Ono, Tomio Hirata: A Theoretical Framework of Hybrid Approaches to MAX SAT. ISAAC 1997: 153-162
1996
14		Takao Asano, Takao Ono, Tomio Hirata: Approximation Algorithms for the Maximum Satisfiability Problem. SWAT 1996: 100-111
13	EE	Tomio Hirata: A Unified Linear-Time Algorithm for Computing Distance Maps. Inf. Process. Lett. 58(3): 129-133 (1996)
12		Takao Asano, Takao Ono, Tomio Hirata: Approximation Algorithms for the Maximum Satisfiability Problem. Nord. J. Comput. 3(4): 388-404 (1996)
1995
11		Takao Ono, Tomio Hirata, Takao Asano: An Approximation Algorithm for MAX 3-SAT. ISAAC 1995: 163-170
1994
10		Xuehou Tan, Tomio Hirata: Shortest Safari Routes in Simple Polygon. ISAAC 1994: 523-531
9		Tomio Hirata, Jirí Matousek, Xuehou Tan, Takeshi Tokuyama: Complexity of Projected Images of Convex Subdivisions. Comput. Geom. 4: 293-308 (1994)
1993
8		Xuehou Tan, Tomio Hirata: Constructing Shortest Watchman Routes by Divide-and-Conquer. ISAAC 1993: 68-77
7		Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki: An incremental algorithm for constructing shortest watchman routes. Int. J. Comput. Geometry Appl. 3(4): 351-365 (1993)
1991
6		Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki: An Incremental Algorithm for Constructing Shortest Watchman Routes. ISA 1991: 163-175
5		Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki: The Intersection Searching Problem for c-Oriented Polygons. Inf. Process. Lett. 37(4): 201-204 (1991)
1990
4		Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki: Spatial Point Location and Its Applications. SIGAL International Symposium on Algorithms 1990: 241-250
1984
3	EE	Tomio Hirata, Kiyohito Kubota, Osami Saito: A sufficient condition for a graph to be weakly k-linked. J. Comb. Theory, Ser. B 36(1): 85-94 (1984)
1983
2		Takao Asano, Tomio Hirata: Edge-Contraction Problems. J. Comput. Syst. Sci. 26(2): 197-208 (1983)
1982
1		Takao Asano, Tomio Hirata: Edge-Deletion and Edge-Contraction Problems STOC 1982: 245-254

Coauthor Index

1	Daisuke Adachi	[21]
2	Takao Asano	[1] [2] [11] [12] [14] [15]
3	Magnús M. Halldórsson	[19]
4	Kuniaki Hori	[15]
5	Yasuyoshi Inagaki	[4] [5] [6] [7] [16]
6	Naoyuki Iso	[22]
7	Akihisa Kako	[19]
8	Kiyohito Kubota	[3]
9	Jirí Matousek	[9]
10	Masafumi Miyazawa	[22]
11	Takao Ono	[11] [12] [14] [15] [19] [23] [24]
12	Hideaki Otsuki	[20]
13	Osami Saito	[3]
14	Xuehou Tan	[4] [5] [6] [7] [8] [9] [10] [16] [18]
15	Takeshi Tokuyama	[9]
16	Xuzhen Xie	[24]
17	Mutsunori Yagiura	[23] [24]
18	PeiFeng Zeng	[17] [22]
19	Uri Zwick	[24]

Colors in the list of coauthors