Search Results1-20 of  40

  • 1 / 2
  • OTACHI YOTA ID: 9000241954878

    Articles in CiNii:1

    • Approximating the path-distance-width for k-cocomparability graphs (アルゴリズム(AL) Vol.2011-AL-134) （2011）
  • OTACHI YOTA ID: 9000299515788

    Articles in CiNii:1

    • Induced minor free graphs : Isomorphism and clique-width (コンピュテーション) （2015）
  • OTACHI YOTA ID: 9000312269873

    Articles in CiNii:1

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

    Articles in CiNii:1

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

    Articles in CiNii:1

    • A faster parameterized algorithm for PSEUDOFOREST DELETION (Theoretical Foundations of Computing) （2016）
  • Yota Otachi ID: 9000363176810

    Articles in CiNii:1

    • Hitori Numbers （2017）
  • Yota Otachi ID: 9000411079317

    Articles in CiNii:1

    • K3 Edge Cover Problem in a Wide Sense （2020）
  • OTACHI YOTA ID: 9000017547492

    School of Information Science, Japan Advanced Institute of Science and Technology （2014 from CiNii）

    Articles in CiNii:5

    • Enumerating All Rooted Trees Including k Leaves （2010）
    • Approximating the path-distance-width for <i>k</i>-cocomparability graphs （2011）
    • Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem （2011）
  • OTACHI YOTA ID: 9000300661912

    School of Information Science, Japan Advanced Institute of Science and Technology （2014 from CiNii）

    Articles in CiNii:1

    • Intersection dimension of bipartite graphs （2014）
  • OTACHI Yota ID: 9000002746060

    School of Information Science, Japan Advanced Institute of Science and Technology （2014 from CiNii）

    Articles in CiNii:31

    • Interval bigraphs are unit grid intersection graphs （2004）
    • A lower bound for the vertex isoperimetric number of the complete κ-ary trees （2005）
    • An approximation algorithm for matroid covering (Theoretical Computer Science and its Applications) （2005）
  • OTACHI Yota ID: 9000006931409

    Department of Computer Science, Gunma University （2010 from CiNii）

    Articles in CiNii:3

    • A lower bound for tree-width of Cartesian product graphs （2008）
    • A lower bound for tree-width of Cartesian product graphs （2008）
    • Complexity results for the spanning tree congestion problem （2010）
  • OTACHI Yota ID: 9000017550439

    Graduate School of Information Sciences, Tohoku University （2011 from CiNii）

    Articles in CiNii:3

    • Spanning tree congestion of k-outerplanar graphs （2010）
    • Bipartite powers of interval bigraphs （2010）
    • Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem （2011）
  • OTACHI Yota ID: 9000018672711

    Graduate School of Information Sciences, Tohoku University （2011 from CiNii）

    Articles in CiNii:1

    • Reconstructing sets from distances given by graphs （2011）
  • OTACHI Yota ID: 9000019142535

    Graduate School of Information Sciences, Tohoku University （2012 from CiNii）

    Articles in CiNii:1

    • Enumerating All Rooted Trees Including k Leaves （2012）
  • OTACHI Yota ID: 9000021701787

    Graduate School of Information Sciences, Tohoku University （2011 from CiNii）

    Articles in CiNii:1

    • Designing Low-Congestion Networks with Structural Graph Theory （2011）
  • OTACHI Yota ID: 9000283336206

    School of Information Science, Japan Advanced Institute of Science and Technology （2015 from CiNii）

    Articles in CiNii:1

    • Secure Sets and Defensive Alliances in Graphs: A Faster Algorithm and Improved Bounds （2015）
  • OTACHI Yota ID: 9000404099505

    Faculty of Advanced Science and Technology, Kumamoto University （2019 from CiNii）

    Articles in CiNii:1

    • On Computational Complexity of Pipe Puzzles （2019）
  • Otachi Yota ID: 9000019071999

    Graduate School of Information Science, Tohoku University （2012 from CiNii）

    Articles in CiNii:1

    • DS-1-11 An Algorithm for Optimally Locating Baselines using Quad Decomposition （2012）
  • Otachi Yota ID: 9000022402486

    Articles in CiNii:1

    • On bipartite powers of bigraphs （2012）
  • Otachi Yota ID: 9000023183759

    Articles in CiNii:1

    • Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem （2011）
  • 1 / 2
Page Top