Search Results1-20 of  95

  • 1 / 5
  • Ono Hirotaka ID: 9000379572151

    Articles in CiNii:1

    • Drawing Borders Efficiently （2009）
  • Ono Hirotaka ID: 9000379591291

    Articles in CiNii:1

    • Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree （2011）
  • Ono Hirotaka ID: 9000379594023

    Articles in CiNii:1

    • The hitting and cover times of Metropolis walks （2010）
  • Ono Hirotaka ID: 9000379599110

    Articles in CiNii:1

    • 計算機クラスタを用いた並列メタ戦略アルゴリズムの設計と実装 （2003）
  • Ono Hirotaka ID: 9000403556315

    Articles in CiNii:1

    • Approximability of Latin Square Completion-Type Puzzles （2014）
  • Ono Hirotaka ID: 9000403556642

    Articles in CiNii:1

    • Best Fitting Fixed-Length Substring Patterns for a Set of Strings （2005）
  • Ono Hirotaka ID: 9000403560466

    Articles in CiNii:1

    • A Probabilistic Model of the DNA Conformational Change （2006）
  • Ono Hirotaka ID: 9000010311558

    Articles in CiNii:1

    • The weakest failure detectors for solving the stable leader election (新世代の計算限界) （2006）
  • Ono Hirotaka ID: 9000010462510

    Articles in CiNii:1

    • Deductive inference for the interiors and exteriors of Horn theories (「生命情報からの知識発見」及び一般) （2008）
  • ONO HIROTAKA ID: 9000312269872

    Articles in CiNii:1

    • Degree-Constrained Orientation for Graphs with Polynomially Many Potentially Maximal Cliques (回路とシステム) （2015）
  • ONO HIROTAKA ID: 9000312270418

    Articles in CiNii:1

    • Degree-Constrained Orientation for Graphs with Polynomially Many Potentially Maximal Cliques (システム数理と応用) （2015）
  • ONO Hirotaka ID: 9000336056932

    Articles in CiNii:1

    • A faster parameterized algorithm for PSEUDOFOREST DELETION (Theoretical Foundations of Computing) （2016）
  • Hirotaka Ono ID: 9000346958332

    Articles in CiNii:1

    • How Simple Algorithms Can Solve Latin Square Completion-Type Puzzles Approximately （2015）
  • Ono Hirotaka ID: 9000411075007

    Articles in CiNii:1

    • A Probabilistic Model of the DNA Conformational Change （2006）
  • Hirotaka ONO ID: 9000406151933

    NTT Device Technology Laboratories, NTT Corporation （2019 from CiNii）

    Articles in CiNii:1

    • 3 to 5-LP mode amplification characteristics of ring core erbium doped fiber （2019）
  • Hirotaka Ono ID: 9000006540387

    Kyushu University （2011 from CiNii）

    Articles in CiNii:2

    • Optimal Balanced Semi-Matchings for Weighted Bipartite Graphs （2007）
    • Complexity of Minimum Certificate Dispersal Problem with Tee Structure （2011）
  • Hirotaka Ono ID: 9000403597234

    Articles in CiNii:1

    • Approximability and inapproximability of the minimum certificate dispersal problem （2010）
  • Hirotaka Ono ID: 9000406152013

    NTT Device Technology Laboratories, NTT Corporation （2019 from CiNii）

    Articles in CiNii:1

    • Inter-core cross-gain modulation on cladding-pumped multicore erbium-doped fiber amplifier （2019）
  • ONO HIROTAKA ID: 9000017547445

    Department of Economic Engineering, Faculty of Economics, Kyushu University （2014 from CiNii）

    Articles in CiNii:5

    • Graph Orientation Problems for Multiple st-Reachability （2009）
    • Approximating the path-distance-width for <i>k</i>-cocomparability graphs （2011）
    • Complexity of Minimum Certificate Dispersal Problem with Tree Structure （2011）
  • ONO HIROTAKA ID: 9000254158367

    Articles in CiNii:1

    • Analysis of stimulants in urine by head space gas chromatography. （1988）
  • 1 / 5
Page Top