Search Results1-15 of  15

  • Uejima Akihiro ID: 9000346958346

    Articles in CiNii:1

    • Fillmat is NP-Complete and ASP-Complete (2015)
  • Akihiro Uejima ID: 9000347538545

    Articles in CiNii:1

    • The Complexity of Tantrix Match Puzzles with Four Colors (2013)
  • Akihiro Uejima ID: 9000363176823

    Articles in CiNii:1

    • The Complexity of Generalized Pipe Link Puzzles (2017)
  • Akihiro Uejima ID: 9000411079296

    Articles in CiNii:1

    • The Computational Complexity of Creek Puzzles on Several Grids (2020)
  • Akihiro Uejima ID: 9000238159435

    Articles in CiNii:1

    • The Complexity of Tantrix Match Puzzles with Four Colors (2013)
  • UEJIMA Akihiro ID: 9000002360501

    Department of Engineering Informatics, Osaka Electro-Communication University (2007 from CiNii)

    Articles in CiNii:4

    • circulant制約を持った隣接色制約付き彩色問題の応用と解析 (New Developments of Theory of Computation and Algorithms) (2001)
    • Subdividing hierarchy of classes of H-colorable graphs by circulant graphs (2004)
    • C_7-Coloring Problems of Planar Graphs (2002)
  • UEJIMA Akihiro ID: 9000004799551

    The authors are with Kyoto University (2002 from CiNii)

    Articles in CiNii:1

    • On H-Coloring Problems with H Expressed by Complements of Cycles, Bipartite Graphs, and Chordal Graphs (2002)
  • UEJIMA Akihiro ID: 9000004829906

    Graduate School of Informatics, Kyoto University (2004 from CiNii)

    Articles in CiNii:1

    • <C_7>^^^--Coloring Problem (2004)
  • UEJIMA Akihiro ID: 9000006475302

    School of Engineering, Osaka Electro-Communication University (2013 from CiNii)

    Articles in CiNii:9

    • 2<n/k<3に対する平面グラフのn/k-彩色問題のNP完全性 (2007)
    • On the Complexity of Planar n/k-Coloring Problems (2007)
    • The constitution method of planar graphs existing between hierarchy structure for n/k-colorings (2008)
  • UEJIMA Akihiro ID: 9000014655773

    Graduate School of Engineering, Osaka Electro-Communication University (2011 from CiNii)

    Articles in CiNii:3

    • A Framework for Decomposing Combinatorial Problems into Basic Features to Realize ZKIP (2009)
    • PSPACE-Completeness of Rotation Type Cell-Mazes (2011)
    • 2-K-6 色数とおじゃまぷよを制限した一般化ぷよぷよの連鎖数判定問題のNP完全性(ワークショップ「娯楽のOR-エンターテイメントの数理」) (2011)
  • Uejima Akihiro ID: 9000240063017

    Osaka Electro-Communication University (2013 from CiNii)

    Articles in CiNii:1

    • The Complexity of Tantrix Match Puzzles with Four Colors (2013)
  • Uejima Akihiro ID: 9000290821522

    Osaka Electro-Communication University (2015 from CiNii)

    Articles in CiNii:1

    • Fillmat is NP-Complete and ASP-Complete (2015)
  • Uejima Akihiro ID: 9000321407987

    Department of Management and Information Sciences, Fukui University of Technology (2016 from CiNii)

    Articles in CiNii:2

    • NBS-1-12 Analyzing traffic information using GUI automated manipulation tool (2016)
    • NBS-1-12 Analyzing traffic information using GUI automated manipulation tool (2016)
  • Uejima Akihiro ID: 9000363220172

    Osaka Electro-Communication University (2017 from CiNii)

    Articles in CiNii:1

    • The Complexity of Generalized Pipe Link Puzzles (2017)
  • Uejima Akihiro ID: 9000411024258

    Osaka Electro-Communication University (2020 from CiNii)

    Articles in CiNii:1

    • The Computational Complexity of Creek Puzzles on Several Grids (2020)
Page Top