Research on efficient algorithms for graph structures with geometric properties

2013 Fiscal Year Final Research Report

• Project/Area Number: 23500013
• Research Category: Grant-in-Aid for Scientific Research (C)
• Allocation Type: Multi-year Fund
• Section: 一般
• Research Field: Fundamental theory of informatics
• Research Institution: Japan Advanced Institute of Science and Technology
• Principal Investigator: UEHARA Ryuhei 北陸先端科学技術大学院大学, 情報科学研究科, 教授 (00256471)
• Project Period (FY): 2011 – 2013
• Keywords: アルゴリズム / 計算モデル / グラフ構造 / 計算折り紙

Research Abstract

In this research, I investigate efficient algorithms that solve many problems on geometric graphs. From April 2011 to March 2014, I publish three books (one own book and two translations), 21 journal papers, and 24 presentations at refereed international conferences (two presentations are invited). Especially, I investigate on "computational origami", which is a topic about geometric folding. This area is one of frontiers that have many applications, however, it is not well investigated even in Japan. I propose several remarkable results in this area.

Research Products

• [Journal Article] UNO is hard, even for a single player (2014)
  • Author(s): E. D. Demaine, M. L. Demaine, N. J. A. Harvey, R. Uehara, T. Uno, Y. Uno
  • Journal Title: Theoretical Computer Science Volume: Vol.521 Pages: 51-61
  • DOI: 10.1016/j.tcs.2013.11.023
  • Peer Reviewed
• [Journal Article] Common Developments of Three Incongruent Orthogonal Boxes (2013)
  • Author(s): T. Shirakawa and R. Uehara
  • Journal Title: International Journal of Computational Geometry and Applications Volume: Vol.23, No.1 Pages: 65-71
  • Peer Reviewed
• [Journal Article] Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression (2013)
  • Author(s): T. Uno, R. Uehara, and S.-I. Nakano
  • Journal Title: Discrete Mathematics, Algorithms and Applications Volume: Vol.5, No.2 Pages: 1360001-1360014
  • Peer Reviewed
• [Journal Article] Tractabilities and Intractabilities on Geometric Intersection Graphs (2013)
  • Author(s): R. Uehara
  • Journal Title: Algorithms Volume: Vol.6, No.1 Pages: 60-83
  • Peer Reviewed
• [Journal Article] Efficient algorithms for a simple network design problem (2013)
  • Author(s): S.-I. Nakano, R. Uehara, and T. Uno
  • Journal Title: Networks Volume: Vol.62, No.2 Pages: 95-104
  • Peer Reviewed
• [Journal Article] Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs (2013)
  • Author(s): M. Kiyomi, T. Saitoh, and R. Uehara
  • Journal Title: IEICE Trans. Inf. & Syst Volume: Vol.E96-D, No.3 Pages: 426-432
  • Peer Reviewed
• [Journal Article] Coverage with k-Transmitters in the Presence of Obstacles (2013)
  • Author(s): B. Ballinger, N. Benbernou, P. Bose, M. Damian, E. D. Demaine, V. Dujmović, R. Flatland, F. Hurtado, J. Iacono, A. Lubiw, P. Morin, V. Sacristán, D. Souvaine, and R. Uehara
  • Journal Title: Journal of Combinatorial Optimization Volume: Vol.25(2) Pages: 208-233
  • DOI: 10.1007/s10878-012-9475-x
  • Peer Reviewed
• [Journal Article] Route-Enabling Graph Orientation Problems (2013)
  • Author(s): T. Ito, Y. Miyamoto, H. Ono, H. Tamaki, and R. Uehara
  • Journal Title: Algorithmica Volume: Vol.65 Pages: 317-338
  • DOI: 10.1007/s00453-011-9589-z
  • Peer Reviewed
• [Journal Article] Complexity of the stamp folding problem (2012)
  • Author(s): T. Umesato, T. Saitoh, R. Uehara, H. Ito, and Y. Okamoto
  • Journal Title: Theoretical Computer Science Volume: Vol.497 Pages: 13-19
  • DOI: 10.1016/j.tcs.2012.08.006
  • Peer Reviewed
• [Journal Article] Bipartite Permutation Graphs are Reconstructible, Discrete Mathematics (2012)
  • Author(s): M. Kiyomi, T. Saitoh, and R. Uehara
  • Journal Title: Algorithms and Applications Volume: Vol.4, No.3 Pages: 1250039:1-14
  • DOI: 10.1142/S1793830912500395
  • Peer Reviewed
