Network topology construction method and its support system. - Takashi Satake; Hiro Ito; Akiya Inoue (CAMAD, 1994)

Repairing Flaws in a Picture Based on a Geometric Representation of a Digital Image. - Tetsuo Asano; Hiro Ito; Souichi Kimura; Shigeaki Shimazu (ISAAC, 1998)

2-Dimension Ham Sandwich Theorem for Partitioning into Three Convex Pieces. - Hiro Ito; Hideyuki Uehara; Mitsuo Yokoyama (JCDCG, 1998)

NP-Completeness of Stage Illumination Problems. - Hiro Ito; Hideyuki Uehara; Mitsuo Yokoyama (JCDCG, 1998)

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

Edge connectivity between nodes and node-subsets. - Hiro Ito; Mitsuo Yokoyama (Networks, 1998)

Location Problems Based on Node-Connectivity and Edge-Connectivity between Nodes and Node-Subsets. - Hiro Ito; Yuichiro Itatsu; Hideyuki Uehara; Mitsuo Yokoyama; Motoyasu Ito (ISAAC, 2000)

Sum of Edge Lengths of a Graph Drawn on a Convex Polygon. - Hiro Ito; Hideyuki Uehara; Mitsuo Yokoyama (JCDCG, 2000)

Slot assignment scheme for integrated voice and data traffic in reservation-type packet radio networks. - Hideyuki Uehara; Masato Fujihara; Mitsuo Yokoyama; Hiro Ito (PIMRC, 2000)

Lengths of tours and permutations on a vertex set of a convex polygon. - Hiro Ito; Hideyuki Uehara; Mitsuo Yokoyama (Discret. Appl. Math., 2001)

Minimum cost source location problem with vertex-connectivity requirements in digraphs. - Hiroshi Nagamochi; Toshimasa Ishii; Hiro Ito (Inf. Process. Lett., 2001)

File Transfer Tree Problems. - Hiro Ito; Hiroshi Nagamochi; Yosuke Sugiyama; Masato Fujita (ISAAC, 2002)

Comparing Hypergraphs by Areas of Hyperedges Drawn on a Convex Polygon. - Hiro Ito; Hiroshi Nagamochi (JCDCG, 2002)

On H-Coloring Problems with H Expressed by Complements of Cycles, Bipartite Graphs, and Chordal Graphs. - Akihiro Uejima; Hiro Ito (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002)

Source location problems considering vertex-connectivity and edge-connectivity simultaneously. - Hiro Ito; Motoyasu Ito; Yuichiro Itatsu; Kazuhiro Nakai; Hideyuki Uehara; Mitsuo Yokoyama (Networks, 2002)

Polynomial-Time Computable Backup Tables for Shortest-Path Routing. - Hiro Ito; Kazuo Iwama; Yasuo Okabe; Takuya Yoshihiro (SIROCCO, 2003)

Sum of edge lengths of a multigraph drawn on a convex polygon. - Hiro Ito (Comput. Geom., 2003)

Foreword. - Hiro Ito (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003)

Avoiding Routing Loops on the Internet. - Hiro Ito; Kazuo Iwama; Yasuo Okabe; Takuya Yoshihiro (Theory Comput. Syst., 2003)

Source location problem with flow requirements in directed networks. - Hiro Ito; Kazuhisa Makino; Kouji Arata; Shoji Honami; Yuichiro Itatsu; Satoru Fujishige (Optim. Methods Softw., 2003)

Imperfectness of Data for STS-Based Physical Mapping. - Hiro Ito; Kazuo Iwama; Takeyuki Tamura (IFIP TCS, 2004)

Three Equivalent Partial Orders on Graphs with Real Edge-Weights Drawn on a Convex Polygon. - Hiro Ito (JCDCG, 2004)

Subdivision of the hierarchy of H-colorable graph classes by circulant graphs. - Akihiro Uejima; Hiro Ito (Electron. Notes Discret. Math., 2004)

Infinite Series of Generalized Gosper Space Filling Curves. - Jin Akiyama; Hiroshi Fukuda; Hiro Ito; Gisaku Nakamura (CJCDGCGT, 2005)

