Hiro Ito - RankMe

116 papers A* 1A 2B 9C 3Misc 5Journal 68Unranked 24

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A linear-time algorithm for the two-color one-dimensional buttons & scissors. Inf. Process. Lett. Suguru Hayata, Hiro Ito
2026	—	`ed.`	Discrete and Computational Geometry, Graphs, and Games - 24th Japanese Conference, JCDCGGG 2022, Virtual Event, September 9-11, 2022, Revised Selected Papers JCDCGGG Jin Akiyama, Hiro Ito, Toshinori Sakai
2025	J	`jnl`	Editor's Message to Special Issue of the 26th Japan Conference on Discrete and Computational Geometry, Graphs, and Games. J. Inf. Process. Hiro Ito
2022	—	`conf`	Computational Complexity of Flattening Fixed-Angle Orthogonal Chains. CCCG Erik D. Demaine, Hiro Ito, Jayson Lynch, Ryuhei Uehara
2022	J	`jnl`	Computational Complexity of Flattening Fixed-Angle Orthogonal Chains. CoRR Erik D. Demaine, Hiro Ito, Jayson Lynch, Ryuhei Uehara
2022	—	`conf`	Geodesic Paths Passing Through All Faces on A Polyhedron. JCDCGGG Erik D. Demaine, Martin L. Demaine, David Eppstein, Hiro Ito, Yuta Katayama, Wataru Maruyama, Yushi Uno
2022	—	`conf`	Numerically Balanced Dice on Convex Isohedra. JCDCGGG Hiro Ito, Shunsuke Kanaya, Risa Tamechika
2022	J	`jnl`	Sublinear Computation Paradigm: Constant-Time Algorithms and Sublinear Progressive Algorithms. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Kyohei Chiba, Hiro Ito
2021	—	`conf`	Turning Around and Around: Motion Planning through Thick and Thin Turnstiles. CCCG Aster Greenblatt, Oscar I. Hernandez, Robert A. Hearn, Yichao Hou, Hiro Ito, Minwoo Kang, Aaron Williams, Andrew Winslow
2020	J	`jnl`	Cookie Clicker. Graphs Comb. Erik D. Demaine, Hiro Ito, Stefan Langerman, Jayson Lynch, Mikhail Rudoy, Kai Xiao
2020	J	`jnl`	Editor's Message for Special Issue of Discrete and Computational Geometry, Graphs, and Games. J. Inf. Process. Hiro Ito
2020	J	`jnl`	FUN editorial. Theor. Comput. Sci. Hiro Ito, Stefano Leonardi, Linda Pagli, Giuseppe Prencipe
2020	J	`jnl`	Flat Folding a Strip with Parallel or Nonacute Zigzag Creases with Mountain-Valley Assignment. J. Inf. Process. Erik D. Demaine, Martin L. Demaine, Hiro Ito, Chie Nara, Izumi Shirahama, Tomohiro Tachi, Mizuho Tomura
2020	J	`jnl`	On the characterization of 1-sided error strongly testable graph properties for bounded-degree graphs. Comput. Complex. Hiro Ito, Areej Khoury, Ilan Newman
2020	J	`jnl`	Twenty Years of Progress of ${JCDCG}^3$. Graphs Comb. Jin Akiyama, Hiro Ito, Toshinori Sakai, Yushi Uno
2019	J	`jnl`	Energy Efficiency and Renewable Energy Management with Multi-State Power-Down Systems. Inf. James Andro-Vasko, Wolfgang W. Bein, Hiro Ito
2019	J	`jnl`	Generalized Shogi, Chess, and Xiangqi are Constant-Time Testable. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Hiro Ito, Atsuki Nagao, Teagun Park
2019	J	`jnl`	Hyperfiniteness of Real-World Networks. Rev. Socionetwork Strateg. Yutaro Honda, Yoshitaka Inoue, Hiro Ito, Munehiko Sasajima, Junichi Teruyama, Yushi Uno
2019	J	`jnl`	Modulation-Adaptive Link-Disjoint Path Selection Model for 1 + 1 Protected Elastic Optical Networks. IEEE Access Yuto Kishi, Nattapong Kitsuwan, Hiro Ito, Bijoy Chand Chatterjee, Eiji Oki
2019	J	`jnl`	On the Characterization of 1-sided error Strongly-Testable Graph Properties for bounded-degree graphs, including an appendix. CoRR Hiro Ito, Areej Khoury, Ilan Newman
2019	J	`jnl`	Preface for the Special Issue on the Project "Foundation of Innovative Algorithms for Big Data". Rev. Socionetwork Strateg. Naoki Katoh, Yuya Higashikawa, Hiro Ito, Shun Kataoka, Takuya Kida, Toshiki Saitoh, Tetsuo Shibuya, Kazuyuki Tanaka, Yushi Uno
2019	J	`jnl`	What Graph Properties Are Constant-Time Testable? Rev. Socionetwork Strateg. Hiro Ito
2018	Misc	`ed.`	9th International Conference on Fun with Algorithms, FUN 2018, La Maddalena, Italy, June 13-15, 2018 FUN Hiro Ito, Stefano Leonardi, Linda Pagli, Giuseppe Prencipe
2018	J	`jnl`	Bumpy pyramid folding. Comput. Geom. Zachary Abel, Erik D. Demaine, Martin L. Demaine, Hiro Ito, Jack Snoeyink, Ryuhei Uehara
2018	J	`jnl`	Cookie Clicker. CoRR Erik D. Demaine, Hiro Ito, Stefan Langerman, Jayson Lynch, Mikhail Rudoy, Kai Xiao
2017	J	`jnl`	A Much Faster Algorithm for Finding a Maximum Clique with Computational Experiments. J. Inf. Process. Etsuji Tomita, Sora Matsuzaki, Atsuki Nagao, Hiro Ito, Mitsuo Wakatsuki
2017	J	`jnl`	Editor's Message for Special Issue of Discrete and Computational Geometry, Graphs, and Games. J. Inf. Process. Hiro Ito
2017	J	`jnl`	Helly Numbers of Polyominoes. CoRR Jean Cardinal, Hiro Ito, Matias Korman, Stefan Langerman
2017	J	`jnl`	Transforming Graphs with the Same Graphic Sequence. J. Inf. Process. Sergey Bereg, Hiro Ito
2017	J	`jnl`	Unfolding and Dissection of Multiple Cubes, Tetrahedra, and Doubly Covered Squares. J. Inf. Process. Zachary Abel, Brad Ballinger, Erik D. Demaine, Martin L. Demaine, Jeff Erickson, Adam Hesterberg, Hiro Ito, Irina Kostitsyna, Jayson Lynch, Ryuhei Uehara
2016	Misc	`conf`	A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique. FAW Etsuji Tomita, Kohei Yoshida, Takuro Hatta, Atsuki Nagao, Hiro Ito, Mitsuo Wakatsuki
2016	—	`ed.`	Discrete and Computational Geometry and Graphs - 18th Japan Conference, JCDCGG 2015, Kyoto, Japan, September 14-16, 2015, Revised Selected Papers JCDCGG Jin Akiyama, Hiro Ito, Toshinori Sakai, Yushi Uno
2016	A	`conf`	Every Property Is Testable on a Natural Class of Scale-Free Multigraphs. ESA Hiro Ito
2016	J	`jnl`	Folding a paper strip to minimize thickness. J. Discrete Algorithms Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno
2016	Misc	`conf`	How to Solve the Cake-Cutting Problem in Sublinear Time. FUN Hiro Ito, Takahiro Ueda
2016	J	`jnl`	Single-Player and Two-Player Buttons & Scissors Games. CoRR 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
2015	J	`jnl`	Cannibal Animal Games: a new variant of Tic-Tac-Toe. J. Inf. Process. Jean Cardinal, Sébastien Collette, Hiro Ito, Matias Korman, Stefan Langerman, Hikaru Sakaidani, Perouz Taslakian
2015	J	`jnl`	Editor's Message for Special Issue on Recreational Discrete Mathematics. J. Inf. Process. Hiro Ito
2015	—	`conf`	Evaluation of Online Power-Down Algorithms. ITNG James Andro-Vasko, Wolfgang Bein, Dara Nyknahad, Hiro Ito
2015	J	`jnl`	Every property is testable on a natural class of scale-free multigraphs. CoRR Hiro Ito
2015	B	`conf`	Folding a Paper Strip to Minimize Thickness. WALCOM Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno
2015	J	`jnl`	Generalized River Crossing Problems. Theory Comput. Syst. Hiro Ito, Stefan Langerman, Yuichi Yoshida
2015	J	`jnl`	How to solve the cake-cutting problem in sublinear time. CoRR Hiro Ito, Takahiro Ueda
2015	—	`conf`	Number of Ties and Undefeated Signs in a Generalized Janken. JCDCGG Hiro Ito, Yoshinao Shiono
2015	—	`conf`	Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract). JCDCGG 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
2015	J	`jnl`	Testing Outerplanarity of Bounded Degree Graphs. Algorithmica Yuichi Yoshida, Hiro Ito
2014	—	`conf`	Bumpy Pyramid Folding. CCCG Zachary Abel, Erik D. Demaine, Martin L. Demaine, Hiro Ito, Jack Snoeyink, Ryuhei Uehara
2014	—	`ed.`	Discrete and Computational Geometry and Graphs - 16th Japanese Conference, JCDCGG 2013, Tokyo, Japan, September 17-19, 2013, Revised Selected Papers JCDCGG Jin Akiyama, Hiro Ito, Toshinori Sakai
2014	J	`jnl`	Folding a Paper Strip to Minimize Thickness. CoRR Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno
2013	J	`jnl`	Cannibal Animal Games: a new variant of Tic-Tac-Toe. CoRR Jean Cardinal, Sébastien Collette, Hiro Ito, Matias Korman, Stefan Langerman, Hikaru Sakaidani, Perouz Taslakian
2013	J	`jnl`	Constant-Time Approximation Algorithms for the Optimum Branching Problem on Sparse Graphs. Int. J. Netw. Comput. Mitsuru Kusumoto, Yuichi Yoshida, Hiro Ito
2013	J	`jnl`	Helly Numbers of Polyominoes. Graphs Comb. Jean Cardinal, Hiro Ito, Matias Korman, Stefan Langerman
2013	J	`jnl`	On computational complexity of graph inference from counting. Nat. Comput. Szilárd Zsolt Fazekas, Hiro Ito, Yasushi Okuno, Shinnosuke Seki, Kei Taneishi
2013	J	`jnl`	The complexity of the stamp folding problem. Theor. Comput. Sci. Takuya Umesato, Toshiki Saitoh, Ryuhei Uehara, Hiro Ito, Yoshio Okamoto
2012	Misc	`conf`	Algorithms and Complexity of Generalized River Crossing Problems. FUN Hiro Ito, Stefan Langerman, Yuichi Yoshida
2012	—	`conf`	Constant-Time Algorithms for Sparsity Matroids. ICALP (1) Hiro Ito, Shin-ichi Tanigawa, Yuichi Yoshida
2012	C	`conf`	Constant-Time Approximation Algorithms for the Knapsack Problem. TAMC Hiro Ito, Susumu Kiyoshima, Yuichi Yoshida
2012	Misc	`conf`	Constant-Time Approximation Algorithms for the Optimum Branching Problem on Sparse Graphs. ICNC Mitsuru Kusumoto, Yuichi Yoshida, Hiro Ito
2012	—	`conf`	How to Generalize Janken - Rock-Paper-Scissors-King-Flea. TJJCCGG Hiro Ito
2012	J	`jnl`	Improved Constant-Time Approximation Algorithms for Maximum Matchings and Other Optimization Problems. SIAM J. Comput. Yuichi Yoshida, Masaki Yamamoto, Hiro Ito
2012	J	`jnl`	Property Testing on k-Vertex-Connectivity of Graphs. Algorithmica Yuichi Yoshida, Hiro Ito
2011	B	`conf`	An Online Algorithm Optimally Self-tuning to Congestion for Power Management Problems. WAOA Wolfgang W. Bein, Naoki Hatta, Nelson Hernandez-Cons, Hiro Ito, Shoji Kasahara, Jun Kawahara
2011	J	`jnl`	Arrangements of Graphs Comb. Jin Akiyama, Hiro Ito, Midori Kobayashi, Gisaku Nakamura
2011	C	`conf`	Complexity of the Stamp Folding Problem. COCOA Takuya Umesato, Toshiki Saitoh, Ryuhei Uehara, Hiro Ito
2011	J	`jnl`	Constant-Time Algorithms for Sparsity Matroids CoRR Hiro Ito, Shin-ichi Tanigawa, Yuichi Yoshida
2011	—	`conf`	Helly Numbers of Polyominoes. CCCG Jean Cardinal, Hiro Ito, Matias Korman, Stefan Langerman
2011	J	`jnl`	Preface. Graphs Comb. Hiro Ito
2010	—	`conf`	Making Polygons by Simple Folds and One Straight Cut. CGGA Erik D. Demaine, Martin L. Demaine, Andrea Hawksley, Hiro Ito, Po-Ru Loh, Shelly Manber, Omari Stephens
2010	J	`jnl`	Query-Number Preserving Reductions and Linear Lower Bounds for Testing. IEICE Trans. Inf. Syst. Yuichi Yoshida, Hiro Ito
2010	J	`jnl`	Testing J. Syst. Sci. Complex. Yuichi Yoshida, Hiro Ito
2010	—	`conf`	Testing Outerplanarity of Bounded Degree Graphs. APPROX-RANDOM Yuichi Yoshida, Hiro Ito
2009	A*	`conf`	An improved constant-time approximation algorithm for maximum matchings. STOC Yuichi Yoshida, Masaki Yamamoto, Hiro Ito
2009	J	`jnl`	Enumeration of isolated cliques and pseudo-cliques. ACM Trans. Algorithms Hiro Ito, Kazuo Iwama
2009	J	`jnl`	Maximum-cover source location problems with objective edge-connectivity three. Math. Methods Oper. Res. Kenya Sugihara, Hiro Ito
2009	J	`jnl`	The Multi-Commodity Source Location Problems and the Price of Greed. J. Graph Algorithms Appl. Hiro Ito, Mike Paterson, Kenya Sugihara
2008	—	`ed.`	Computational Geometry and Graph Theory - International Conference, KyotoCGGT 2007, Kyoto, Japan, June 11-15, 2007. Revised Selected Papers KyotoCGGT Hiro Ito, Mikio Kano, Naoki Katoh, Yushi Uno
2008	J	`jnl`	Inferring Pedigree Graphs from Genetic Distances. IEICE Trans. Inf. Syst. Takeyuki Tamura, Hiro Ito
2008	B	`conf`	Multi-commodity Source Location Problems and Price of Greed. WALCOM Hiro Ito, Mike Paterson, Kenya Sugihara
2008	—	`conf`	Property Testing on k-Vertex-Connectivity of Graphs. ICALP (1) Yuichi Yoshida, Hiro Ito
2007	J	`jnl`	Semi-Distance Codes and Steiner Systems. Graphs Comb. Hiro Ito, Midori Kobayashi, Gisaku Nakamura
2007	—	`conf`	Transforming Graphs with the Same Degree Sequence. KyotoCGGT Sergey Bereg, Hiro Ito
2007	J	`jnl`	Winning Ways of Weighted Poset Games. Graphs Comb. Hiro Ito, Gisaku Nakamura, Satoshi Takata
2006	J	`jnl`	Efficient Methods for Determining DNA Probe Orders. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Hiro Ito, Kazuo Iwama, Takeyuki Tamura
2006	J	`jnl`	Maximum-Cover Source-Location Problem with Objective Edge-Connectivity Three. Electron. Notes Discret. Math. Kenya Sugihara, Hiro Ito
2006	J	`jnl`	Maximum-Cover Source-Location Problems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Kenya Sugihara, Hiro Ito
2006	J	`jnl`	Preface. Discret. Appl. Math. Naoki Katoh, Hiro Ito
2006	J	`jnl`	Two equivalent measures on weighted hypergraphs. Discret. Appl. Math. Hiro Ito, Hiroshi Nagamochi
2005	—	`conf`	Impossibility of Transformation of Vertex Labeled Simple Graphs Preserving the Cut-Size Order. CJCDGCGT Hiro Ito
2005	—	`conf`	Infinite Series of Generalized Gosper Space Filling Curves. CJCDGCGT Jin Akiyama, Hiroshi Fukuda, Hiro Ito, Gisaku Nakamura
2005	A	`conf`	Linear-Time Enumeration of Isolated Cliques. ESA Hiro Ito, Kazuo Iwama, Tsuyoshi Osumi
2005	J	`jnl`	Single backup table schemes for shortest-path routing. Theor. Comput. Sci. Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro
2004	—	`conf`	Imperfectness of Data for STS-Based Physical Mapping. IFIP TCS Hiro Ito, Kazuo Iwama, Takeyuki Tamura
2004	C	`conf`	Subdivision of the Hierarchy of H-colorable Graph Classes by Circulant Graphs. CTW Akihiro Uejima, Hiro Ito
2004	J	`jnl`	Subdivision of the hierarchy of H-colorable graph classes by circulant graphs. Electron. Notes Discret. Math. Akihiro Uejima, Hiro Ito
2004	—	`conf`	Three Equivalent Partial Orders on Graphs with Real Edge-Weights Drawn on a Convex Polygon. JCDCG Hiro Ito
2003	J	`jnl`	Avoiding Routing Loops on the Internet. Theory Comput. Syst. Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro
2003	J	`jnl`	Foreword. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Hiro Ito
2003	B	`conf`	Polynomial-Time Computable Backup Tables for Shortest-Path Routing. SIROCCO Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro
2003	J	`jnl`	Source location problem with flow requirements in directed networks. Optim. Methods Softw. Hiro Ito, Kazuhisa Makino, Kouji Arata, Shoji Honami, Yuichiro Itatsu, Satoru Fujishige
2003	J	`jnl`	Sum of edge lengths of a multigraph drawn on a convex polygon. Comput. Geom. Hiro Ito
2002	B	`conf`	Avoiding Routing Loops on the Internet. SIROCCO Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro
2002	—	`conf`	Comparing Hypergraphs by Areas of Hyperedges Drawn on a Convex Polygon. JCDCG Hiro Ito, Hiroshi Nagamochi
2002	B	`conf`	File Transfer Tree Problems. ISAAC Hiro Ito, Hiroshi Nagamochi, Yosuke Sugiyama, Masato Fujita
2002	J	`jnl`	On IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Akihiro Uejima, Hiro Ito
2002	J	`jnl`	Source location problems considering vertex-connectivity and edge-connectivity simultaneously. Networks Hiro Ito, Motoyasu Ito, Yuichiro Itatsu, Kazuhiro Nakai, Hideyuki Uehara, Mitsuo Yokoyama
2001	J	`jnl`	Lengths of tours and permutations on a vertex set of a convex polygon. Discret. Appl. Math. Hiro Ito, Hideyuki Uehara, Mitsuo Yokoyama
2001	J	`jnl`	Minimum cost source location problem with vertex-connectivity requirements in digraphs. Inf. Process. Lett. Hiroshi Nagamochi, Toshimasa Ishii, Hiro Ito
2000	B	`conf`	Location Problems Based on Node-Connectivity and Edge-Connectivity between Nodes and Node-Subsets. ISAAC Hiro Ito, Yuichiro Itatsu, Hideyuki Uehara, Mitsuo Yokoyama, Motoyasu Ito
2000	B	`conf`	Slot assignment scheme for integrated voice and data traffic in reservation-type packet radio networks. PIMRC Hideyuki Uehara, Masato Fujihara, Mitsuo Yokoyama, Hiro Ito
2000	—	`conf`	Sum of Edge Lengths of a Graph Drawn on a Convex Polygon. JCDCG Hiro Ito, Hideyuki Uehara, Mitsuo Yokoyama
1998	—	`conf`	2-Dimension Ham Sandwich Theorem for Partitioning into Three Convex Pieces. JCDCG Hiro Ito, Hideyuki Uehara, Mitsuo Yokoyama
1998	J	`jnl`	Edge connectivity between nodes and node-subsets. Networks Hiro Ito, Mitsuo Yokoyama
1998	J	`jnl`	Linear Time Algorithms for Graph Search and Connectivity Determination on Complement Graphs. Inf. Process. Lett. Hiro Ito, Mitsuo Yokoyama
1998	—	`conf`	NP-Completeness of Stage Illumination Problems. JCDCG Hiro Ito, Hideyuki Uehara, Mitsuo Yokoyama
1998	B	`conf`	Repairing Flaws in a Picture Based on a Geometric Representation of a Digital Image. ISAAC Tetsuo Asano, Hiro Ito, Souichi Kimura, Shigeaki Shimazu
1994	—	`conf`	Network topology construction method and its support system. CAMAD Takashi Satake, Hiro Ito, Akiya Inoue