pith. sign in

Hirotaka Ono

Identifiers

  • name variant Hirotaka Ono 0.60 · backfill

Papers (17)

  1. The Complexity of Maximal/Closed Frequent Tree Mining for Bounded Height Trees cs.DS · 2026 · author #3
  2. Further Results on Rendering Geometric Intersection Graphs Sparse by Dispersion cs.CG · 2025 · author #4
  3. Independent Set Reconfiguration Parameterized by Modular-Width cs.DS · 2019 · author #4
  4. Parameterized Complexity of Safe Set cs.CC · 2019 · author #5
  5. Optimal Partition of a Tree with Social Distance cs.DS · 2018 · author #3
  6. Space-Efficient Algorithms for Longest Increasing Subsequence cs.DS · 2017 · author #2
  7. The complexity of dominating set reconfiguration cs.DM · 2015 · author #5
  8. Subgraph Domatic Problem and Writing Capacity of Memory Devises with Restricted State Transitions cs.IT · 2015 · author #3
  9. Reconfiguration of Cliques in a Graph cs.DS · 2014 · author #2
  10. Linear-Time Algorithm for Sliding Tokens on Trees cs.DM · 2014 · author #6
  11. Fixed-Parameter Tractability of Token Jumping on Planar Graphs cs.DM · 2014 · author #3
  12. (Total) Vector Domination for Graphs with Bounded Branchwidth cs.DS · 2013 · author #2
  13. Coalescing random walks and voting on connected graphs cs.DS · 2012 · author #3
  14. Minimum Certificate Dispersal with Tree Structures cs.DS · 2011 · author #3
  15. A tight upper bound on the (2,1)-total labeling number of outerplanar graphs cs.DM · 2009 · author #3
  16. Deductive Inference for the Interiors and Exteriors of Horn Theories cs.AI · 2009 · author #2
  17. A linear time algorithm for L(2,1)-labeling of trees cs.DS · 2008 · author #3

Mentions

  • 2602.03436 #3 · arxiv_oai · confidence 0.70 Hirotaka Ono
  • 1106.5845 #3 · backfill · confidence 0.70 Hirotaka Ono
  • 0911.4590 #3 · backfill · confidence 0.70 Hirotaka Ono
  • 0903.0422 #2 · backfill · confidence 0.70 Hirotaka Ono
  • 0810.0906 #3 · backfill · confidence 0.70 Hirotaka Ono

Frequent Coauthors