Impossibility of Transformation of Vertex Labeled Simple Graphs Preserving the Cut-Size Order. - Hiro Ito (CJCDGCGT, 2005)

Linear-Time Enumeration of Isolated Cliques. - Hiro Ito; Kazuo Iwama; Tsuyoshi Osumi (ESA, 2005)

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

Two equivalent measures on weighted hypergraphs. - Hiro Ito; Hiroshi Nagamochi (Discret. Appl. Math., 2006)

Preface. - Naoki Katoh; Hiro Ito (Discret. Appl. Math., 2006)

Maximum-Cover Source-Location Problem with Objective Edge-Connectivity Three. - Kenya Sugihara; Hiro Ito (Electron. Notes Discret. Math., 2006)

Efficient Methods for Determining DNA Probe Orders. - Hiro Ito; Kazuo Iwama; Takeyuki Tamura (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006)

Maximum-Cover Source-Location Problems. - Kenya Sugihara; Hiro Ito (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006)

Transforming Graphs with the Same Degree Sequence. - Sergey Bereg; Hiro Ito (KyotoCGGT, 2007)

Semi-Distance Codes and Steiner Systems. - Hiro Ito; Midori Kobayashi; Gisaku Nakamura (Graphs Comb., 2007)

Winning Ways of Weighted Poset Games. - Hiro Ito; Gisaku Nakamura; Satoshi Takata (Graphs Comb., 2007)

Inferring Pedigree Graphs from Genetic Distances. - Takeyuki Tamura; Hiro Ito (IEICE Trans. Inf. Syst., 2008)

An improved constant-time approximation algorithm for maximum matchings. - Yuichi Yoshida; Masaki Yamamoto 001; Hiro Ito (STOC, 2009)

The Multi-Commodity Source Location Problems and the Price of Greed. - Hiro Ito; Mike Paterson; Kenya Sugihara (J. Graph Algorithms Appl., 2009)

Maximum-cover source location problems with objective edge-connectivity three. - Kenya Sugihara; Hiro Ito (Math. Methods Oper. Res., 2009)

Enumeration of isolated cliques and pseudo-cliques. - Hiro Ito; Kazuo Iwama (ACM Trans. Algorithms, 2009)

Making Polygons by Simple Folds and One Straight Cut. - Erik D. Demaine; Martin L. Demaine; Andrea Hawksley; Hiro Ito; Po-Ru Loh; Shelly Manber; Omari Stephens (CGGA, 2010)

Query-Number Preserving Reductions and Linear Lower Bounds for Testing. - Yuichi Yoshida; Hiro Ito (IEICE Trans. Inf. Syst., 2010)

Testing k-edge-connectivity of digraphs. - Yuichi Yoshida; Hiro Ito (J. Syst. Sci. Complex., 2010)

Complexity of the Stamp Folding Problem. - Takuya Umesato; Toshiki Saitoh; Ryuhei Uehara; Hiro Ito (COCOA, 2011)

An Online Algorithm Optimally Self-tuning to Congestion for Power Management Problems. - Wolfgang W. Bein; Naoki Hatta; Nelson Hernandez-Cons; Hiro Ito; Shoji Kasahara; Jun Kawahara (WAOA, 2011)

Arrangements of n Points whose Incident-Line-Numbers are at most n/2. - Jin Akiyama; Hiro Ito; Midori Kobayashi; Gisaku Nakamura (Graphs Comb., 2011)

Preface. - Hiro Ito (Graphs Comb., 2011)

Algorithms and Complexity of Generalized River Crossing Problems. - Hiro Ito; Stefan Langerman; Yuichi Yoshida (FUN, 2012)

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

Constant-Time Approximation Algorithms for the Knapsack Problem. - Hiro Ito; Susumu Kiyoshima; Yuichi Yoshida (TAMC, 2012)

How to Generalize Janken - Rock-Paper-Scissors-King-Flea. - Hiro Ito (TJJCCGG, 2012)

Property Testing on k-Vertex-Connectivity of Graphs. - Yuichi Yoshida; Hiro Ito (Algorithmica, 2012)

Improved Constant-Time Approximation Algorithms for Maximum Matchings and Other Optimization Problems. - Yuichi Yoshida; Masaki Yamamoto 001; Hiro Ito (SIAM J. Comput., 2012)

