Last update: May 17, 2017.

[Refereed Journals][Refereed International Conference Proceedings] [arXiv]

**INOUE Akiya, YAMAMOTO Hisao, ITO Hiro and MASE Kenichi, Advanced call-level routing schemes for hybrid controlled dynamic routing,***IEICE Transactions*, Vol. E74, No. 12, 1991, pp. 4025--4033.**ITO Hiro, Multi-commodity flow problem with link number constraint,***IEICE Transactions*, Vol. J75-A, No. 3, 1992, pp. 643--645. (in Japanese)**ITO Hiro and INOUE Akiya, An algorithm for defining a routing domain on dynamic routing,***IEICE Transactions*, Vol. J75-B-I, No. 5, 1992, pp. 323--332. (in Japanese)**ITO Hiro, Node-to-area connectivity of graphs,***The Transactions of IEE of Japan*, Vol. 114-C, No. 4, pp. 463--469, 1994. (in Japanese)**ITO Hiro, Computational complexity of multicommodity flow problems with uniform assignment of flow,***Electronics and Communications in Japan*., Vol. 78. No. 8, 1995, pp. 52--62. (Translated from a paper written in Japanese. -> The original paper is not in this list. See, the list of Japanese titles.)**ITO Hiro, Connectivity problem on area graphs for locally striking disasters --- direct NA-connection,***IEICE Transactions*, Vol. E78-A, No. 3, 1995, pp. 363--370.**MATSUZAKI Ryuichi and ITO Hiro, An algorithm using flow assignment for network performance estimation,***IEICE Transactions*, Vol. J78-B-I, No. 12, 1995, pp. 825--836. (in Japanese)**MIWA Hiroyoshi and ITO Hiro, Complexity and algorithm for reallocation problem,***IEICE Transactions*, Vol. E79-A, No. 4, 1996, pp. 461--468.**MIWA Hiroyoshi and ITO Hiro, A linear-time algorithm for determining the order of moving products in reallocation problems,***IEICE Transactions*, Vol. E80-A, No. 3, 1997, pp. 534--543.**ITO Hiro and YOKOYAMA Mitsuo, Edge connectivity between nodes and node-subsets,***Networks*, Vol. 31, No. 3, 1998, pp. 157--164.**MIWA Hiroyoshi and ITO Hiro, Sparse spanning subgraphs preserving connectivity and distance between vertices and vertex subsets,***IEICE Transactions*, Vol. E81-A, No. 5, 1998, pp. 832--841.**ITO Hiro and YOKOYAMA Mitsuo, Linear time algorithms for graph search and connectivity determination on complement graphs,***Information Processing Letters*, Vol. 66, No. 4, 1998, pp. 209--213.**AOKI Shiro, ITO Hiro, UEHARA Hideyuki, YOKOYAMA Mitsuo, and HORINOUCHI Tsuyoshi, NP-hardness of rotation type cell-mazes,***IEICE Transactions*, Vol. E83-A, No. 3, pp. 492--496, 2000.**MIWA Hiroyoshi and ITO Hiro, NP-completeness of reallocation problems with restricted block volume,***IEICE Transactions*, Vol. E83-A, No. 4, 2000, pp. 590--597.**ITO Hiro, UEHARA Hideyuki, and YOKOYAMA Mitsuo, A faster and flexible algorithm for a location problem on undirected flow networks,***IEICE Transactions*, Vol. E83-A, No. 4, 2000, pp. 704--712.**YOKOTA Masaya, TSUKIJI Tatsuie, FUJII Shinji, and ITO Hiro, On PSPACE-completeness of generalized tsume-shogi with a given number of moves,***IEICE Transactions*, Vol. J84-D-I, No. 1, 2001, pp. 58--61. (in Japanese)**KONISHI Tatsumi, YOKOYAMA Mitsuo, UEHARA Hideyuki, and ITO Hiro, Convolutional codes over rings for Rayleigh fading channels,***IEICE Transactions*, Vol. J84-A, No. 6, 2001, pp. 834--839. (in Japanese)**ITO Hiro, UEHARA Hideyuki, and YOKOYAMA Mitsuo, A generalization of 2-dimension ham sandwich theorem,***IEICE Transactions*, Vol. E84-A, No. 5, 2001, pp. 1144--1151. ->[pdf-file]**NAGAMOCHI Hiroshi, ISHII Toshimasa, and ITO Hiro, Minimum cost source location problem with vertex-connectivity requirements in digraphs,***Information Processing Letters*, Vol. 80, No. 6, 2001, pp. 287--294.**ITO Hiro, UEHARA Hideyuki, and YOKOYAMA Mitsuo, Lengths of tours and permutations on a vertex set of a convex polygon,***Discrete Applied Mathematics*, Vol. 115, No. 1, 2001, pp. 63--72.**UEHARA Hideyuki, YOKOYAMA Mitsuo, and ITO Hiro, Channel assignment scheme for integrated voice and data traffic in reservation-type packet radio network,***IEICE Transactions*., Vol. E85-B, No. 1, 2002, pp. 191--198.**KONISHI Tatsumi, YOKOYAMA Mitsuo, UEHARA Hideyuki, and ITO Hiro, Variable rate MPSK coded modulation using convolutional codes over modules,***IEICE Transactions*, Vol. J85-A, No. 3, 2002, pp. 334--339. (in Japanese)**UEJIMA Akihiro, ITO Hiro, UEHARA Hideyuki, and YOKOYAMA Mitsuo, Coloring problem with restrictions of adjacent colors,***International Transactions in Operational Research*, Vol. 9, No. 2, 2002, pp. 183--194.**UEJIMA Akihiro and ITO Hiro, On***H*-coloring problems with*H*expressed by complements of cycles, bipartite graphs, and chordal graphs,*IEICE Transactions*, Vol. E85-A, No. 5, 2002, pp. 1026--1030.**ITO Hiro, ITO Motoyasu, ITATSU Yuichiro, NAKAI Kazuhiro, UEHARA Hideyuki, and YOKOYAMA Mitsuo, Source location problems considering vertex-connectivity and edge-connectivity simultaneously,***Networks*, Vol. 40, No. 2, 2002, pp. 63--70. [published online]**ODA Masato, UEHARA Hideyuki, YOKOYAMA Mitsuo, and ITO Hiro, Safety information collecting network using self-organizing packet relay protocol,***IEICE Tansactions*, Vol. J85-B, No. 12, 2002, pp. 2037--2044. (in Japanese)**KITAGISHI Yumiko, UEHARA Hideyuki, YAMAMOTO Akira, YOKOYAMA Mitsuo, and ITO Hiro, Packet relay control scheme based on priority regions in multihop wireless networks,***IEICE Tansactions*, Vol. J85-B, No. 12, 2002, pp. 2119--2128. (in Japanese)**ITO Hiro, Sum of edge lengths of a multigraph drawn on a convex polygon,***Computational Geometry*, Vol. 24, No. 1, 2003, pp. 41--47.**ITO Hiro, IWAMA Kazuo, OKABE Yasuo, and YOSHIHIRO Takuya, Avoiding routing loops on the Internet,***Theory of Computing Systems*, Vol. 36, No. 6, Nov., 2003, pp. 597--609.**ITO Hiro, MAKINO Kazuhisa, ARATA Kouji, HONAMI Shoji, ITATSU Yuichiro, and FUJISHIGE Satoru, Source location problem with flow requirements in directed networks,***Optimization Methods and Software*, Vol. 18, No. 4, Aug., 2003, pp. 427--435.**UEJIMA Akihiro, ITO Hiro, and TSUKIJI Tatsuie, $_overline C_7$-coloring problem,***IEICE Transactions*, Vol. E87-A, No. 5, May. 2004, pp. 1243--1250.**MIWA Hiroyoshi and ITO Hiro, NA-edge-connectivity augmentation problems by adding edges,***Journal of the Operations Reserch Society of Japan*, Vol. 47, No. 4, 2004, pp. 224--243.**ITO Hiro, IWAMA Kazuo, OKABE Yasuo, and YOSHIHIRO Takuya, Single-backup-table schemes for shortest-path routing,***Theoretical Computer Science*, Vol. 333, Issue 3, March, 2005, pp. 347--353.**ITO Hiro and NAGAMOCHI Hiroshi, Two equivalent measures on weighted hypergraphs,***Discrete Applied Mathematics*, Dicsrete Algorithms and Optimization --- Special Issue Honoring Professor Ibaraki at His Retirement from Kyoto University, Vol. 154, 2006, pp. 2330--2334.**ITO Hiro, IWAMA Kazuo, and TAMURA Takeyuki, Efficient methods of determining DNA probe sequences,***IEICE Transactions*, Vol. E89-A, No. 5, 2006, 1292--1298.**SUGIHARA Kenya and ITO Hiro, Maximum-cover source location problems,***IEICE Transactions*, Vol. E89-A, No. 5, 2006, 1370--1377.**ITO Hiro, Harary's generalized ticktacktoe,***IEICE Transactions*, Vol. J89-A, No. 6, 2006, pp. 458--469. (in Japanese)**ITO Hiro, KOBAYASHI Midori, and NAKAMURA Gisaku, Semi-distance codes and Steiner systems,***Akiyama-Chvatal Festschrift, Supplement of "Graphs and Combinatorics,"*Springer, 2007, pp. 283--290.**ITO Hiro, NAKAMURA Gisaku, and TAKATA Satoshi, Winning ways of weighted poset games,***Akiyama-Chvatal Festschrift, Supplement of "Graphs and Combinatorics,"*Springer, 2007, pp. 291--306.**ITO Hiro, IWAMA Kazuo, and TAMURA Takeyuki, Inferring pedigrees from genetic distances,***IEICE Transactions*, Vol. E91-D, No. 2, 2008, pp. 162--169.**SUGIHARA Kenya and ITO Hiro, Maximum-cover source location problems with objective edge-connectivity three,***Mathematical Methods of Operations Research*, Sept., 2008, DOI: 10.1007/s00186-008-0266-1.**ITO Hiro, Mike PATERSON, and SUGIHARA Kenya, Multi-commodity source location problems and the price of greed,***Journal of Graph Algorithms and Applications*, Vol. 13, No. 1, 2009, pp. 55--73.**ITO Hiro and IWAMA Kazuo, Enumeration of isolated cliques and pseudo-cliques,***ACM Transactions on Algorithms*, Vol. 5, Issue 4, Oct. 2009, Article 40, pp. 40:1--40:21.**YOSHIDA Yuichi and ITO Hiro, Testing***k*-edge-connectivity of digraphs,*Journal of System Science and Complexity*, Vol. 23, 2010, pp. 91--101.**YOSHIDA Yuichi and ITO Hiro, Query-number preserving reductions and linear lower bounds for testing,***IEICE Transactions*, Vol. E93-D, No. 2, 2010, pp. 233--240.**AKIYAMA Jin, ITO Hiro, KOBAYASHI Midori and NAKAMURA Gisaku, Arrangements of n points whose incident-line-numbers are at most n/2, Special Issue of JCCGG2009,***Graphs and Combinatorics*, Springer, Vol. 27, No. 3, 2011, pp. 321--326.**YOSHIDA Yuichi and ITO Hiro, Property testing on k-vertex connectivity of graphs,***Algorithmica*, Vol. 62, No. 3--4, 2012, pp. 701--712.**ITO Hiro, TERUYAMA Junichi, and YOSHIDA Yuichi, An almost optimal algorithm for Winkler's sorting pairs in bins,***Progress in Informatics*, No. 9, 2012, pp. 3--7.**YOSHIDA Yuichi, YAMAMOTO Masaki, and ITO Hiro, An improved constant-time approximation algorithm for maximum matchings and other optimization problems,***SIAM Journal on Computing*,**Vol. 41, No. 4, 2012, pp. 1074--1093.****UMESATO Takuya, SAITOH Toshiki, UEHARA Ryuhei, ITO Hiro, and OKAMOTO Yoshio, Complexity of the stamp folding problem,***Theoretical Computer Science*, Elsevier, Vol. 497, No. 29. 2013, pp. 13--19.**Szilard Zsolt Fazekas, Hiro Ito, Yasushi Okuno, Shinnosuke Seki, and Kei Taneishi, On computational complexity of graph inference from counting,***Natural Computing*, Springer, Vol 12, No. 4, 2013, pp. 589--603.**KUSUMOTO Mitsuru, YOSHIDA Yuichi, and ITO Hiro, Constant-time approximation algorithms for the optimum branching problem on sparse graphs, International Journal of Networking and Computing, VOl. 3, No. 2, 2013, pp. 201--216.****Jean CARDINAL, ITO Hiro, Matias KORMAN, Stefan LANGERMAN, Helly numbers of polyominoes,***Graphs and Combinatorics,*Vol. 29, No. 5, 2013, pp. 1221--1234.**YOSHIDA Yuichi and ITO Hiro, Testing outerplanarity of bounded degree graphs,***Algorithmica*, Vol. 73, No. 1, 2015, pp. 1--20.**ITO Hiro, Stefan LANGERMAN, and YOSHIDA Yuichi, Generalized river crossing problems,***Theory of Computing Systems*, Vo. 56, Issue 2, 2015, pp. 418--435.**Jean CARDINAL, Sebastien COLETTE, ITO Hiro, Matias KORMAN, Stefan LANGERMAN, SAKIDANI Hikaru, Perouz TASLAKIAN, Cannibal animal games: a new variant of tic-tac-toe,***Journal of Information Processing,*Vol. 23, No. 3, 2015, pp. 418--435. --- *** JIP Specially Selected Paper Award *****Erik D Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno, Folding a Paper Strip to Minimize Thickness,***Journal of Discrete Algorithms*, Vol. 36, Jan. 2016, pp. 18--26.**TOMITA Etsuji, MATSUZAKI Sora, NAGAO Atsuki, ITO Hiro, and WAKATSUKI Mitsuo, A much faster algorithm for finding a maximum clique with computational experiments,***Journal of Information Processing,*2017. (to appear)**Zach Abel, Brad Ballinger, Erik Demaine, Martin Demaine, Jeff Erickson, Adam Hesterberg, Hiro Ito, Irina Kostitsyna, Jayson Lynch, and Ryuhei Uehara, Unfolding and Dissection of Multiple Cubes, Tetrahedra, and Doubly Covered Squares,***Journal of Information Processing,*2017. (to appear)**ITO Hiro and Sergey BEREG, Transforming Graphs with the Same Graphic Sequence,***Journal of Information Processing,*2017. (to appear)

