Search Results1-20 of  103

  • UEHARA RYUHEI ID: 9000312269702

    Articles in CiNii:1

    • Shortest Reconfiguration of Sliding Tokens on a Caterpillar (回路とシステム) (2015)
  • UEHARA RYUHEI ID: 9000312270293

    Articles in CiNii:1

    • Shortest Reconfiguration of Sliding Tokens on a Caterpillar (システム数理と応用) (2015)
  • Ryuhei Uehara ID: 9000018866653

    Articles in CiNii:1

    • NP-completeness of generalized Kaboozle (2012)
  • Ryuhei Uehara ID: 9000023261253

    Articles in CiNii:1

    • NP-completeness of generalized Kaboozle (2012)
  • Ryuhei Uehara ID: 9000333925928

    Articles in CiNii:1

    • Flat Foldings of Plane Graphs with Prescribed Angles and Edge (2014)
  • Ryuhei Uehara ID: 9000363176782

    Articles in CiNii:1

    • Unfolding and Dissection of Multiple Cubes, Tetrahedra, and Doubly Covered Squares (2017)
  • Ryuhei Uehara ID: 9000363176817

    Articles in CiNii:1

    • Sankaku-tori: An Old Western-Japanese Game Played on a Point Set (2017)
  • UEHARA RYUHEI ID: 9000017547413

    Computer Science and Artificial Intelligence Laboratory, MIT (2017 from CiNii)

    Articles in CiNii:19

    • Efficient Enumeration of All Pseudoline Arrangements (2009)
    • Graph Orientation Problems for Multiple st-Reachability (2009)
    • Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs (2009)
  • UEHARA RYUHEI ID: 9000283435773

    School of Information Science, Japan Advanced Institute of Science and Technology (2013 from CiNii)

    Articles in CiNii:1

    • Bumpy Pyramid Folding Problem (2013)
  • UEHARA RYUHEI ID: 9000284630335

    School of Information Science, Japan Advanced Institute of Science and Technology (2013 from CiNii)

    Articles in CiNii:1

    • Bumpy Pyramid Folding Problem (2013)
  • UEHARA RYUHEI ID: 9000300661905

    School of Information Science, JAIST (2014 from CiNii)

    Articles in CiNii:1

    • FPT algorithms for Token Jumping on Graphs (2014)
  • UEHARA RYUHEI ID: 9000300661914

    School of Information Science, Japan Advanced Institute of Science and Technology (2014 from CiNii)

    Articles in CiNii:1

    • Intersection dimension of bipartite graphs (2014)
  • UEHARA Ryuhei ID: 9000004374209

    Center for Information Science, Tokyo Woman's Christian University (1997 from CiNii)

    Articles in CiNii:5

    • 岩田茂樹著 "NP完全問題入門" (1995)
    • A Measure of Parallelization for the Lexicographically First Maximal Independent Set Problem (1997)
    • Fast RNC and NC Algorithms for Finding a Maximal Set of Paths with an Application (1996)
  • UEHARA Ryuhei ID: 9000004767616

    Japan Advanced Institute of Science and Technology (2008 from CiNii)

    Articles in CiNii:5

    • On a Unique Solution Instance Generation for the 3-Satisfiability (3SAT) Problem (1998)
    • Partial Gates and Their Identifications (1996)
    • Complexity Classes Characterized by Many Computation Paths (1995)
  • UEHARA Ryuhei ID: 9000004892636

    Center for Information Science,Tokyo Woman's Christian University, Tokyo (1997 from CiNii)

    Articles in CiNii:1

    • Parallel Algorithms for Maximal Linear Forests (1997)
  • UEHARA Ryuhei ID: 9000017681156

    School of Information Science, JAIST (2011 from CiNii)

    Articles in CiNii:3

    • Longest Path Problems on Ptolemaic Graphs (2008)
    • Random Generation and Enumeration of Proper Interval Graphs (2010)
    • Voronoi Game on a Path (2011)
  • UEHARA Ryuhei ID: 9000017688669

    School of Information Science, JAIST (2008 from CiNii)

    Articles in CiNii:1

    • FOREWORD (2008)
  • UEHARA Ryuhei ID: 9000024589420

    Articles in CiNii:1

    • Generalized Hi-Q is NP-Complete (1990)
  • UEHARA Ryuhei ID: 9000107322130

    Japan Advanced Institute of Science and Technology (2008 from CiNii)

    Articles in CiNii:1

    • Simulation of a certain Voting Game (2008)
  • UEHARA Ryuhei ID: 9000253745961

    Articles in CiNii:67

    • Laminar Structure of Ptolemaic Graphs and Its Applications (2005)
    • Computational Complexity of Sequential Token Swapping Problem (コンピュテーション) (2016)
    • Space Efficient Algorithms for Maximum (Weight) Independent Set on Circular Arcs (2017)
Page Top