Hiro Ito

	2009
31		Yuichi Yoshida, Masaki Yamamoto, Hiro Ito: An improved constant-time approximation algorithm for maximum~matchings. STOC 2009: 225-234
	2008
30		Yuichi Yoshida, Hiro Ito: Property Testing on k-Vertex-Connectivity of Graphs. ICALP (1) 2008: 539-550
29		Hiro Ito, Mike Paterson, Kenya Sugihara: Multi-commodity Source Location Problems and Price of Greed. WALCOM 2008: 169-179
28		Takeyuki Tamura, Hiro Ito: Inferring Pedigree Graphs from Genetic Distances. IEICE Transactions 91-D(2): 162-169 (2008)
	2006
27		Naoki Katoh, Hiro Ito: Preface. Discrete Applied Mathematics 154(16): 2239-2240 (2006)
26		Hiro Ito, Hiroshi Nagamochi: Two equivalent measures on weighted hypergraphs. Discrete Applied Mathematics 154(16): 2330-2334 (2006)
25		Kenya Sugihara, Hiro Ito: Maximum-Cover Source-Location Problem with Objective Edge-Connectivity Three. Electronic Notes in Discrete Mathematics 25: 165-171 (2006)
24		Hiro Ito, Kazuo Iwama, Takeyuki Tamura: Efficient Methods for Determining DNA Probe Orders. IEICE Transactions 89-A(5): 1292-1298 (2006)
23		Kenya Sugihara, Hiro Ito: Maximum-Cover Source-Location Problems. IEICE Transactions 89-A(5): 1370-1377 (2006)
	2005
22		Jin Akiyama, Hiroshi Fukuda, Hiro Ito, Gisaku Nakamura: Infinite Series of Generalized Gosper Space Filling Curves. CJCDGCGT 2005: 1-9
21		Hiro Ito: Impossibility of Transformation of Vertex Labeled Simple Graphs Preserving the Cut-Size Order. CJCDGCGT 2005: 59-69
20		Hiro Ito, Kazuo Iwama, Tsuyoshi Osumi: Linear-Time Enumeration of Isolated Cliques. ESA 2005: 119-130
19		Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro: Single backup table schemes for shortest-path routing. Theor. Comput. Sci. 333(3): 347-353 (2005)
	2004
18		Hiro Ito, Kazuo Iwama, Takeyuki Tamura: Imperfectness of Data for STS-Based Physical Mapping. IFIP TCS 2004: 279-292
17		Hiro Ito: Three Equivalent Partial Orders on Graphs with Real Edge-Weights Drawn on a Convex Polygon. JCDCG 2004: 123-130
16		Akihiro Uejima, Hiro Ito: Subdivision of the hierarchy of H-colorable graph classes by circulant graphs. Electronic Notes in Discrete Mathematics 17: 269-274 (2004)
	2003
15		Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro: Polynomial-Time Computable Backup Tables for Shortest-Path Routing. SIROCCO 2003: 163-177
14		Hiro Ito: Sum of edge lengths of a multigraph drawn on a convex polygon. Comput. Geom. 24(1): 41-47 (2003)
13		Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro: Avoiding Routing Loops on the Internet. Theory Comput. Syst. 36(6): 597-609 (2003)
	2002
12		Hiro Ito, Hiroshi Nagamochi, Yosuke Sugiyama, Masato Fujita: File Transfer Tree Problems. ISAAC 2002: 441-452
11		Hiro Ito, Hiroshi Nagamochi: Comparing Hypergraphs by Areas of Hyperedges Drawn on a Convex Polygon. JCDCG 2002: 176-181
10		Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro: Avoiding Routing Loops on the Internet. SIROCCO 2002: 197-210
9		Hiro Ito, Motoyasu Ito, Yuichiro Itatsu, Kazuhiro Nakai, Hideyuki Uehara, Mitsuo Yokoyama: Source location problems considering vertex-connectivity and edge-connectivity simultaneously. Networks 40(2): 63-70 (2002)
	2001
8		Hiro Ito, Hideyuki Uehara, Mitsuo Yokoyama: Lengths of tours and permutations on a vertex set of a convex polygon. Discrete Applied Mathematics 115(1-3): 63-71 (2001)
	2000
7		Hiro Ito, Yuichiro Itatsu, Hideyuki Uehara, Mitsuo Yokoyama, Motoyasu Ito: Location Problems Based on Node-Connectivity and Edge-Connectivity between Nodes and Node-Subsets. ISAAC 2000: 338-349
6		Hiro Ito, Hideyuki Uehara, Mitsuo Yokoyama: Sum of Edge Lengths of a Graph Drawn on a Convex Polygon. JCDCG 2000: 160-166
	1998
5		Tetsuo Asano, Hiro Ito, Souichi Kimura, Shigeaki Shimazu: Repairing Flaws in a Picture Based on a Geometric Representation of a Digital Image. ISAAC 1998: 149-158
4		Hiro Ito, Hideyuki Uehara, Mitsuo Yokoyama: 2-Dimension Ham Sandwich Theorem for Partitioning into Three Convex Pieces. JCDCG 1998: 129-157
3		Hiro Ito, Hideyuki Uehara, Mitsuo Yokoyama: NP-Completeness of Stage Illumination Problems. JCDCG 1998: 158-165
2		Hiro Ito, Mitsuo Yokoyama: Linear Time Algorithms for Graph Search and Connectivity Determination on Complement Graphs. Inf. Process. Lett. 66(4): 209-213 (1998)
1		Hiro Ito, Mitsuo Yokoyama: Edge connectivity between nodes and node-subsets. Networks 31(3): 157-163 (1998)

Coauthor Index

1	Jin Akiyama	[22]
2	Tetsuo Asano	[5]
3	Masato Fujita	[12]
4	Hiroshi Fukuda	[22]
5	Yuichiro Itatsu	[7] [9]
6	Motoyasu Ito	[7] [9]
7	Kazuo Iwama	[10] [13] [15] [18] [19] [20] [24]
8	Naoki Katoh	[27]
9	Souichi Kimura	[5]
10	Hiroshi Nagamochi	[11] [12] [26]
11	Kazuhiro Nakai	[9]
12	Gisaku Nakamura	[22]
13	Yasuo Okabe	[10] [13] [15] [19]
14	Tsuyoshi Osumi	[20]
15	Mike Paterson	[29]
16	Shigeaki Shimazu	[5]
17	Kenya Sugihara	[23] [25] [29]
18	Yosuke Sugiyama	[12]
19	Takeyuki Tamura	[18] [24] [28]
20	Hideyuki Uehara	[3] [4] [6] [7] [8] [9]
21	Akihiro Uejima	[16]
22	Masaki Yamamoto	[31]
23	Mitsuo Yokoyama	[1] [2] [3] [4] [6] [7] [8] [9]
24	Yuichi Yoshida	[30] [31]
25	Takuya Yoshihiro	[10] [13] [15] [19]

Colors in the list of coauthors