**INOUE Akiya, ITO Hiro, and YAMAMOTO Hisao, Hybrid control strategies for advanced network control and their intelligent decision support system,***Proceedings of the Fifth International Network Planning Symposium (NETWORKS'92)*, Kobe, Japan, May 17--22, 1992, pp. 37--42.**UEHARA Hideyuki, YOKOYAMA Mitsuo, and ITO Hiro, Access control schemes for slotted ALOHA system with an adaptive array,***Proceedings of the 1998 International Symposium on Information Theory and Its Application (ISITA'98)*, Mexico City, 14-16 Oct, 1998, pp. 142--145.**ASANO Tetsuo, ITO Hiro, KIMURA Souichi, and SHIMAZU Shigeaki, Repairing flaws in a picture based on a geometric representation of a digital image,***Proceedings of the 9th Annual International Symposium on Algorithms and Computation (ISAAC'98)*, LNCS, #1533, Springer, 1998, pp. 149--158.**ITO Hiro, UEHARA Hideyuki, and YOKOYAMA Mitsuo, The sum of chord lengths for convex polygons is a concave and increasing function,***Proceedings of the Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications*, Kyoto, March 17-19, 1999, pp. 79--81.**ITO Hiro, UEHARA Hideyuki, and YOKOYAMA Mitsuo, 2-dimension ham sandwich theorem for partitioning into three convex pieces,***Proceedings of the Japan Conference on Discrete and Computational Geometry (JCDCG'98)*, LNCS, #1763, Springer, 2000, pp. 129--157. -->[Online version (Springer)]**ITO Hiro, UEHARA Hideyuki, and YOKOYAMA Mitsuo, NP-completeness of Stage Illumination Problems,***Proceedings of the Japan Conference on Discrete and Computational Geometry (JCDCG'98)*, LNCS, #1763, Springer, 2000, 158--165.**UEHARA Hideyuki, YOKOYAMA Mitsuo, and ITO Hiro, Slot assignment scheme for integrated voice and data traffic in reservation-type packet radio networks,***Proceedings of the 11th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC2000)*, London, UK, 18-21 Sep., 2000, pp. 222--226.**ITO Hiro, UEHARA Hideyuki, and YOKOYAMA Mitsuo, Sum of edge lengths of a graph drawn on a convex polygon,***Proceedings of the Japan Conference on Discrete and Computational Geometry (JCDCG2000)*, LNCS, #2098, Springer, 2001, pp. 160--166. -->[Online version (Springer)]**ITO Hiro, ITO Motoyasu, ITATSU Yuichiro, UEHARA Hideyuki, and YOKOYAMA Mitsuo, Location problems based on node-connectivity and edge-connectivity between nodes and node-subsets,***Proceedings of the 11th Annual International Symposium on Algorithms and Computation (ISAAC'00)*, LNCS, #1969, Springer, 2000, pp. 338--349.**ITO Hiro, MAKINO Kazuhisa, ARATA Kouji, ITATSU Yuichiro, FUJISHIGE Satoru, Source location problem with edge-connectivity requirements in digraphs,***Proceedings of the 2nd Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications*, April 20-23, Budapest, Hungary, 2001, pp.`92--97.**UEJIMA Akihiro, ITO Hiro, UEHARA Hideyuki, and YOKOYAMA Mitsuo, Coloring problem with restrictions of adjacent colors expressed by cycles and bipartite graphs,***Proceedings of the 2nd Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications*, April 20-23, Budapest, Hungary, 2001, pp. 227--236.**ITO Hiro, IWAMA Kazuo, OKABE Yasuo, and YOSHIHIRO Takuya, Avoiding routing loops on the Internet,***Proceedings of the 9th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2002), Proceedings in Informatics*, Vol. 13, Carleton Scientific, 2002, pp. 197--210.**ITO Hiro, NAGAMOCHI Hiroshi, SUGIYAMA Yosuke, and FUJITA Masato, File transfer tree problems,***Proceedings of the 13th Annual International Symposium on Algorithms and Computation (ISAAC2002)*, LNCS, #2518, Springer, 2002, pp. 441--452.**ITO Hiro, NAGAMOCHI Hiroshi, Can a hypergraph cover every convex polygon?,***Proceedings of the 3rd Hungarian-Japanese Symposium 2003*, Sanjo Kaikan, The Univ. of Tokyo, Jan. 21--24, 2003, pp. 293--302.**ITO Hiro, IWAMA Kazuo, OKABE Yasuo, and YOSHIHIRO Takuya, Polynomial time computable backup tables for shortest path routing,***Proceedings of the 10th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2003), Proceedings in Informatics*, Vol. 17, Carleton Scientific, 2003, pp. 163--177.**ITO Hiro, NAGAMOCHI Hiroshi, Comparing hypergraphs by areas of hyperedges drawn on a convex polygon,***Proceedings of the Japan Conference on Discrete and Computational Geometry (JCDCG2002)*, LNCS, #2866, Springer, 2003, pp. 176--181. -->[Online version (Springer)]**UEJIMA Akihiro and ITO Hiro, Subdivision of the hierarchy of***H*-colorable graph classes by circulant graphs, Leo Liberti, Francesco Maffioli (Eds.),*Proceedings of CTW2004 Workshop on Graphs and Combinatorial Optimization*, May 31--June 2, Villa Vigoni, Menaggio, Como, Italy, 2004, pp. 232--236. (Electronic Notes in Discrete Mathematics, vol. 17, Oct., 2004, Elsevier, pp. 269--274.)**ITO Hiro, IWAMA Kazuo, and TAMURA Takeyuki, Imperfectness of data for STS-based physical mapping, J.- J. Levy, E. W. Mayr, and J. C. Mitchell (Eds.),***Exploring New Frontiers of Theoretical Informatics (Proceedings of TCS2004)*, KLUWER, 2004, pp. 279--292.**ITO Hiro, Three equivalent partial orders on graphs with real edge-weights drawn on a convex polygon,***Proceedings of the Japan Conference on Discrete and Computational Geometry (JCDCG2004)*, LNCS, #3742, Springer, 2005, pp. 123--130. -->[Online version (Springer)]**ITO Hiro, IWAMA Kazuo, and OSUMI Tsuyoshi, Linear-time enumeration of isolated cliques,***Proceedings of 13th Annual European Symposium on Algorithms (ESA2005)*, LNCS, #3669, Springer, 2005, pp. 119--130.-->[Online version (Springer)]**SUGIHARA Kenya and ITO Hiro, Maximum-cover source-location problem with object edge-connectivity three,***Proceedings of CTW2006 Workshop on Graphs and Combinatorial Optimization*, June 5--9, University of Duisburg-Essen, Germany, 2006, pp. 131--136. (Electronic Notes in Discrete Mathematics, vol. 25, Aug., 2006, Elsevier, pp. 165--171.)**AKIYAMA Jin, FUKUDA Hiroshi, ITO Hiro, and NAKAMURA Gisaku, Infinite series of generalized Gospher space filling curves,***Proceedings of the China-Japan Joint Conference on Discrete Geometry and Graph Theory (CJCDGCGT2005)*, LNCS, #4381, Springer, 2007, pp. 1--9.**ITO Hiro, Impossibility of transformation of vertex labeled simple graphs preserving the cut-size order,***Proceedings of the China-Japan Joint Conference on Discrete Geometry and Graph Theory (CJCDGCGT2005)*, LNCS, #4381, Springer, 2007, pp. 59--69.**ITO Hiro and MIYAGAWA Hiromitsu, Snaky is a winner with one handicap,***8th Hellenic European Conference on Computer Mathematics and its Applications (HERCMA 2007)*, Sept. 20--22, Athens Univ. of Economics and Business, Athens, Greece, 2007, pp. 25--26. -**>****[online proceedings], [complete strategy]****ITO Hiro, Mike PATERSON, and SUGIHARA Kenya, Multi-commodity source location problems and price of greed,***Proceedings of the Second Workshop on Algorithms and Computation (**WALCOM 2008)*, LNCS, # 4921, Springer, 2008, pp. 169--179.**Sergey BEREG and ITO Hiro, Transforming graphs with the same degree sequences,***Proceedings of Kyoto International Conference on Computational Geometry and Graph Theory --- in honor of Jin Akiyama and Vasek Chvatal on their 60th birthdays*, LNCS #4535, pp. 25--32, 2008.**YOSHIDA Yuichi and ITO Hiro, Property testing on***k*-vertex connectivity of graphs,*Proceedings of the 35th International Colloquium on Automata, Language and Programming (ICALP 2008) (1)*, LNCS, #5125, Springer, 2008, pp. 539--550.**YOSHIDA Yuichi, YAMAMOTO Masaki, and ITO Hiro, An improved constant-time approximation algorithm for maximum matchings,***Proceedings of the 41st ACM Symposium on Theory of Computing (STOC 2009)*, pp. 225--234*.***->[manuscript]****ITO Hiro and KADOSHITA Masakazu, Tractability and intractability of problems on unit disk graphs parameterized by domain area,***Proceedings of the 9th International Symposium on Operations Research and Its Applications (ISORA 2010)*, Lecture Notes in Operations Research, #12, pp. 120--127, WORLD PUBLISHING CORPORATION, 2010.**YOSHIDA Yuichi and ITO Hiro, Testing outerplanarity of bounded degree graphs,***Proceedings of the 14th Intl. Workshop on Randomization and Computation (RANDOM 2010)*, LNCS, #6302, 2010, pp. 642--655.**Jean CARDINAL, Sebastien COLETTE, ITO Hiro, Matias KORMAN, Stefan LANGERMAN, SAKIDANI Hikaru, Perouz TASLAKIAN, Cannibal animal games: a new variant of tic-tac-toe,***The 27th European Workshop on Computational Geometry (EuroCG 2011)*, Morschach, Switzerland, 2011/03/28--30, pp. 131--134.**ITO Hiro TANIGAWA Shin-ichi, YOSHIDA Yuichi, Testing algorithms for (***k ,l*)-sparsity and (*k ,l*)-edge-connected-orientability,*The 7th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications*, Kyoto University, 2011/05/31--06/03.**UMESATO Takuya, SAITOH Toshiki, UEHARA Ryuhei, and ITO Hiro, Complexity of the stamp folding problem,***Proceedings of The 5th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2011)*, LNCS, #6831, Springer, 2011, pp. 311--321.**Erik D. DEMAINE, Martin L. DEMAINE, Andrea HAWKSLEY, ITO Hiro, Po-Ru LOH, Shelly MANBER and Omari STEPHENS, Making polygons by simple folds and one straight cut,***Proceedings of the China-Japan Joint Conference on Computational Geometry, Graphs and Applications (CGGA 2010)*, LNCS, Springer, # 7033, pp. 27--43, 2011.**Jean CARDINAL, ITO Hiro, Matias KORMAN, Stefan LANGERMAN, Helly numbers of polyominoes,***The 23rd Canadian Conference on Computational Geometry (CCCG'11)*, Toronto, Canada, 2011/08/10--12, pp. 443--448.**ITO Hiro and TAKATA Satoshi, PSPACE-completeness of the weighted poset game,***Proceedings of the 10th International Symposium on Operations Research and Its Applications (ISORA 2011)*, Lecture Notes in Operations Research, #14, pp. 89--93, WORLD PUBLISHING CORPORATION, 2011/08/28--31.**Wolfgang BEIN, HATTA Naoki, Nelson HERNANDEZ-CONS, ITO Hiro, KASAHARA Shoji, and KAWAHARA Jun, An online algorithm optimally self-tuning to congestion for power management problems,***Proceedings of the 9th Workshop on Approximation and Online Algorithms (WAOA 2011)*, LNCS, Springer, #7164, pp. 35--48, 2012.**ITO Hiro, KIYOSHIMA Susumu, YOSHIDA Yuichi, Constant-time approximation algorithms for the knapsack problem,***Proc. of The 9th Annual Conference on Theory and Applications of Models of Computation (TAMC 2012)*, LNCS, Springer, # 7287, pp. 131--142, 2012.**ITO Hiro, Stefan LANGERMAN, YOSHIDA Yuichi, Algorithms and complexity of generalized river crossing problems,***Proc. of The 6th International Conference on Fun with Algorithms (FUN 2012)*, LNCS, Springer, # 7288, pp. 235--244, 2012.**ITO Hiro TANIGAWA Shin-ichi, YOSHIDA Yuichi, Constant-time algorithms for sparsity matroids,***Proc. of T**he 39th International Colloquium on Automata, Language and Programming (ICALP 2012)**(1)*, LNCS, Springer, # 7391, pp. 498--509, 2012.**KUSUMOTO Mitsuru, YOSHIDA Yuichi, and ITO Hiro, Constant-time approximation algorithms for the optimum branching problem on sparse graphs,***Proceedings of the Workshop on Computational Complexity Analysis and Algorithm Design for Combinatorial Optimization Problems*, Proceedings of The Third International Conference on Networking and Computing (ICNC'12), pp. 407--413, 2012.**ITO Hiro, How to generalize janken --- rock-paper-scissors-king-flea, Proceedings of TJJCCGG 2012, LNCS #8296, pp. 85--94, 2013.****Zachary ABEL, Erik D. DEMAINE, Martin DEMAINE, ITO Hiro, Jack SNOEYINK and UEHARA Ryuhei, Bumpy Pyramid Folding,***The 26th Canadian Conference on Computational Geometry (CCCG 2014)*, Halifax, Nova Scotia, Canada, Aug. 11-13, 2014.**Erik D. DEMAINE, David EPPSTEIN, Adam HESTERBERG, ITO Hiro, Anna LUBIW, UEHARA Ryuhei, UNO Yushi, Folding a Paper Strip to Minimizing Thickness,***Proceeding of Workshop on Algorithms and Computation 2015 (WALCOM 2015), 2015,*pp. 113--124.**ITO Hiro, NAGAO Atsuki, and PARK Teagun, Generalized shogi and chess are constant-time testable,***Proceedings of the 12th International Symposium on Operations Research & Its Applications (ISORA 2015)*, IET Digital Library, 2015, pp. 1--6.**ITO Hiro and SEKI Shinnosuke, Computational complexity of inverse word search problem,***Proceedings of the 12th International Symposium on Operations Research & Its Applications (ISORA 2015)*, IET Digital Library, 2015, pp. 41--44.**ITO Hiro and SHIONO Yoshinao, Number of ties and undefeated signs on a generalized janken,***Proceedings of the 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCG^2 2015)*, LNCS, Springer, 2016. (to appear)**Kyle Burke, Erik D. Demaine, Harrison Gregg, Robert A. Hearn, Adam Hesterberg, Michael Hoffman, Hiro Ito, Irina Kostitsyna, Jody Leonard, Maarten Loffler, Christiane Schmidt, Ryuhei Uehara, Yushi Uno and Aaron Williams, Single-Player and Two-Player Buttons & Scissors Games,***Proceedings of the 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCG^2 2015)*, LNCS, Springer, 2016. (to appear)**Etsuji Tomita, Kohei Yoshida, Takuro Hatta, Atsuki Nagao, Hiro Ito and Mitsuo Wakatsuki, A Much Faster Algorithm for Finding a Maximum Clique,***Proceedings of the 10th International Frontiers of Algorithmics Workshop (FAW2016)*, LNCS, #9711, Springer, 2016, pp. 215--226.**ITO Hiro and UEDA Takahiro,****How to solve the cake-cutting problem in sublinear time**,*Proceedings of the 8th International Conference on Fun with Algorithms (FUN2016)*, LIPICS, Vol. 49 (ISBN 978-3-95977-005-7), 2016, pp. 21:1--21:15, DOI: 10.4230/LIPIcs.FUN.2016.21.->[Download from DROPS]**Hiro Ito, Every property is testable on a natural class of scale-free multigraphs,***Proceedings of the 24th European Symposium of Algorithms (ESA 2016)*,**LIPICS, Vol. 57, 2016. pp. 51:1--51:12.****Hiro Ito, Constant-time algorithms for complex networks,***Proceedings of the Asian-Pacific World Congress on Computer Science 2016 (APWConCS 2016)*, IEEE Computer Society, 2016, pp. 10--17, DOI 10.1109/APWC.on.CSE.2016.12.

**Hiro Ito, Every property is testable on a natural class of scale-free multigraphs,***arXiv*:1504.00766, Cornell University, April. 6, 2015.**Hiro Ito and Takahiro Ueda, How to solve the cake-cutting problem in sublinear time,***arXiv*:1504.00774, Cornell University, April. 6, 2015.

This is available for reading pdf-files.

## Return to the publication page (Japanese version)

## Return to the Home (English version)