Helly Numbers of Polyominoes. - Jean Cardinal; Hiro Ito; Matias Korman; Stefan Langerman (Graphs Comb., 2013)

Constant-Time Approximation Algorithms for the Optimum Branching Problem on Sparse Graphs. - Mitsuru Kusumoto; Yuichi Yoshida; Hiro Ito (Int. J. Netw. Comput., 2013)

On computational complexity of graph inference from counting. - Szilárd Zsolt Fazekas; Hiro Ito; Yasushi Okuno; Shinnosuke Seki 001; Kei Taneishi (Nat. Comput., 2013)

The complexity of the stamp folding problem. - Takuya Umesato; Toshiki Saitoh; Ryuhei Uehara; Hiro Ito; Yoshio Okamoto (Theor. Comput. Sci., 2013)

Evaluation of Online Power-Down Algorithms. - James Andro-Vasko; Wolfgang Bein; Dara Nyknahad; Hiro Ito (ITNG, 2015)

Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract). - Kyle Burke; Erik D. Demaine; Harrison Gregg; Robert A. Hearn; Adam Hesterberg; Michael Hoffmann 001; Hiro Ito; Irina Kostitsyna; Jody Leonard; Maarten Löffler; Aaron Santiago; Christiane Schmidt 001; et al. (JCDCGG, 2015)

Number of Ties and Undefeated Signs in a Generalized Janken. - Hiro Ito; Yoshinao Shiono (JCDCGG, 2015)

Testing Outerplanarity of Bounded Degree Graphs. - Yuichi Yoshida; Hiro Ito (Algorithmica, 2015)

Cannibal Animal Games: a new variant of Tic-Tac-Toe. - Jean Cardinal; Sébastien Collette; Hiro Ito; Matias Korman; Stefan Langerman; Hikaru Sakaidani; Perouz Taslakian (J. Inf. Process., 2015)

Editor's Message for Special Issue on Recreational Discrete Mathematics. - Hiro Ito (J. Inf. Process., 2015)

Generalized River Crossing Problems. - Hiro Ito; Stefan Langerman; Yuichi Yoshida (Theory Comput. Syst., 2015)

Every Property Is Testable on a Natural Class of Scale-Free Multigraphs. - Hiro Ito (ESA, 2016)

A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique. - Etsuji Tomita; Kohei Yoshida; Takuro Hatta; Atsuki Nagao; Hiro Ito; Mitsuo Wakatsuki (FAW, 2016)

How to Solve the Cake-Cutting Problem in Sublinear Time. - Hiro Ito; Takahiro Ueda (FUN, 2016)

Single-Player and Two-Player Buttons & Scissors Games. - Kyle Burke; Erik D. Demaine; Harrison Gregg; Robert A. Hearn; Adam Hesterberg; Michael Hoffmann 001; Hiro Ito; Irina Kostitsyna; Jody Leonard; Maarten Löffler; Aaron Santiago; Christiane Schmidt 001; et al. (CoRR, 2016)

Folding a paper strip to minimize thickness. - Erik D. Demaine; David Eppstein; Adam Hesterberg; Hiro Ito; Anna Lubiw; Ryuhei Uehara; Yushi Uno (J. Discrete Algorithms, 2016)

Unfolding and Dissection of Multiple Cubes, Tetrahedra, and Doubly Covered Squares. - Zachary Abel; Brad Ballinger; Erik D. Demaine; Martin L. Demaine; Jeff Erickson 001; Adam Hesterberg; Hiro Ito; Irina Kostitsyna; Jayson Lynch; Ryuhei Uehara (J. Inf. Process., 2017)

Transforming Graphs with the Same Graphic Sequence. - Sergey Bereg; Hiro Ito (J. Inf. Process., 2017)

A Much Faster Algorithm for Finding a Maximum Clique with Computational Experiments. - Etsuji Tomita; Sora Matsuzaki; Atsuki Nagao; Hiro Ito; Mitsuo Wakatsuki (J. Inf. Process., 2017)

