| 2008 |
|---|
| 26 | EE | Hiro Ito,
Mike Paterson,
Kenya Sugihara:
Multi-commodity Source Location Problems and Price of Greed.
WALCOM 2008: 169-179 |
| 25 | EE | Takeyuki Tamura,
Hiro Ito:
Inferring Pedigree Graphs from Genetic Distances.
IEICE Transactions 91-D(2): 162-169 (2008) |
| 2006 |
|---|
| 24 | EE | Naoki Katoh,
Hiro Ito:
Preface.
Discrete Applied Mathematics 154(16): 2239-2240 (2006) |
| 23 | EE | Hiro Ito,
Hiroshi Nagamochi:
Two equivalent measures on weighted hypergraphs.
Discrete Applied Mathematics 154(16): 2330-2334 (2006) |
| 22 | EE | Hiro Ito,
Kazuo Iwama,
Takeyuki Tamura:
Efficient Methods for Determining DNA Probe Orders.
IEICE Transactions 89-A(5): 1292-1298 (2006) |
| 21 | EE | Kenya Sugihara,
Hiro Ito:
Maximum-Cover Source-Location Problems.
IEICE Transactions 89-A(5): 1370-1377 (2006) |
| 2005 |
|---|
| 20 | EE | Jin Akiyama,
Hiroshi Fukuda,
Hiro Ito,
Gisaku Nakamura:
Infinite Series of Generalized Gosper Space Filling Curves.
CJCDGCGT 2005: 1-9 |
| 19 | EE | Hiro Ito:
Impossibility of Transformation of Vertex Labeled Simple Graphs Preserving the Cut-Size Order.
CJCDGCGT 2005: 59-69 |
| 18 | EE | Hiro Ito,
Kazuo Iwama,
Tsuyoshi Osumi:
Linear-Time Enumeration of Isolated Cliques.
ESA 2005: 119-130 |
| 17 | EE | 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 |
|---|
| 16 | | Hiro Ito,
Kazuo Iwama,
Takeyuki Tamura:
Imperfectness of Data for STS-Based Physical Mapping.
IFIP TCS 2004: 279-292 |
| 15 | EE | Hiro Ito:
Three Equivalent Partial Orders on Graphs with Real Edge-Weights Drawn on a Convex Polygon.
JCDCG 2004: 123-130 |
| 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) |
| 12 | EE | Hiro Ito,
Kazuo Iwama,
Yasuo Okabe,
Takuya Yoshihiro:
Avoiding Routing Loops on the Internet.
Theory Comput. Syst. 36(6): 597-609 (2003) |
| 2002 |
|---|
| 11 | EE | Hiro Ito,
Hiroshi Nagamochi,
Yosuke Sugiyama,
Masato Fujita:
File Transfer Tree Problems.
ISAAC 2002: 441-452 |
| 10 | EE | Hiro 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 |
| 8 | EE | 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) |
| 2000 |
|---|
| 7 | EE | 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 | EE | Hiro Ito,
Hideyuki Uehara,
Mitsuo Yokoyama:
Sum of Edge Lengths of a Graph Drawn on a Convex Polygon.
JCDCG 2000: 160-166 |
| 1998 |
|---|
| 5 | EE | 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 | EE | 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 | EE | Hiro Ito,
Mitsuo Yokoyama:
Edge connectivity between nodes and node-subsets.
Networks 31(3): 157-163 (1998) |
