dblp.uni-trier.dewww.uni-trier.de

Hiro Ito

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
29EEYuichi Yoshida, Hiro Ito: Property Testing on k-Vertex-Connectivity of Graphs. ICALP (1) 2008: 539-550
28EEHiro Ito, Mike Paterson, Kenya Sugihara: Multi-commodity Source Location Problems and Price of Greed. WALCOM 2008: 169-179
27EETakeyuki Tamura, Hiro Ito: Inferring Pedigree Graphs from Genetic Distances. IEICE Transactions 91-D(2): 162-169 (2008)
2006
26EENaoki Katoh, Hiro Ito: Preface. Discrete Applied Mathematics 154(16): 2239-2240 (2006)
25EEHiro Ito, Hiroshi Nagamochi: Two equivalent measures on weighted hypergraphs. Discrete Applied Mathematics 154(16): 2330-2334 (2006)
24EEKenya Sugihara, Hiro Ito: Maximum-Cover Source-Location Problem with Objective Edge-Connectivity Three. Electronic Notes in Discrete Mathematics 25: 165-171 (2006)
23EEHiro Ito, Kazuo Iwama, Takeyuki Tamura: Efficient Methods for Determining DNA Probe Orders. IEICE Transactions 89-A(5): 1292-1298 (2006)
22EEKenya Sugihara, Hiro Ito: Maximum-Cover Source-Location Problems. IEICE Transactions 89-A(5): 1370-1377 (2006)
2005
21EEJin Akiyama, Hiroshi Fukuda, Hiro Ito, Gisaku Nakamura: Infinite Series of Generalized Gosper Space Filling Curves. CJCDGCGT 2005: 1-9
20EEHiro Ito: Impossibility of Transformation of Vertex Labeled Simple Graphs Preserving the Cut-Size Order. CJCDGCGT 2005: 59-69
19EEHiro Ito, Kazuo Iwama, Tsuyoshi Osumi: Linear-Time Enumeration of Isolated Cliques. ESA 2005: 119-130
18EEHiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro: Single backup table schemes for shortest-path routing. Theor. Comput. Sci. 333(3): 347-353 (2005)
2004
17 Hiro Ito, Kazuo Iwama, Takeyuki Tamura: Imperfectness of Data for STS-Based Physical Mapping. IFIP TCS 2004: 279-292
16EEHiro Ito: Three Equivalent Partial Orders on Graphs with Real Edge-Weights Drawn on a Convex Polygon. JCDCG 2004: 123-130
15EEAkihiro 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
14 Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro: Polynomial-Time Computable Backup Tables for Shortest-Path Routing. SIROCCO 2003: 163-177
13 Hiro Ito: Sum of edge lengths of a multigraph drawn on a convex polygon. Comput. Geom. 24(1): 41-47 (2003)
12EEHiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro: Avoiding Routing Loops on the Internet. Theory Comput. Syst. 36(6): 597-609 (2003)
2002
11EEHiro Ito, Hiroshi Nagamochi, Yosuke Sugiyama, Masato Fujita: File Transfer Tree Problems. ISAAC 2002: 441-452
10EEHiro Ito, Hiroshi Nagamochi: Comparing Hypergraphs by Areas of Hyperedges Drawn on a Convex Polygon. JCDCG 2002: 176-181
9 Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro: Avoiding Routing Loops on the Internet. SIROCCO 2002: 197-210
8EEHiro 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)
2000
7EEHiro 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
6EEHiro Ito, Hideyuki Uehara, Mitsuo Yokoyama: Sum of Edge Lengths of a Graph Drawn on a Convex Polygon. JCDCG 2000: 160-166
1998
5EETetsuo 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
2EEHiro Ito, Mitsuo Yokoyama: Linear Time Algorithms for Graph Search and Connectivity Determination on Complement Graphs. Inf. Process. Lett. 66(4): 209-213 (1998)
1EEHiro Ito, Mitsuo Yokoyama: Edge connectivity between nodes and node-subsets. Networks 31(3): 157-163 (1998)

Coauthor Index

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

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)