• [Journal Article] Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks (2012)
  • Author(s): T. Asano, J. Jansson, K. Sadakane, R. Uehara, and G. Valiente
  • Journal Title: Information Sciences Volume: Vol.197 Pages: 77-90
  • DOI: 10.1016/j.ins.2012.01.038
  • Peer Reviewed
• [Journal Article] On Covering of Any Point Configuration by Disjoint Unit Disks (2012)
  • Author(s): Y. Okayama, M. Kiyomi, and R. Uehara
  • Journal Title: Geombinatorics Volume: vol.XXI(1) Pages: 14-23
  • Peer Reviewed
• [Journal Article] NP-completeness of generalized Kaboozle (2012)
  • Author(s): T. Asano, E. D. Demaine, M. L. Demaine, and R. Uehara
  • Journal Title: Journal of Information Processing Volume: Vol.20, No.3 Pages: 713-718
  • Peer Reviewed
• [Journal Article] On bipartite powers of bigraphs (2012)
  • Author(s): Y. Okamoto, Y. Otachi, and R. Uehara
  • Journal Title: Discrete Mathematics and Theoretical Computer Science Volume: Vol.14, No.2 Pages: 11-20
  • Peer Reviewed
• [Journal Article] Ghost Chimneys (2012)
  • Author(s): D. Charlton, E. D. Demaine, M. L. Demaine, V. Dujmović, P. Morin, and R. Uehara
  • Journal Title: International Journal of Computational Geometry and Applications Volume: Vol.22, No.3 Pages: 207-214
  • DOI: 10.1142/S0218195912500057
  • Peer Reviewed
• [Journal Article] Any Monotone Function is Realized by Interlocked Polygons (2012)
  • Author(s): E. D. Demaine, M. L. Demaine, and R. Uehara
  • Journal Title: Algorithms Volume: Vol.5(1) Pages: 148-157
  • DOI: 10.3390/a5010148
  • Peer Reviewed
• [Journal Article] Random Generation and Enumeration of Bipartite Permutation Graphs (2012)
  • Author(s): T. Saitoh, Y. Otachi, K. Yamanaka, and R. Uehara
  • Journal Title: Journal of Discrete Algorithms Volume: Vol.10 Pages: 84-97
  • DOI: 10.1016/j.jda.2011.11.001
  • Peer Reviewed
• [Journal Article] Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem (2011)
  • Author(s): Y. Okamoto, Y. Otachi, R. Uehara, and T. Uno
  • Journal Title: Journal of Graph Algorithms and Applications Volume: Vol.15, No.6 Pages: 727-751
  • Peer Reviewed
• [Journal Article] Voronoi game on graphs and its complexity (2011)
  • Author(s): S. Teramoto, E. D. Demaine, and R. Uehara
  • Journal Title: Journal of Graph Algorithms and Applications Volume: Vol.15, No.4 Pages: 485-501
  • Peer Reviewed
• [Journal Article] Voronoi Game on a Path, IEICE Trans (2011)
  • Author(s): M. Kiyomi, T. Saitoh, and R. Uehara
  • Journal Title: Inf. & Syst Volume: Vol.E94-D Pages: 1185-1189
  • DOI: 10.1587/transinf.E94.D.1185
  • Peer Reviewed
• [Journal Article] Algorithmic Folding Complexity (2011)
  • Author(s): J. Cardinal, E. D. Demaine, M. L. Demaine, S. Imahori, T. Ito, M. Kiyomi, S. Langerman, R. Uehara, and T. Uno
  • Journal Title: Graphs and Combinatorics Volume: Vol.27 Pages: 341-351
  • DOI: 10.1007/s00373-011-1019-0
  • Peer Reviewed
• [Presentation] Variations on Instant Insanity (2013)
  • Author(s): E. D. Demaine, M. L. Demaine, S. Eisenstat, T. D. Morgan, and R. Uehara
  • Organizer: Conference on Space Efficient Data Structures, Streams and Algorithms
  • Place of Presentation: Waterloo, Canada
  • Year and Date: 20130815-16
• [Presentation] Computational complexity and an integer programming model of Shakashaka (2013)
  • Author(s): E. D. Demaine, Y. Okamoto, R. Uehara and Y. Uno
  • Organizer: The 25th Canadian Conference on Computational Geometry (CCCG 2013)
  • Place of Presentation: Waterloo, Canada
  • Year and Date: 20130808-10