Bumpy pyramid folding. - Zachary Abel; Erik D. Demaine; Martin L. Demaine; Hiro Ito; Jack Snoeyink; Ryuhei Uehara (Comput. Geom., 2018)

Modulation-Adaptive Link-Disjoint Path Selection Model for 1 + 1 Protected Elastic Optical Networks. - Yuto Kishi; Nattapong Kitsuwan; Hiro Ito; Bijoy Chand Chatterjee; Eiji Oki (IEEE Access, 2019)

On the Characterization of 1-sided error Strongly-Testable Graph Properties for bounded-degree graphs, including an appendix. - Hiro Ito; Areej Khoury; Ilan Newman (CoRR, 2019)

Generalized Shogi, Chess, and Xiangqi are Constant-Time Testable. - Hiro Ito; Atsuki Nagao; Teagun Park (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019)

Energy Efficiency and Renewable Energy Management with Multi-State Power-Down Systems. - James Andro-Vasko; Wolfgang W. Bein; Hiro Ito (Inf., 2019)

Hyperfiniteness of Real-World Networks. - Yutaro Honda; Yoshitaka Inoue; Hiro Ito; Munehiko Sasajima; Junichi Teruyama; Yushi Uno (Rev. Socionetwork Strateg., 2019)

What Graph Properties Are Constant-Time Testable? - Hiro Ito (Rev. Socionetwork Strateg., 2019)

Preface for the Special Issue on the Project "Foundation of Innovative Algorithms for Big Data". - Naoki Katoh; Yuya Higashikawa; Hiro Ito; Shun Kataoka; Takuya Kida; Toshiki Saitoh; Tetsuo Shibuya; Kazuyuki Tanaka; Yushi Uno (Rev. Socionetwork Strateg., 2019)

On the characterization of 1-sided error strongly testable graph properties for bounded-degree graphs. - Hiro Ito; Areej Khoury; Ilan Newman (Comput. Complex., 2020)

Twenty Years of Progress of ${JCDCG}^3$. - Jin Akiyama; Hiro Ito; Toshinori Sakai; Yushi Uno (Graphs Comb., 2020)

Cookie Clicker. - Erik D. Demaine; Hiro Ito; Stefan Langerman; Jayson Lynch; Mikhail Rudoy; Kai Xiao (Graphs Comb., 2020)

K3 Edge Cover Problem in a Wide Sense. - Kyohei Chiba; Rémy Belmonte; Hiro Ito; Michael Lampis; Atsuki Nagao; Yota Otachi (J. Inf. Process., 2020)

Flat Folding a Strip with Parallel or Nonacute Zigzag Creases with Mountain-Valley Assignment. - Erik D. Demaine; Martin L. Demaine; Hiro Ito; Chie Nara; Izumi Shirahama; Tomohiro Tachi; Mizuho Tomura (J. Inf. Process., 2020)

Editor's Message for Special Issue of Discrete and Computational Geometry, Graphs, and Games. - Hiro Ito (J. Inf. Process., 2020)

FUN editorial. - Hiro Ito; Stefano Leonardi 001; Linda Pagli; Giuseppe Prencipe (Theor. Comput. Sci., 2020)

Turning Around and Around: Motion Planning through Thick and Thin Turnstiles. - Aster Greenblatt; Oscar I. Hernandez; Robert A. Hearn; Yichao Hou; Hiro Ito; Minwoo Kang; Aaron Williams 001; Andrew Winslow (CCCG, 2021)

Computational Complexity of Flattening Fixed-Angle Orthogonal Chains. - Erik D. Demaine; Hiro Ito; Jayson Lynch; Ryuhei Uehara (CCCG, 2022)

Geodesic Paths Passing Through All Faces on A Polyhedron. - Erik D. Demaine; Martin L. Demaine; David Eppstein; Hiro Ito; Yuta Katayama; Wataru Maruyama; Yushi Uno (JCDCGGG, 2022)

Numerically Balanced Dice on Convex Isohedra. - Hiro Ito; Shunsuke Kanaya; Risa Tamechika (JCDCGGG, 2022)

Sublinear Computation Paradigm: Constant-Time Algorithms and Sublinear Progressive Algorithms. - Kyohei Chiba; Hiro Ito (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2022)