Hiro Ito

ORCID

Publication Activity (10 Years)

Years Active: 1994-2022
Publications (10 Years): 30

Top Venues

CoRR

J. Inf. Process.

Rev. Socionetwork Strateg.

CCCG

Publications

Kyohei Chiba, Hiro Ito
Sublinear Computation Paradigm: Constant-Time Algorithms and Sublinear Progressive Algorithms. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (3) (2022)
Erik D. Demaine, Hiro Ito, Jayson Lynch, Ryuhei Uehara
Computational Complexity of Flattening Fixed-Angle Orthogonal Chains. CCCG (2022)
Erik D. Demaine, Hiro Ito, Jayson Lynch, Ryuhei Uehara
Computational Complexity of Flattening Fixed-Angle Orthogonal Chains. CoRR (2022)
Aster Greenblatt, Oscar Hernandez, Robert A. Hearn, Yichao Hou, Hiro Ito, Minwoo Kang, Aaron Williams, Andrew Winslow
Turning Around and Around: Motion Planning through Thick and Thin Turnstiles. CCCG (2021)
Jin Akiyama, Hiro Ito, Toshinori Sakai, Yushi Uno
Twenty Years of Progress of ${JCDCG}^3$. Graphs Comb. 36 (2) (2020)
Hiro Ito, Areej Khoury, Ilan Newman
On the characterization of 1-sided error strongly testable graph properties for bounded-degree graphs. Comput. Complex. 29 (1) (2020)
Erik D. Demaine, Martin L. Demaine, Hiro Ito, Chie Nara, Izumi Shirahama, Tomohiro Tachi, Mizuho Tomura
Flat Folding a Strip with Parallel or Nonacute Zigzag Creases with Mountain-Valley Assignment. J. Inf. Process. 28 (2020)
Erik D. Demaine, Hiro Ito, Stefan Langerman, Jayson Lynch, Mikhail Rudoy, Kai Xiao
Cookie Clicker. Graphs Comb. 36 (2) (2020)
Hiro Ito
Editor's Message for Special Issue of Discrete and Computational Geometry, Graphs, and Games. J. Inf. Process. 28 (2020)
Kyohei Chiba, Rémy Belmonte, Hiro Ito, Michael Lampis, Atsuki Nagao, Yota Otachi
Edge Cover Problem in a Wide Sense. J. Inf. Process. 28 (2020)
Hiro Ito, Stefano Leonardi, Linda Pagli, Giuseppe Prencipe
FUN editorial. Theor. Comput. Sci. 842 (2020)
Yutaro Honda, Yoshitaka Inoue, Hiro Ito, Munehiko Sasajima, Junichi Teruyama, Yushi Uno
Hyperfiniteness of Real-World Networks. Rev. Socionetwork Strateg. 13 (2) (2019)
Hiro Ito, Atsuki Nagao, Teagun Park
Generalized Shogi, Chess, and Xiangqi are Constant-Time Testable. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2019)
Hiro Ito, Areej Khoury, Ilan Newman
On the Characterization of 1-sided error Strongly-Testable Graph Properties for bounded-degree graphs, including an appendix. CoRR (2019)
James Andro-Vasko, Wolfgang W. Bein, Hiro Ito
Energy Efficiency and Renewable Energy Management with Multi-State Power-Down Systems. Inf. 10 (2) (2019)
Yuto Kishi, Nattapong Kitsuwan, Hiro Ito, Bijoy Chand Chatterjee, Eiji Oki
Modulation-Adaptive Link-Disjoint Path Selection Model for 1 + 1 Protected Elastic Optical Networks. IEEE Access 7 (2019)
Hiro Ito
What Graph Properties Are Constant-Time Testable? Rev. Socionetwork Strateg. 13 (2) (2019)
Naoki Katoh, Yuya Higashikawa, Hiro Ito, Shun Kataoka, Takuya Kida, Toshiki Saitoh, Tetsuo Shibuya, Kazuyuki Tanaka, Yushi Uno
Preface for the Special Issue on the Project "Foundation of Innovative Algorithms for Big Data". Rev. Socionetwork Strateg. 13 (2) (2019)
Zachary Abel, Erik D. Demaine, Martin L. Demaine, Hiro Ito, Jack Snoeyink, Ryuhei Uehara
Bumpy pyramid folding. Comput. Geom. 75 (2018)
Erik D. Demaine, Hiro Ito, Stefan Langerman, Jayson Lynch, Mikhail Rudoy, Kai Xiao
Cookie Clicker. CoRR (2018)
Sergey Bereg, Hiro Ito
Transforming Graphs with the Same Graphic Sequence. J. Inf. Process. 25 (2017)
Hiro Ito
Editor's Message for Special Issue of Discrete and Computational Geometry, Graphs, and Games. J. Inf. Process. 25 (2017)
Etsuji Tomita, Sora Matsuzaki, Atsuki Nagao, Hiro Ito, Mitsuo Wakatsuki
A Much Faster Algorithm for Finding a Maximum Clique with Computational Experiments. J. Inf. Process. 25 (2017)
Zachary Abel, Brad Ballinger, Erik D. Demaine, Martin L. Demaine, Jeff Erickson, Adam Hesterberg, Hiro Ito, Irina Kostitsyna, Jayson Lynch, Ryuhei Uehara
Unfolding and Dissection of Multiple Cubes, Tetrahedra, and Doubly Covered Squares. J. Inf. Process. 25 (2017)
Jean Cardinal, Hiro Ito, Matias Korman, Stefan Langerman
Helly Numbers of Polyominoes. CoRR (2017)
Hiro Ito
Every Property Is Testable on a Natural Class of Scale-Free Multigraphs. ESA (2016)
Hiro Ito, Takahiro Ueda
How to Solve the Cake-Cutting Problem in Sublinear Time. FUN (2016)
Etsuji Tomita, Kohei Yoshida, Takuro Hatta, Atsuki Nagao, Hiro Ito, Mitsuo Wakatsuki
A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique. FAW (2016)
Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno
Folding a paper strip to minimize thickness. J. Discrete Algorithms 36 (2016)
Kyle Burke, Erik D. Demaine, Harrison Gregg, Robert A. Hearn, Adam Hesterberg, Michael Hoffmann, Hiro Ito, Irina Kostitsyna, Jody Leonard, Maarten Löffler, Aaron Santiago, Christiane Schmidt, Ryuhei Uehara, Yushi Uno, Aaron Williams
Single-Player and Two-Player Buttons & Scissors Games. CoRR (2016)
Yuichi Yoshida, Hiro Ito
Testing Outerplanarity of Bounded Degree Graphs. Algorithmica 73 (1) (2015)
James Andro-Vasko, Wolfgang Bein, Dara Nyknahad, Hiro Ito
Evaluation of Online Power-Down Algorithms. ITNG (2015)
Hiro Ito, Yoshinao Shiono
Number of Ties and Undefeated Signs in a Generalized Janken. JCDCGG (2015)
Hiro Ito
Editor's Message for Special Issue on Recreational Discrete Mathematics. J. Inf. Process. 23 (3) (2015)
Hiro Ito
Every property is testable on a natural class of scale-free multigraphs. CoRR (2015)
Hiro Ito, Stefan Langerman, Yuichi Yoshida
Generalized River Crossing Problems. Theory Comput. Syst. 56 (2) (2015)
Kyle Burke, Erik D. Demaine, Harrison Gregg, Robert A. Hearn, Adam Hesterberg, Michael Hoffmann, Hiro Ito, Irina Kostitsyna, Jody Leonard, Maarten Löffler, Aaron Santiago, Christiane Schmidt, Ryuhei Uehara, Yushi Uno, Aaron Williams
Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract). JCDCGG (2015)
Hiro Ito, Takahiro Ueda
How to solve the cake-cutting problem in sublinear time. CoRR (2015)
Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno
Folding a Paper Strip to Minimize Thickness. WALCOM (2015)
Jean Cardinal, Sébastien Collette, Hiro Ito, Matias Korman, Stefan Langerman, Hikaru Sakaidani, Perouz Taslakian
Cannibal Animal Games: a new variant of Tic-Tac-Toe. J. Inf. Process. 23 (3) (2015)
Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno
Folding a Paper Strip to Minimize Thickness. CoRR (2014)
Zachary Abel, Erik D. Demaine, Martin L. Demaine, Hiro Ito, Jack Snoeyink, Ryuhei Uehara
Bumpy Pyramid Folding. CCCG (2014)
Takuya Umesato, Toshiki Saitoh, Ryuhei Uehara, Hiro Ito, Yoshio Okamoto
The complexity of the stamp folding problem. Theor. Comput. Sci. 497 (2013)
Szilárd Zsolt Fazekas, Hiro Ito, Yasushi Okuno, Shinnosuke Seki, Kei Taneishi
On computational complexity of graph inference from counting. Nat. Comput. 12 (4) (2013)
Jean Cardinal, Sébastien Collette, Hiro Ito, Matias Korman, Stefan Langerman, Hikaru Sakaidani, Perouz Taslakian
Cannibal Animal Games: a new variant of Tic-Tac-Toe. CoRR (2013)
Jean Cardinal, Hiro Ito, Matias Korman, Stefan Langerman
Helly Numbers of Polyominoes. Graphs Comb. 29 (5) (2013)
Mitsuru Kusumoto, Yuichi Yoshida, Hiro Ito
Constant-Time Approximation Algorithms for the Optimum Branching Problem on Sparse Graphs. Int. J. Netw. Comput. 3 (2) (2013)
Hiro Ito, Susumu Kiyoshima, Yuichi Yoshida
Constant-Time Approximation Algorithms for the Knapsack Problem. TAMC (2012)
Hiro Ito, Shin-ichi Tanigawa, Yuichi Yoshida
Constant-Time Algorithms for Sparsity Matroids. ICALP (1) (2012)
Yuichi Yoshida, Hiro Ito
Property Testing on k-Vertex-Connectivity of Graphs. Algorithmica 62 (3-4) (2012)
Hiro Ito, Stefan Langerman, Yuichi Yoshida
Algorithms and Complexity of Generalized River Crossing Problems. FUN (2012)
Hiro Ito
How to Generalize Janken - Rock-Paper-Scissors-King-Flea. TJJCCGG (2012)
Mitsuru Kusumoto, Yuichi Yoshida, Hiro Ito
Constant-Time Approximation Algorithms for the Optimum Branching Problem on Sparse Graphs. ICNC (2012)
Yuichi Yoshida, Masaki Yamamoto, Hiro Ito
Improved Constant-Time Approximation Algorithms for Maximum Matchings and Other Optimization Problems. SIAM J. Comput. 41 (4) (2012)
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)
Jean Cardinal, Hiro Ito, Matias Korman, Stefan Langerman
Helly Numbers of Polyominoes. CCCG (2011)
Hiro Ito, Shin-ichi Tanigawa, Yuichi Yoshida
Constant-Time Algorithms for Sparsity Matroids CoRR (2011)
Hiro Ito
Preface. Graphs Comb. 27 (3) (2011)
Jin Akiyama, Hiro Ito, Midori Kobayashi, Gisaku Nakamura
/2. Graphs Comb. 27 (3) (2011)
Takuya Umesato, Toshiki Saitoh, Ryuhei Uehara, Hiro Ito
Complexity of the Stamp Folding Problem. COCOA (2011)
Yuichi Yoshida, Hiro Ito
Testing Outerplanarity of Bounded Degree Graphs. APPROX-RANDOM (2010)
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)
Yuichi Yoshida, Hiro Ito
Query-Number Preserving Reductions and Linear Lower Bounds for Testing. IEICE Trans. Inf. Syst. (2) (2010)
Yuichi Yoshida, Hiro Ito
-edge-connectivity of digraphs. J. Syst. Sci. Complex. 23 (1) (2010)
Hiro Ito, Kazuo Iwama
Enumeration of isolated cliques and pseudo-cliques. ACM Trans. Algorithms 5 (4) (2009)
Kenya Sugihara, Hiro Ito
Maximum-cover source location problems with objective edge-connectivity three. Math. Methods Oper. Res. 70 (1) (2009)
Yuichi Yoshida, Masaki Yamamoto, Hiro Ito
An improved constant-time approximation algorithm for maximum matchings. STOC (2009)
Hiro Ito, Mike Paterson, Kenya Sugihara
The Multi-Commodity Source Location Problems and the Price of Greed. J. Graph Algorithms Appl. 13 (1) (2009)
Takeyuki Tamura, Hiro Ito
Inferring Pedigree Graphs from Genetic Distances. IEICE Trans. Inf. Syst. (2) (2008)
Hiro Ito, Mike Paterson, Kenya Sugihara
Multi-commodity Source Location Problems and Price of Greed. WALCOM (2008)
Yuichi Yoshida, Hiro Ito
Property Testing on k-Vertex-Connectivity of Graphs. ICALP (1) (2008)
Hiro Ito, Gisaku Nakamura, Satoshi Takata
Winning Ways of Weighted Poset Games. Graphs Comb. 23 (Supplement-1) (2007)
Sergey Bereg, Hiro Ito
Transforming Graphs with the Same Degree Sequence. KyotoCGGT (2007)
Hiro Ito, Midori Kobayashi, Gisaku Nakamura
Semi-Distance Codes and Steiner Systems. Graphs Comb. 23 (Supplement-1) (2007)
Naoki Katoh, Hiro Ito
Preface. Discret. Appl. Math. 154 (16) (2006)
Hiro Ito, Kazuo Iwama, Takeyuki Tamura
Efficient Methods for Determining DNA Probe Orders. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (5) (2006)
Kenya Sugihara, Hiro Ito
Maximum-Cover Source-Location Problem with Objective Edge-Connectivity Three. Electron. Notes Discret. Math. 25 (2006)
Hiro Ito, Hiroshi Nagamochi
Two equivalent measures on weighted hypergraphs. Discret. Appl. Math. 154 (16) (2006)
Kenya Sugihara, Hiro Ito
Maximum-Cover Source-Location Problems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (5) (2006)
Jin Akiyama, Hiroshi Fukuda, Hiro Ito, Gisaku Nakamura
Infinite Series of Generalized Gosper Space Filling Curves. CJCDGCGT (2005)
Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro
Single backup table schemes for shortest-path routing. Theor. Comput. Sci. 333 (3) (2005)
Hiro Ito, Kazuo Iwama, Tsuyoshi Osumi
Linear-Time Enumeration of Isolated Cliques. ESA (2005)
Hiro Ito
Impossibility of Transformation of Vertex Labeled Simple Graphs Preserving the Cut-Size Order. CJCDGCGT (2005)
Akihiro Uejima, Hiro Ito
Subdivision of the hierarchy of H-colorable graph classes by circulant graphs. Electron. Notes Discret. Math. 17 (2004)
Hiro Ito
Three Equivalent Partial Orders on Graphs with Real Edge-Weights Drawn on a Convex Polygon. JCDCG (2004)
Hiro Ito, Kazuo Iwama, Takeyuki Tamura
Imperfectness of Data for STS-Based Physical Mapping. IFIP TCS (2004)
Akihiro Uejima, Hiro Ito
Subdivision of the Hierarchy of H-colorable Graph Classes by Circulant Graphs. CTW (2004)
Hiro Ito
Foreword. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (5) (2003)
Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro
Avoiding Routing Loops on the Internet. Theory Comput. Syst. 36 (6) (2003)
Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro
Polynomial-Time Computable Backup Tables for Shortest-Path Routing. SIROCCO (2003)
Hiro Ito, Kazuhisa Makino, Kouji Arata, Shoji Honami, Yuichiro Itatsu, Satoru Fujishige
Source location problem with flow requirements in directed networks. Optim. Methods Softw. 18 (4) (2003)
Hiro Ito
Sum of edge lengths of a multigraph drawn on a convex polygon. Comput. Geom. 24 (1) (2003)
Hiro Ito, Hiroshi Nagamochi, Yosuke Sugiyama, Masato Fujita
File Transfer Tree Problems. ISAAC (2002)
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) (2002)
Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro
Avoiding Routing Loops on the Internet. SIROCCO (2002)
Hiro Ito, Hiroshi Nagamochi
Comparing Hypergraphs by Areas of Hyperedges Drawn on a Convex Polygon. JCDCG (2002)
Akihiro Uejima, Hiro Ito
Expressed by Complements of Cycles, Bipartite Graphs, and Chordal Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (5) (2002)
Hiro Ito, Hideyuki Uehara, Mitsuo Yokoyama
Lengths of tours and permutations on a vertex set of a convex polygon. Discret. Appl. Math. 115 (1-3) (2001)
Hiroshi Nagamochi, Toshimasa Ishii, Hiro Ito
Minimum cost source location problem with vertex-connectivity requirements in digraphs. Inf. Process. Lett. 80 (6) (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)

Hiro Ito.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Hiro Ito