• [Presentation] Zipper Unfoldability of Domes and Prismoids (2013)
  • Author(s): E. D. Demaine, M. Demaine and R. Uehara
  • Organizer: The 25th Canadian Conference on Computational Geometry (CCCG 2013)
  • Place of Presentation: Waterloo, Canada
  • Year and Date: 20130808-10
• [Presentation] Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane (2013)
  • Author(s): O. Aichholzer, J. Cardinal, T. Hackl, F. Hurtado, M. Korman, A. Pilz, R. Silveira, R. Uehara, B. Vogtenhuber and E. Welzl
  • Organizer: The 25th Canadian Conference on Computational Geometry (CCCG 2013)
  • Place of Presentation: Waterloo, Canada
  • Year and Date: 20130808-10
• [Presentation] The Graph Isomorphism Problem on Geometric graphs (2013)
  • Author(s): R. Uehara
  • Organizer: The 2nd Pacific Rim Mathematical Association (PRIMA)
  • Place of Presentation: Shanghai, China
  • Year and Date: 20130624-28
  • Invited
• [Presentation] On generation of graphs with geometric representations (2013)
  • Author(s): R. Uehara
  • Organizer: 4th Biennial Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM), in Gray codes and universal cycles Minisymposia
  • Place of Presentation: Newfoundland, Canada
  • Year and Date: 20130610-13
• [Presentation] The graph isomorphism problem on graphs with geometric represenations (2013)
  • Author(s): R. Uehara
  • Organizer: 4th Biennial Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM), in Geometric Representation of Graphs Minisymposia
  • Place of Presentation: Newfoundland, Canada
  • Year and Date: 20130610-13
• [Presentation] Computational Complexity of Piano-Hinged Dissections (2013)
  • Author(s): Z. Abel, E. D. Demaine, M. L. Demaine, T. Horiyama and R. Uehara
  • Organizer: The 29th European Workshop on Computational Geometry (EuroCG 2013)
  • Place of Presentation: Braunschweig, Germany
  • Year and Date: 20130317-20
• [Presentation] Base location problems for base-monotone regions (2013)
  • Author(s): J. Chun, T. Horiyama, T. Ito, N. Kaothanthong, H. Ono, Y.chi, T. Tokuyama, R. Uehara and T. Uno
  • Organizer: 7th International Workshop on Algorithms and Computation (WALCOM 2013)
  • Place of Presentation: Kharagpur, India
  • Year and Date: 20130214-16
• [Presentation] A 4.31-Approximation for the Geometric Unique CoV.ge Problem on Unit Disks (2012)
  • Author(s): T. Ito, S.-I. Nakano, Y. Okamoto, Y.chi, R. Uehara, T. Uno, and Y. Uno
  • Organizer: 23rd Annual International Symposium on Algorithms and Computation (ISAAC 2012)
  • Place of Presentation: Taipei, Taiwan
  • Year and Date: 20121219-21
• [Presentation] Algorithms for Computing Optimal Image Segmentation using Quadtree Decomposition (2012)
  • Author(s): T. Horiyama, T. Ito, N. Kaothanthong, H. Ono, Y.chi, T. Tokuyama, R. Uehara, and T. Uno
  • Organizer: Thailand-Japan Joint Conference on Computational Geometry and Graphs (TJJCCGG 2012)
  • Place of Presentation: Bangkok, Thailand
  • Year and Date: 20121206-08
• [Presentation] On Complexity of Flooding Games on Graphs with Interval Representations (2012)
  • Author(s): H. Fukui, R. Uehara, T. Uno and Y. Uno
  • Organizer: Thailand-Japan Joint Conference on Computational Geometry and Graphs (TJJCCGG 2012)
  • Place of Presentation: Bangkok, Thailand
  • Year and Date: 20121206-08
• [Presentation] Common Developments of Three Different Orthogonal Boxes (2012)
  • Author(s): T. Shirakawa and R. Uehara
  • Organizer: The 24th Canadian Conference on Computational Geometry (CCCG 2012)
  • Place of Presentation: PEI, Canada
  • Year and Date: 20120808-10
• [Presentation] Covering points with disjoint unit disks (2012)
  • Author(s): G. Aloupis, R. Hearn, H. Iwasawa and R. Uehara
  • Organizer: The 24th Canadian Conference on Computational Geometry (CCCG 2012)
  • Place of Presentation: PEI, Canada
  • Year and Date: 20120808-10
