• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

Research on efficient algorithms for graph structures with geometric properties

Research Project

Project/Area Number 23500013
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeMulti-year Fund
Section一般
Research Field Fundamental theory of informatics
Research InstitutionJapan Advanced Institute of Science and Technology

Principal Investigator

UEHARA Ryuhei  北陸先端科学技術大学院大学, 情報科学研究科, 教授 (00256471)

Project Period (FY) 2011 – 2013
Project Status Completed (Fiscal Year 2013)
Budget Amount *help
¥5,200,000 (Direct Cost: ¥4,000,000、Indirect Cost: ¥1,200,000)
Fiscal Year 2013: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2012: ¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000)
Fiscal Year 2011: ¥2,210,000 (Direct Cost: ¥1,700,000、Indirect Cost: ¥510,000)
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.

Report

(4 results)
  • 2013 Annual Research Report   Final Research Report ( PDF )
  • 2012 Research-status Report
  • 2011 Research-status Report
  • Research Products

    (91 results)

All 2014 2013 2012 2011 Other

All Journal Article (32 results) (of which Peer Reviewed: 32 results) Presentation (49 results) (of which Invited: 2 results) Book (7 results) Remarks (3 results)

  • [Journal Article] UNO is hard, even for a single player2014

    • 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

    • NAID

      120003184351

    • Related Report
      2013 Annual Research Report 2013 Final Research Report
    • Peer Reviewed
  • [Journal Article] Common Developments of Three Incongruent Orthogonal Boxes2013

    • Author(s)
      T. Shirakawa and R. Uehara
    • Journal Title

      International Journal of Computational Geometry and Applications

      Volume: Vol.23, No.1 Pages: 65-71

    • NAID

      120005323060

    • Related Report
      2013 Final Research Report
    • Peer Reviewed
  • [Journal Article] Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression2013

    • 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

    • NAID

      120005367953

    • Related Report
      2013 Final Research Report
    • Peer Reviewed
  • [Journal Article] Tractabilities and Intractabilities on Geometric Intersection Graphs2013

    • Author(s)
      R. Uehara
    • Journal Title

      Algorithms

      Volume: Vol.6, No.1 Pages: 60-83

    • NAID

      120005300535

    • Related Report
      2013 Final Research Report
    • Peer Reviewed
  • [Journal Article] Efficient algorithms for a simple network design problem2013

    • Author(s)
      S.-I. Nakano, R. Uehara, and T. Uno
    • Journal Title

      Networks

      Volume: Vol.62, No.2 Pages: 95-104

    • Related Report
      2013 Final Research Report
    • Peer Reviewed
  • [Journal Article] Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs2013

    • Author(s)
      M. Kiyomi, T. Saitoh, and R. Uehara
    • Journal Title

      IEICE Trans. Inf. & Syst

      Volume: Vol.E96-D, No.3 Pages: 426-432

    • NAID

      10031167427

    • Related Report
      2013 Final Research Report
    • Peer Reviewed
  • [Journal Article] Coverage with k-Transmitters in the Presence of Obstacles2013

    • 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) Issue: 2 Pages: 208-233

    • DOI

      10.1007/s10878-012-9475-x

    • NAID

      120005850318

    • Related Report
      2013 Final Research Report 2012 Research-status Report 2011 Research-status Report
    • Peer Reviewed
  • [Journal Article] Route-Enabling Graph Orientation Problems2013

    • Author(s)
      Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, Ryuhei Uehara
    • Journal Title

      Algorithmica

      Volume: 65(2) Issue: 2 Pages: 317-338

    • DOI

      10.1007/s00453-011-9589-z

    • NAID

      120005850325

    • Related Report
      2013 Final Research Report 2012 Research-status Report 2011 Research-status Report
    • Peer Reviewed
  • [Journal Article] The complexity of the stamp folding problem2013

    • Author(s)
      Takuya Umesato, Toshiki Saitoh, Ryuhei Uehara, Hiro Ito, and Yoshio Okamoto
    • Journal Title

      Theoretical Computer Science

      Volume: -- Pages: 13-19

    • DOI

      10.1016/j.tcs.2012.08.006

    • Related Report
      2013 Final Research Report 2012 Research-status Report
    • Peer Reviewed
  • [Journal Article] Common Developments of Three Incongruent Orthogonal Boxes2013

    • Author(s)
      Toshihiro Shirakawa and Ryuhei Uehara
    • Journal Title

      International Journal of Computational Geometry and Applications

      Volume: 23(1) Pages: 65-71

    • NAID

      120005323060

    • Related Report
      2013 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression2013

    • Author(s)
      Takeaki Uno, Ryuhei Uehara, and Shin-ichi Nakano
    • Journal Title

      Discrete Mathematics, Algorithms and Applications

      Volume: 5(2) Pages: 1-14

    • NAID

      120005367953

    • Related Report
      2013 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Tractabilities and Intractabilities on Geometric Intersection Graphs2013

    • Author(s)
      Ryuhei Uehara
    • Journal Title

      Algorithms

      Volume: 6(1) Pages: 60-83

    • NAID

      120005300535

    • Related Report
      2013 Annual Research Report 2012 Research-status Report
    • Peer Reviewed
  • [Journal Article] Efficient algorithms for a simple network design problem2013

    • Author(s)
      Shin-ichi Nakano, Ryuhei Uehara, and Takeaki Uno
    • Journal Title

      Networks

      Volume: 62(2) Pages: 95-104

    • Related Report
      2013 Annual Research Report 2012 Research-status Report
    • Peer Reviewed
  • [Journal Article] Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs2013

    • Author(s)
      Masashi Kiyomi, Toshiki Saitoh, and Ryuhei Uehara
    • Journal Title

      IEICE Trans. Inf. & Syst.

      Volume: Vol. E96-D, No.3 Pages: 426-432

    • NAID

      10031167427

    • Related Report
      2013 Annual Research Report 2012 Research-status Report
    • Peer Reviewed
  • [Journal Article] Bipartite Permutation Graphs are Reconstructible2012

    • Author(s)
      Masashi Kiyomi, Toshiki Saitoh, and Ryuhei Uehara
    • Journal Title

      Discrete Mathematics, Algorithms and Applications

      Volume: 4(3) Issue: 03 Pages: 1-14

    • DOI

      10.1142/s1793830912500395

    • NAID

      120005316240

    • Related Report
      2013 Final Research Report 2012 Research-status Report
    • Peer Reviewed
  • [Journal Article] Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks2012

    • Author(s)
      Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente
    • Journal Title

      Information Sciences

      Volume: 197 Pages: 77-90

    • DOI

      10.1016/j.ins.2012.01.038

    • NAID

      120003184350

    • Related Report
      2013 Final Research Report 2012 Research-status Report 2011 Research-status Report
    • Peer Reviewed
  • [Journal Article] On Covering of Any Point Configuration by Disjoint Unit Disks2012

    • Author(s)
      Y. Okayama, M. Kiyomi, and R. Uehara
    • Journal Title

      Geombinatorics

      Volume: vol.XXI(1) Pages: 14-23

    • NAID

      120006675019

    • Related Report
      2013 Final Research Report
    • Peer Reviewed
  • [Journal Article] NP-completeness of generalized Kaboozle2012

    • 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

    • NAID

      130002073623

    • Related Report
      2013 Final Research Report
    • Peer Reviewed
  • [Journal Article] On bipartite powers of bigraphs2012

    • 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

    • NAID

      120005147908

    • Related Report
      2013 Final Research Report
    • Peer Reviewed
  • [Journal Article] Ghost Chimneys2012

    • 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 Issue: 03 Pages: 207-214

    • DOI

      10.1142/s0218195912500057

    • NAID

      120005147907

    • Related Report
      2013 Final Research Report 2012 Research-status Report
    • Peer Reviewed
  • [Journal Article] Any Monotone Function is Realized by Interlocked Polygons2012

    • Author(s)
      E. D. Demaine, M. L. Demaine, and R. Uehara
    • Journal Title

      Algorithms

      Volume: Vol.5(1) Issue: 1 Pages: 148-157

    • DOI

      10.3390/a5010148

    • NAID

      120004288201

    • Related Report
      2013 Final Research Report 2011 Research-status Report
    • Peer Reviewed
  • [Journal Article] Random Generation and Enumeration of Bipartite Permutation Graphs2012

    • 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

    • NAID

      120004680901

    • Related Report
      2013 Final Research Report 2011 Research-status Report
    • Peer Reviewed
  • [Journal Article] On bipartite powers of bigraphs2012

    • Author(s)
      Yoshio Okamoto, Yota Otachi, and Ryuhei Uehara
    • Journal Title

      Discrete Mathematics and Theoretical Computer Science

      Volume: 14(2) Pages: 11-20

    • NAID

      120005147908

    • Related Report
      2012 Research-status Report
    • Peer Reviewed
  • [Journal Article] On Covering of Any Point Configuration by Disjoint Unit Disks2012

    • Author(s)
      Yosuke Okayama, Masashi Kiyomi, and Ryuhei Uehara
    • Journal Title

      Geombinatorics

      Volume: XXI(1) Pages: 14-23

    • NAID

      120006675019

    • Related Report
      2012 Research-status Report
    • Peer Reviewed
  • [Journal Article] NP-completeness of generalized Kaboozle2012

    • Author(s)
      Tetsuo Asano, Erik D. Demaine, Martin L. Demaine, and Ryuhei Uehara
    • Journal Title

      Journal of Information Processing

      Volume: 20(3) Pages: 713-718

    • NAID

      130002073623

    • Related Report
      2012 Research-status Report 2011 Research-status Report
    • Peer Reviewed
  • [Journal Article] Bipartite Permutation Graphs are Reconstructible2012

    • Author(s)
      Masashi Kiyomi, Toshiki Saitoh, and Ryuhei Uehara
    • Journal Title

      Discrete Mathematics, Algorithms, and Applications

      Volume: accepted

    • NAID

      120005316240

    • Related Report
      2011 Research-status Report
    • Peer Reviewed
  • [Journal Article] Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem2011

    • 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

    • NAID

      120003752202

    • Related Report
      2013 Final Research Report
    • Peer Reviewed
  • [Journal Article] Voronoi game on graphs and its complexity2011

    • 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

    • NAID

      110004075873

    • Related Report
      2013 Final Research Report
    • Peer Reviewed
  • [Journal Article] Voronoi Game on a Path2011

    • Author(s)
      M. Kiyomi, T. Saitoh, and R. Uehara
    • Journal Title

      IEICE Transactions on Information and Systems

      Volume: E94-D Issue: 6 Pages: 1185-1189

    • DOI

      10.1587/transinf.E94.D.1185

    • NAID

      10029804942

    • ISSN
      0916-8532, 1745-1361
    • Related Report
      2013 Final Research Report 2011 Research-status Report
    • Peer Reviewed
  • [Journal Article] Algorithmic Folding Complexity2011

    • 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 Issue: 3 Pages: 341-351

    • DOI

      10.1007/s00373-011-1019-0

    • Related Report
      2013 Final Research Report
    • Peer Reviewed
  • [Journal Article] Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem2011

    • Author(s)
      Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, and Takeaki Uno
    • Journal Title

      Journal of Graph Algorithms and Applications

      Volume: 15(6) Pages: 727-751

    • NAID

      120003752202

    • Related Report
      2011 Research-status Report
    • Peer Reviewed
  • [Journal Article] Voronoi game on graphs and its complexity2011

    • Author(s)
      Sachio Teramoto, Erik D. Demaine, and Ryuhei Uehara
    • Journal Title

      Journal of Graph Algorithms and Applications

      Volume: 15(4) Pages: 485-501

    • NAID

      110004075873

    • Related Report
      2011 Research-status Report
    • Peer Reviewed
  • [Presentation] Sankaku-Tori: An Old Western-Japanese Game Played on a Point Set2014

    • Author(s)
      Takashi Horiyama, Masashi Kiyomi, Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno, Yushi Uno and Yukiko Yamauchi
    • Organizer
      International Conference on FUN WITH ALGORITHMS
    • Place of Presentation
      Sicily, Italy
    • Related Report
      2013 Annual Research Report
  • [Presentation] On the Parameterized Complexity for Token Jumping on Graphs2014

    • Author(s)
      Takehiro Ito, Marcin Kaminski, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, and Katsuhisa Yamanaka
    • Organizer
      The 11th Annual Conference on Theory and Applications of Models of Computation
    • Place of Presentation
      Chennai, India
    • Related Report
      2013 Annual Research Report
  • [Presentation] Intersection Dimension of Bipartite Graphs2014

    • Author(s)
      Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, and Ryuhei Uehara
    • Organizer
      The 11th Annual Conference on Theory and Applications of Models of Computation
    • Place of Presentation
      Chennai, India
    • Related Report
      2013 Annual Research Report
  • [Presentation] Polynomial-Time Algorithms for Subgraph Isomorphism in Small Graph Classes of Perfect Graphs2014

    • Author(s)
      Matsuo Konagaya, Yota Otachi, and Ryuhei Uehara
    • Organizer
      The 11th Annual Conference on Theory and Applications of Models of Computation
    • Place of Presentation
      Chennai, India
    • Related Report
      2013 Annual Research Report
  • [Presentation] Variations on Instant Insanity2013

    • 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
    • Related Report
      2013 Annual Research Report 2013 Final Research Report
  • [Presentation] Computational complexity and an integer programming model of Shakashaka2013

    • 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
    • Related Report
      2013 Final Research Report
  • [Presentation] Zipper Unfoldability of Domes and Prismoids2013

    • 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
    • Related Report
      2013 Final Research Report
  • [Presentation] Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane2013

    • 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
    • Related Report
      2013 Final Research Report
  • [Presentation] The Graph Isomorphism Problem on Geometric graphs2013

    • Author(s)
      R. Uehara
    • Organizer
      The 2nd Pacific Rim Mathematical Association (PRIMA)
    • Place of Presentation
      Shanghai, China
    • Related Report
      2013 Final Research Report
    • Invited
  • [Presentation] On generation of graphs with geometric representations2013

    • 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
    • Related Report
      2013 Final Research Report
  • [Presentation] The graph isomorphism problem on graphs with geometric represenations2013

    • 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
    • Related Report
      2013 Final Research Report
  • [Presentation] Computational Complexity of Piano-Hinged Dissections2013

    • 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
    • Related Report
      2013 Final Research Report
  • [Presentation] Base location problems for base-monotone regions2013

    • 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
    • Related Report
      2013 Final Research Report
  • [Presentation] Computational complexity and an integer programming model of Shakashaka2013

    • Author(s)
      Erik D. Demaine, Yoshio Okamoto, Ryuhei Uehara and Yushi Uno
    • Organizer
      The 25th Canadian Conference on Computational Geometry
    • Place of Presentation
      Waterloo, Canada
    • Related Report
      2013 Annual Research Report
  • [Presentation] Zipper Unfoldability of Domes and Prismoids2013

    • Author(s)
      Erik D. Demaine, Martin Demaine and Ryuhei Uehara
    • Organizer
      The 25th Canadian Conference on Computational Geometry
    • Place of Presentation
      Waterloo, Canada
    • Related Report
      2013 Annual Research Report
  • [Presentation] Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane2013

    • Author(s)
      Oswin Aichholzer, Jean Cardinal, Thomas Hackl, Ferran Hurtado, Matias Korman, Alexander Pilz, Rodrigo Silveira, Ryuhei Uehara, Birgit Vogtenhuber and Emo Welzl
    • Organizer
      The 25th Canadian Conference on Computational Geometry
    • Place of Presentation
      Waterloo, Canada
    • Related Report
      2013 Annual Research Report
  • [Presentation] The Graph Isomorphism Problem on Geometric graphs2013

    • Author(s)
      Ryuhei Uehara
    • Organizer
      The 2nd Pacific Rim Mathematical Association
    • Place of Presentation
      Shanghai, China
    • Related Report
      2013 Annual Research Report
    • Invited
  • [Presentation] Computational Complexity of Piano-Hinged Dissections2013

    • Author(s)
      Zachary Abel, Erik D. Demaine, Martin L. Demaine, Takashi Horiyama and Ryuhei Uehara
    • Organizer
      The European Workshop on Computational Geometry
    • Place of Presentation
      German
    • Related Report
      2012 Research-status Report
  • [Presentation] Base location problems for base-monotone regions2013

    • Author(s)
      Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara and Takeaki Uno
    • Organizer
      International Workshop on Algorithms and Computation
    • Place of Presentation
      Bangladesh
    • Related Report
      2012 Research-status Report
  • [Presentation] A 4.31-Approximation for the Geometric Unique CoV.ge Problem on Unit Disks2012

    • 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
    • Related Report
      2013 Final Research Report
  • [Presentation] Algorithms for Computing Optimal Image Segmentation using Quadtree Decomposition2012

    • 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
    • Related Report
      2013 Final Research Report
  • [Presentation] On Complexity of Flooding Games on Graphs with Interval Representations2012

    • 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
    • Related Report
      2013 Final Research Report
  • [Presentation] Common Developments of Three Different Orthogonal Boxes2012

    • Author(s)
      T. Shirakawa and R. Uehara
    • Organizer
      The 24th Canadian Conference on Computational Geometry (CCCG 2012)
    • Place of Presentation
      PEI, Canada
    • Related Report
      2013 Final Research Report
  • [Presentation] Covering points with disjoint unit disks2012

    • 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
    • Related Report
      2013 Final Research Report
  • [Presentation] Packing Trominoes is NP-Complete, #P-hard and ASP-Complete2012

    • 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
    • Related Report
      2013 Final Research Report
  • [Presentation] A Polynomial-Time Approximation Scheme for the Geometric Unique CoV.ge Problem on Unit Squares2012

    • 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
    • Related Report
      2013 Final Research Report
  • [Presentation] Bounding the number of reduced trees, cographs, and series-parallel graphs by compression2012

    • Author(s)
      S.-I. Nakano, R. Uehara and T. Uno
    • Organizer
      Workshop on Algorithms and Computation (WALCOM 2012)
    • Place of Presentation
      Dhaka, Bangladesh
    • Related Report
      2013 Final Research Report
  • [Presentation] A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks2012

    • Author(s)
      Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, and Yushi Uno
    • Organizer
      Annual International Symposium on Algorithms and Computation
    • Place of Presentation
      Taiwan
    • Related Report
      2012 Research-status Report
  • [Presentation] Algorithms for Computing Optimal Image Segmentation using Quadtree Decomposition2012

    • Author(s)
      Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, and Takeaki Uno
    • Organizer
      Thailand-Japan Joint Conference on Computational Geometry and Graphs
    • Place of Presentation
      Thailand
    • Related Report
      2012 Research-status Report
  • [Presentation] On Complexity of Flooding Games on Graphs with Interval Representations2012

    • Author(s)
      Hiroyuki Fukui, Ryuhei Uehara, Takeaki Uno and Yushi Uno
    • Organizer
      Thailand-Japan Joint Conference on Computational Geometry and Graphs
    • Place of Presentation
      Thailand
    • Related Report
      2012 Research-status Report
  • [Presentation] Common Developments of Three Different Orthogonal Boxes2012

    • Author(s)
      Toshihiro Shirakawa and Ryuhei Uehara
    • Organizer
      Canadian Conference on Computational Geometry
    • Place of Presentation
      Canada
    • Related Report
      2012 Research-status Report
  • [Presentation] Covering points with disjoint unit disks2012

    • Author(s)
      Greg Aloupis, Robert Hearn, Hirokazu Iwasawa and Ryuhei Uehara
    • Organizer
      Canadian Conference on Computational Geometry
    • Place of Presentation
      Canada
    • Related Report
      2012 Research-status Report
  • [Presentation] Packing Trominoes is NP-Complete, #P-hard and ASP-Complete2012

    • Author(s)
      Takashi Horiyama, Takehiro Ito, Keita Nakatsuka, Akira Suzuki and Ryuhei Uehara
    • Organizer
      Canadian Conference on Computational Geometry
    • Place of Presentation
      Canada
    • Related Report
      2012 Research-status Report
  • [Presentation] A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares2012

    • Author(s)
      Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno and Yushi Uno
    • Organizer
      Scandinavian Symposium and Workshops on Algorithm Theory
    • Place of Presentation
      Finland
    • Related Report
      2012 Research-status Report
  • [Presentation] Bounding the number of reduced trees, cographs, and series-parallel graphs by compression2012

    • Author(s)
      Shin-ichi Nakano, Ryuhei Uehara and Takeaki Uno
    • Organizer
      Workshop on Algorithms and Computation
    • Place of Presentation
      Bangladesh University of Enginerring and Technology (ダッカ,バングラディシュ)
    • Related Report
      2011 Research-status Report
  • [Presentation] On Common Unfolding of a Regular Tetrahedron and a Cube2011

    • Author(s)
      T. Shirakawa, T. Horiyama, and R. Uehara
    • Organizer
      Japan Conference on Discrete and Computational Geometry (JCDCG 2011)
    • Place of Presentation
      Tokyo
    • Related Report
      2013 Final Research Report
  • [Presentation] On covering of any point configuration by disjoint unit disks2011

    • Author(s)
      Y. Okayama, M. Kiyomi and R. Uehara
    • Organizer
      The 23rd Canadian Conference on Computational Geometry (CCCG' 11)
    • Place of Presentation
      Toronto, Canada
    • Related Report
      2013 Final Research Report
  • [Presentation] Common Developments of SeV.l Different Orthogonal Boxes2011

    • 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
    • Related Report
      2013 Final Research Report
  • [Presentation] Complexity of the stamp folding problem2011

    • 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
    • Related Report
      2013 Final Research Report
  • [Presentation] The Complexity of Free Flood Filling Game2011

    • 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
    • Related Report
      2013 Final Research Report
  • [Presentation] On Common Developments of SeV.l Different Polyhedra2011

    • Author(s)
      R. Uehara
    • Organizer
      14th Korea-Japan Joint Workshop on Algorithms and Computation (WAAC 2011)
    • Place of Presentation
      Busan, Korea
    • Related Report
      2013 Final Research Report
  • [Presentation] Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem2011

    • 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
    • Related Report
      2013 Final Research Report
  • [Presentation] On Common Unfolding of a Regular Tetrahedron and a Cube2011

    • Author(s)
      Toshihiro Shirakawa, Takashi Horiyama,and Ryuhei Uehara
    • Organizer
      Japan Conference on Discrete and Computational Geometry
    • Place of Presentation
      東海大学代々木上原キャンパス(東京,日本)
    • Related Report
      2011 Research-status Report
  • [Presentation] On covering of any point configuration by disjoint unit disks2011

    • Author(s)
      Yosuke Okayama, Masashi Kiyomi and Ryuhei Uehara
    • Organizer
      The 23rd Canadian Conference on Computational Geometry
    • Place of Presentation
      Toronto University (トロント,カナダ)
    • Related Report
      2011 Research-status Report
  • [Presentation] Common Developments of Several Different Orthogonal Boxes2011

    • Author(s)
      Zachary Abel, Erik Demaine, Martin Demaine, Hiroaki Matsui, Guenter Rote and Ryuhei Uehara
    • Organizer
      The 23rd Canadian Conference on Computational Geometry
    • Place of Presentation
      Toronto University (トロント・カナダ)
    • Related Report
      2011 Research-status Report
  • [Presentation] Complexity of the stamp folding problem2011

    • Author(s)
      Takuya Umesato, Toshiki Saitoh, Ryuhei Uehara, and Hiro Ito
    • Organizer
      5th Annual International Conference on Combinatorial Optimization and Applications
    • Place of Presentation
      QingHe Jin Jiang International Hotel (ZhangJiaJie, 中国)
    • Related Report
      2011 Research-status Report
  • [Presentation] The Complexity of Free Flood Filling Game2011

    • Author(s)
      Hiroyuki Fukuki, Akihiro Nakanishi, Ryuhei Uehara, Takeaki Uno, and Yushi Uno
    • Organizer
      14th Korea-Japan Joint Workshop on Algorithms and Computation
    • Place of Presentation
      Hanwha Resort Hotel (プサン,韓国)
    • Related Report
      2011 Research-status Report
  • [Presentation] On Common Developments of Several Different Polyhedra2011

    • Author(s)
      Ryuhei Uehara
    • Organizer
      14th Korea-Japan Joint Workshop on Algorithms and Computation(招待講演)
    • Place of Presentation
      Hanwha Resort Hotel (プサン,韓国)
    • Related Report
      2011 Research-status Report
  • [Presentation] Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem2011

    • Author(s)
      Yoshio Okamoto, Yota Otachi, Ryuhei Uehara and Takeaki Uno
    • Organizer
      8th Annual Conference on Theory and Applications of Medels of Computation
    • Place of Presentation
      電気通信大学(東京,日本)
    • Related Report
      2011 Research-status Report
  • [Book] はじめてのアルゴリズム2013

    • Author(s)
      上原隆平 著
    • Total Pages
      183
    • Publisher
      近代科学社
    • Related Report
      2013 Final Research Report
  • [Book] はじめてのアルゴリズム2013

    • Author(s)
      上原隆平
    • Total Pages
      183
    • Publisher
      近代科学社
    • Related Report
      2013 Annual Research Report
  • [Book] 折り紙のすうり2012

    • Author(s)
      ジョセフ・オルーク 著, 上原隆平 訳
    • Total Pages
      235
    • Publisher
      近代科学社
    • Related Report
      2013 Final Research Report
  • [Book] 『折り紙の数理とその応用』中の「3.1章 折り紙の情報学への応用」2012

    • Author(s)
      上原隆平(分担)
    • Publisher
      共立出版
    • Related Report
      2012 Research-status Report
  • [Book] 折り紙のすうり2012

    • Author(s)
      ジョセフ・オルーク著,上原隆平訳
    • Total Pages
      235
    • Publisher
      近代科学社
    • Related Report
      2012 Research-status Report
  • [Book] ゲームとパズルの計算量2011

    • Author(s)
      ロバート・A・ハーン, エリック・D・ドメイン 著, 上原隆平 訳
    • Total Pages
      279
    • Publisher
      近代科学社
    • Related Report
      2013 Final Research Report
  • [Book] ゲームとパズルの計算量2011

    • Author(s)
      ロバート・A・ハーン,エリック・D・ドメイン著,上原隆平訳
    • Total Pages
      279
    • Publisher
      近代科学社
    • Related Report
      2011 Research-status Report
  • [Remarks] ホームページ

    • URL

      http://www.jaist.ac.jp/~uehara/

    • Related Report
      2013 Final Research Report
  • [Remarks] Publications by R. Uehara

    • URL

      http://www.jaist.ac.jp/~uehara/pub/index.html

    • Related Report
      2013 Annual Research Report
  • [Remarks]

    • URL

      http://www.jaist.ac.jp/~uehara

    • Related Report
      2011 Research-status Report

URL: 

Published: 2011-08-05   Modified: 2019-07-29  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi