Search Results1-20 of  50

  • 1 / 3
  • Takeaki Uno ID: 9000363176812

    Articles in CiNii:1

    • Hitori Numbers （2017）
  • Takeaki Uno ID: 9000363176818

    Articles in CiNii:1

    • Sankaku-tori: An Old Western-Japanese Game Played on a Point Set （2017）
  • UNO TAKEAKI ID: 9000399247411

    Articles in CiNii:1

    • The Complexity of Ladder-Lottery Realization Problem (回路とシステム) （2018）
  • UNO TAKEAKI ID: 9000399248659

    Articles in CiNii:1

    • The Complexity of Ladder-Lottery Realization Problem (システム数理と応用) （2018）
  • Ken-ichi KAWARABAYASHI/Kunihiko SADAKANE/Takeaki UNO ID: 9000335548830

    National Institute of Informatics/National Institute of Informatics/National Institute of Informatics （2012 from CiNii）

    Articles in CiNii:1

    • Theoretical computer science and discrete mathematics （2012）
  • Takeaki UNO ID: 9000335548834

    National Institute of Informatics （2012 from CiNii）

    Articles in CiNii:1

    • Implementation issues of clique enumeration algorithm (Special issue : Theoretical computer science and discrete mathematics) （2012）
  • Takeaki Uno ID: 9000018513497

    National Institute of Informatics （2014 from CiNii）

    Articles in CiNii:6

    • Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem （2011）
    • The Complexity of Free Flood Filling Games （2011）
    • On the number of reduced trees, cographs, and series-parallel graphs by compression （2011）
  • Takeaki Uno ID: 9000394062920

    Articles in CiNii:1

    • Efficient Construction and Use of Enumeration Algorithms(Part 1) : Approaches to Models in AI by Enumeration （2003）
  • Takeaki Uno ID: 9000394063004

    Articles in CiNii:1

    • Efficient Construction and Use of Enumeration Algorithms (Part 2) : How to Construct Enumeration Algorithms （2003）
  • Takeaki Uno ID: 9000394063158

    Articles in CiNii:1

    • Efficient Construction and Use of Enumeration Algorithms (Part 3) : Hard Enumeration Problems and Reverse Search （2003）
  • Takeaki Uno ID: 9000394066415

    Articles in CiNii:1

    • Data Intensive Computing : No.2 Frequent Itemset Mining Algorithms(<Lecture Series>Intelligent Computing and Related Issues (2)) （2007）
  • Takeaki Uno ID: 9000394070724

    Articles in CiNii:1

    • High-Speed Clique / Dense Subgraph Mining Algorithms(<Special Issue>Discrete Structure Manipulation Systems-The Art of Algorithms for Intelligent Information Processing) （2012）
  • UNO TAKEAKI ID: 9000018805380

    National Institute of Informatics （2011 from CiNii）

    Articles in CiNii:1

    • Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem （2011）
  • UNO Takeaki ID: 9000005097722

    Department of Industial Engineering and Management, Tokyo Institute of Technology （1999 from CiNii）

    Articles in CiNii:1

    • Two Algorithms for Computing Power Indices of All Players Efficiently(APOR(2)) （1999）
  • UNO Takeaki ID: 9000006125693

    National Institute of Informatics （2006 from CiNii）

    Articles in CiNii:1

    • Generating Chordal Graphs Included in Given Graphs （2006）
  • UNO Takeaki ID: 9000018805384

    National Institute of Informatics （2011 from CiNii）

    Articles in CiNii:1

    • The Complexity of Free Flood Filling Games （2011）
  • UNO Takeaki ID: 9000243893431

    National Institute of Informatics （2014 from CiNii）

    Articles in CiNii:1

    • Constant Time Enumeration of Subtrees with Exactly <i>k</i> Nodes in a Tree （2014）
  • UNO Takeaki ID: 9000305640907

    National Institute of Informatics (NII), Hitotsubashi 2-1-2, Chiyoda-ku, Tokyo 101-8430, Japan （2015 from CiNii）

    Articles in CiNii:1

    • "Maizo"-chemistry Project: toward Molecular- and Reaction Discovery from Quantum Mechanical Global Reaction Route Mappings （2015）
  • UNO Takeaki ID: 9000398137849

    National Institute of Informatics （2018 from CiNii）

    Articles in CiNii:1

    • Efficient Enumeration of Induced Matchings in a Graph without Cycles with Length Four （2018）
  • UNO Takeaki ID: 9000402795390

    National Institute of Informatics （2019 from CiNii）

    Articles in CiNii:1

    • Biclustering the purchase transaction data for tea drinks:Extracting interesting patterns and its experimental evaluation in the real supermarket store （2019）
  • 1 / 3
Page Top