• [Presentation] Packing Trominoes is NP-Complete, #P-hard and ASP-Complete (2012)
  • Author(s): T. Horiyama, T. Ito, K. Nakatsuka, A. Suzuki and R. Uehara
  • Organizer: The 24th Canadian Conference on Computational Geometry (CCCG 2012)
  • Place of Presentation: PEI, Canada
  • Year and Date: 20120808-10
• [Presentation] A Polynomial-Time Approximation Scheme for the Geometric Unique CoV.ge Problem on Unit Squares (2012)
  • Author(s): T. Ito, S.-I. Nakano, Y. Okamoto, Y.chi, R. Uehara, T. Uno and Y. Uno
  • Organizer: 13th Scandinavian Symposium and Workshops on Algorithm Theory
  • Place of Presentation: Helsinki, Finland
  • Year and Date: 20120703-05
• [Presentation] Bounding the number of reduced trees, cographs, and series-parallel graphs by compression (2012)
  • Author(s): S.-I. Nakano, R. Uehara and T. Uno
  • Organizer: Workshop on Algorithms and Computation (WALCOM 2012)
  • Place of Presentation: Dhaka, Bangladesh
  • Year and Date: 20120215-17
• [Presentation] On Common Unfolding of a Regular Tetrahedron and a Cube (2011)
  • Author(s): T. Shirakawa, T. Horiyama, and R. Uehara
  • Organizer: Japan Conference on Discrete and Computational Geometry (JCDCG 2011)
  • Place of Presentation: Tokyo
  • Year and Date: 20111128-29
• [Presentation] On covering of any point configuration by disjoint unit disks (2011)
  • Author(s): Y. Okayama, M. Kiyomi and R. Uehara
  • Organizer: The 23rd Canadian Conference on Computational Geometry (CCCG' 11)
  • Place of Presentation: Toronto, Canada
  • Year and Date: 20110810-12
• [Presentation] Common Developments of SeV.l Different Orthogonal Boxes (2011)
  • Author(s): Z. Abel, E. Demaine, M. Demaine, H. Matsui, G. Rote and R. Uehara
  • Organizer: The 23rd Canadian Conference on Computational Geometry (CCCG' 11)
  • Place of Presentation: Toronto, Canada
  • Year and Date: 20110810-12
• [Presentation] Complexity of the stamp folding problem (2011)
  • Author(s): T. Umesato, T. Saitoh, R. Uehara, and H. Ito
  • Organizer: 5th Annual International Conference on Combinatorial Optimization and Applications (COCOA '11), Lecture Notes in Computer Science
  • Place of Presentation: Zhangjiajie, China
  • Year and Date: 20110804-06
• [Presentation] The Complexity of Free Flood Filling Game (2011)
  • Author(s): H. Fukuki, A. Nakanishi, R. Uehara, T. Uno, and Y. Uno
  • Organizer: 14th Korea-Japan Joint Workshop on Algorithms and Computation (WAAC 2011)
  • Place of Presentation: Busan, Korea
  • Year and Date: 20110708-09
• [Presentation] On Common Developments of SeV.l Different Polyhedra (2011)
  • Author(s): R. Uehara
  • Organizer: 14th Korea-Japan Joint Workshop on Algorithms and Computation (WAAC 2011)
  • Place of Presentation: Busan, Korea
  • Year and Date: 20110708-09
• [Presentation] Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem (2011)
  • Author(s): Y. Okamoto, Y.chi, R. Uehara and T. Uno
  • Organizer: 8th Annual Conference on Theory and Applications of Medels of Computation (TAMC 2011)
  • Place of Presentation: Tokyo
  • Year and Date: 20110523-25
• [Book] はじめてのアルゴリズム (2013)
  • Author(s): 上原隆平 著
  • Total Pages: 183
  • Publisher: 近代科学社
• [Book] 折り紙のすうり (2012)
  • Author(s): ジョセフ・オルーク 著, 上原隆平 訳
  • Total Pages: 235
  • Publisher: 近代科学社
• [Book] ゲームとパズルの計算量 (2011)
  • Author(s): ロバート・A・ハーン, エリック・D・ドメイン 著, 上原隆平 訳
  • Total Pages: 279
  • Publisher: 近代科学社
• [Remarks] ホームページ
  • URL: http://www.jaist.ac.jp/~uehara/