Hiro Ito

Yuichi Yoshida, Hiro Ito: Property Testing on k-Vertex-Connectivity of Graphs. Algorithmica 62(3-4): 701-712 (2012)

Yuichi Yoshida, Masaki Yamamoto, Hiro Ito: Improved Constant-Time Approximation Algorithms for Maximum Matchings and Other Optimization Problems. SIAM J. Comput. 41(4): 1074-1093 (2012)

Hiro Ito, Stefan Langerman, Yuichi Yoshida: Algorithms and Complexity of Generalized River Crossing Problems. FUN 2012: 235-244

Mitsuru Kusumoto, Yuichi Yoshida, Hiro Ito: Constant-Time Approximation Algorithms for the Optimum Branching Problem on Sparse Graphs. ICNC 2012: 407-413

Hiro Ito, Shin-ichi Tanigawa, Yuichi Yoshida: Constant-Time Algorithms for Sparsity Matroids. ICALP (1) 2012: 498-509

Hiro Ito, Susumu Kiyoshima, Yuichi Yoshida: Constant-Time Approximation Algorithms for the Knapsack Problem. TAMC 2012: 131-142

Hiro Ito: Preface. Graphs and Combinatorics 27(3): 305-306 (2011)

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)

Jean Cardinal, Hiro Ito, Matias Korman, Stefan Langerman: Helly Numbers of Polyominoes. CCCG 2011

Takuya Umesato, Toshiki Saitoh, Ryuhei Uehara, Hiro Ito: Complexity of the Stamp Folding Problem. COCOA 2011: 311-321

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

Hiro Ito, Shin-ichi Tanigawa, Yuichi Yoshida: Constant-Time Algorithms for Sparsity Matroids. CoRR abs/1103.2581 (2011)

Yuichi Yoshida, Hiro Ito: Query-Number Preserving Reductions and Linear Lower Bounds for Testing. IEICE Transactions 93-D(2): 233-240 (2010)

Yuichi Yoshida, Hiro Ito: Testing Outerplanarity of Bounded Degree Graphs. APPROX-RANDOM 2010: 642-655

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

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)

Kenya Sugihara, Hiro Ito: Maximum-cover source location problems with objective edge-connectivity three. Math. Meth. of OR 70(1): 183-193 (2009)

Hiro Ito, Kazuo Iwama: Enumeration of isolated cliques and pseudo-cliques. ACM Transactions on Algorithms 5(4) (2009)

Yuichi Yoshida, Masaki Yamamoto, Hiro Ito: An improved constant-time approximation algorithm for maximum~matchings. STOC 2009: 225-234

Takeyuki Tamura, Hiro Ito: Inferring Pedigree Graphs from Genetic Distances. IEICE Transactions 91-D(2): 162-169 (2008)

Yuichi Yoshida, Hiro Ito: Property Testing on k-Vertex-Connectivity of Graphs. ICALP (1) 2008: 539-550

Hiro Ito, Mike Paterson, Kenya Sugihara: Multi-commodity Source Location Problems and Price of Greed. WALCOM 2008: 169-179

Hiro Ito, Mikio Kano, Naoki Katoh, Yushi Uno (Eds.): Computational Geometry and Graph Theory - International Conference, KyotoCGGT 2007, Kyoto, Japan, June 11-15, 2007. Revised Selected Papers. Lecture Notes in Computer Science 4535, Springer 2008, isbn 978-3-540-89549-7

Sergey Bereg, Hiro Ito: Transforming Graphs with the Same Degree Sequence. KyotoCGGT 2007: 25-32

Naoki Katoh, Hiro Ito: Preface. Discrete Applied Mathematics 154(16): 2239-2240 (2006)

Hiro Ito, Hiroshi Nagamochi: Two equivalent measures on weighted hypergraphs. Discrete Applied Mathematics 154(16): 2330-2334 (2006)

Kenya Sugihara, Hiro Ito: Maximum-Cover Source-Location Problem with Objective Edge-Connectivity Three. Electronic Notes in Discrete Mathematics 25: 165-171 (2006)

Hiro Ito, Kazuo Iwama, Takeyuki Tamura: Efficient Methods for Determining DNA Probe Orders. IEICE Transactions 89-A(5): 1292-1298 (2006)

Kenya Sugihara, Hiro Ito: Maximum-Cover Source-Location Problems. IEICE Transactions 89-A(5): 1370-1377 (2006)

Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro: Single backup table schemes for shortest-path routing. Theor. Comput. Sci. 333(3): 347-353 (2005)

Jin Akiyama, Hiroshi Fukuda, Hiro Ito, Gisaku Nakamura: Infinite Series of Generalized Gosper Space Filling Curves. CJCDGCGT 2005: 1-9

Hiro Ito: Impossibility of Transformation of Vertex Labeled Simple Graphs Preserving the Cut-Size Order. CJCDGCGT 2005: 59-69

Hiro Ito, Kazuo Iwama, Tsuyoshi Osumi: Linear-Time Enumeration of Isolated Cliques. ESA 2005: 119-130

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)

Akihiro Uejima, Hiro Ito: Subdivision of the Hierarchy of H-colorable Graph Classes by Circulant Graphs. CTW 2004: 232-236

Hiro Ito, Kazuo Iwama, Takeyuki Tamura: Imperfectness of Data for STS-Based Physical Mapping. IFIP TCS 2004: 279-292

Hiro Ito: Three Equivalent Partial Orders on Graphs with Real Edge-Weights Drawn on a Convex Polygon. JCDCG 2004: 123-130

Hiro Ito: Sum of edge lengths of a multigraph drawn on a convex polygon. Comput. Geom. 24(1): 41-47 (2003)

Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro: Avoiding Routing Loops on the Internet. Theory Comput. Syst. 36(6): 597-609 (2003)

Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro: Polynomial-Time Computable Backup Tables for Shortest-Path Routing. SIROCCO 2003: 163-177

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)

Hiro Ito, Hiroshi Nagamochi, Yosuke Sugiyama, Masato Fujita: File Transfer Tree Problems. ISAAC 2002: 441-452

Hiro Ito, Hiroshi Nagamochi: Comparing Hypergraphs by Areas of Hyperedges Drawn on a Convex Polygon. JCDCG 2002: 176-181

Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro: Avoiding Routing Loops on the Internet. SIROCCO 2002: 197-210

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)

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

Hiro Ito, Hideyuki Uehara, Mitsuo Yokoyama: Sum of Edge Lengths of a Graph Drawn on a Convex Polygon. JCDCG 2000: 160-166

Hiro Ito, Mitsuo Yokoyama: Linear Time Algorithms for Graph Search and Connectivity Determination on Complement Graphs. Inf. Process. Lett. 66(4): 209-213 (1998)

Hiro Ito, Mitsuo Yokoyama: Edge connectivity between nodes and node-subsets. Networks 31(3): 157-163 (1998)

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

Hiro Ito, Hideyuki Uehara, Mitsuo Yokoyama: 2-Dimension Ham Sandwich Theorem for Partitioning into Three Convex Pieces. JCDCG 1998: 129-157

Hiro Ito, Hideyuki Uehara, Mitsuo Yokoyama: NP-Completeness of Stage Illumination Problems. JCDCG 1998: 158-165