Hiro Ito

	2012
48		Hiro Ito, Stefan Langerman, Yuichi Yoshida: Algorithms and Complexity of Generalized River Crossing Problems. FUN 2012: 235-244
47		Hiro Ito, Susumu Kiyoshima, Yuichi Yoshida: Constant-Time Approximation Algorithms for the Knapsack Problem. TAMC 2012: 131-142
46		Yuichi Yoshida, Hiro Ito: Property Testing on k-Vertex-Connectivity of Graphs. Algorithmica 62(3-4): 701-712 (2012)
	2011
45		Jean Cardinal, Hiro Ito, Matias Korman, Stefan Langerman: Helly Numbers of Polyominoes. CCCG 2011
44		Takuya Umesato, Toshiki Saitoh, Ryuhei Uehara, Hiro Ito: Complexity of the Stamp Folding Problem. COCOA 2011: 311-321
43		Wolfgang W. Bein, Naoki Hatta, Nelson Hernandez-Cons, Hiro Ito, Shoji Kasahara, Jun Kawahara: An Online Algorithm Optimally Self-tuning to Congestion for Power Management Problems. WAOA 2011: 35-48
42		Hiro Ito, Shin-ichi Tanigawa, Yuichi Yoshida: Constant-Time Algorithms for Sparsity Matroids CoRR abs/1103.2581: (2011)
41		Hiro Ito: Preface. Graphs and Combinatorics 27(3): 305-306 (2011)
40		Jin Akiyama, Hiro Ito, Midori Kobayashi, Gisaku Nakamura: Arrangements of n Points whose Incident-Line-Numbers are at most n/2. Graphs and Combinatorics 27(3): 321-326 (2011)
	2010
39		Yuichi Yoshida, Hiro Ito: Testing Outerplanarity of Bounded Degree Graphs. APPROX-RANDOM 2010: 642-655
38		Erik D. Demaine, Martin L. Demaine, Andrea Hawksley, Hiro Ito, Po-Ru Loh, Shelly Manber, Omari Stephens: Making Polygons by Simple Folds and One Straight Cut. CGGA 2010: 27-43
37		Yuichi Yoshida, Hiro Ito: Query-Number Preserving Reductions and Linear Lower Bounds for Testing. IEICE Transactions 93-D(2): 233-240 (2010)
	2009
36		Yuichi Yoshida, Masaki Yamamoto, Hiro Ito: An improved constant-time approximation algorithm for maximum~matchings. STOC 2009: 225-234
35		Hiro Ito, Kazuo Iwama: Enumeration of isolated cliques and pseudo-cliques. ACM Transactions on Algorithms 5(4): (2009)
34		Hiro Ito, Mike Paterson, Kenya Sugihara: The Multi-Commodity Source Location Problems and the Price of Greed. J. Graph Algorithms Appl. 13(1): 55-73 (2009)
	2008
33		Hiro Ito, Mikio Kano, Naoki Katoh, Yushi Uno: Computational Geometry and Graph Theory - International Conference, KyotoCGGT 2007, Kyoto, Japan, June 11-15, 2007. Revised Selected Papers Springer 2008
32		Yuichi Yoshida, Hiro Ito: Property Testing on k-Vertex-Connectivity of Graphs. ICALP (1) 2008: 539-550
31		Hiro Ito, Mike Paterson, Kenya Sugihara: Multi-commodity Source Location Problems and Price of Greed. WALCOM 2008: 169-179
30		Takeyuki Tamura, Hiro Ito: Inferring Pedigree Graphs from Genetic Distances. IEICE Transactions 91-D(2): 162-169 (2008)
	2007
29		Sergey Bereg, Hiro Ito: Transforming Graphs with the Same Degree Sequence. KyotoCGGT 2007: 25-32
	2006
28		Naoki Katoh, Hiro Ito: Preface. Discrete Applied Mathematics 154(16): 2239-2240 (2006)
27		Hiro Ito, Hiroshi Nagamochi: Two equivalent measures on weighted hypergraphs. Discrete Applied Mathematics 154(16): 2330-2334 (2006)
26		Kenya Sugihara, Hiro Ito: Maximum-Cover Source-Location Problem with Objective Edge-Connectivity Three. Electronic Notes in Discrete Mathematics 25: 165-171 (2006)
25		Hiro Ito, Kazuo Iwama, Takeyuki Tamura: Efficient Methods for Determining DNA Probe Orders. IEICE Transactions 89-A(5): 1292-1298 (2006)
24		Kenya Sugihara, Hiro Ito: Maximum-Cover Source-Location Problems. IEICE Transactions 89-A(5): 1370-1377 (2006)
	2005
23		Jin Akiyama, Hiroshi Fukuda, Hiro Ito, Gisaku Nakamura: Infinite Series of Generalized Gosper Space Filling Curves. CJCDGCGT 2005: 1-9
22		Hiro Ito: Impossibility of Transformation of Vertex Labeled Simple Graphs Preserving the Cut-Size Order. CJCDGCGT 2005: 59-69
21		Hiro Ito, Kazuo Iwama, Tsuyoshi Osumi: Linear-Time Enumeration of Isolated Cliques. ESA 2005: 119-130
20		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
19		Akihiro Uejima, Hiro Ito: Subdivision of the Hierarchy of H-colorable Graph Classes by Circulant Graphs. CTW 2004: 232-236
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	[23] [40]
2	Tetsuo Asano	[5]
3	Wolfgang W. Bein	[43]
4	Sergey Bereg (Sergei Bespamyatnikh)	[29]
5	Jean Cardinal	[45]
6	Erik D. Demaine	[38]
7	Martin L. Demaine	[38]
8	Masato Fujita	[12]
9	Hiroshi Fukuda	[23]
10	Naoki Hatta	[43]
11	Andrea Hawksley	[38]
12	Nelson Hernandez-Cons	[43]
13	Yuichiro Itatsu	[7] [9]
14	Motoyasu Ito	[7] [9]
15	Kazuo Iwama	[10] [13] [15] [18] [20] [21] [25] [35]
16	Mikio Kano (M. Kano)	[33]
17	Shoji Kasahara	[43]
18	Naoki Katoh	[28] [33]
19	Jun Kawahara	[43]
20	Souichi Kimura	[5]
21	Susumu Kiyoshima	[47]
22	Midori Kobayashi	[40]
23	Matias Korman	[45]
24	Stefan Langerman	[45] [48]
25	Po-Ru Loh	[38]
26	Shelly Manber	[38]
27	Hiroshi Nagamochi	[11] [12] [27]
28	Kazuhiro Nakai	[9]
29	Gisaku Nakamura	[23] [40]
30	Yasuo Okabe	[10] [13] [15] [20]
31	Tsuyoshi Osumi	[21]
32	Mike Paterson	[31] [34]
33	Toshiki Saitoh	[44]
34	Shigeaki Shimazu	[5]
35	Omari Stephens	[38]
36	Kenya Sugihara	[24] [26] [31] [34]
37	Yosuke Sugiyama	[12]
38	Takeyuki Tamura	[18] [25] [30]
39	Shin-ichi Tanigawa	[42]
40	Hideyuki Uehara	[3] [4] [6] [7] [8] [9]
41	Ryuhei Uehara	[44]
42	Akihiro Uejima	[16] [19]
43	Takuya Umesato	[44]
44	Yushi Uno	[33]
45	Masaki Yamamoto	[36]
46	Mitsuo Yokoyama	[1] [2] [3] [4] [6] [7] [8] [9]
47	Yuichi Yoshida	[32] [36] [37] [39] [42] [46] [47] [48]
48	Takuya Yoshihiro	[10] [13] [15] [20]

Colors in the list of coauthors

Last update Sat Jun 2 20:57:36 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page