The following pages link to Hirotaka Ono (Q260259):
Displayed 50 items.
- (Q2766849) (← links)
- (Q2845529) (← links)
- Minimum Certificate Dispersal with Tree Structures (Q2898067) (← links)
- Finding Longest Common Segments in Protein Structures in Nearly Linear Time (Q2904508) (← links)
- Coalescing random walks and voting on graphs (Q2933775) (← links)
- Fixed-Parameter Tractability of Token Jumping on Planar Graphs (Q2942629) (← links)
- Polynomial-Time Algorithm for Sliding Tokens on Trees (Q2942646) (← links)
- Depth-First Search Using $$O(n)$$ Bits (Q2942660) (← links)
- Deductive inference for the interiors and exteriors of horn theories (Q2946672) (← links)
- Reconfiguration of Cliques in a Graph (Q2948468) (← links)
- An Improvement of Optimal Ate Pairing on KSS Curve with Pseudo 12-Sparse Multiplication (Q2988347) (← links)
- On the Maximum Weight Minimal Separator (Q2988830) (← links)
- GRAPH ORIENTATION TO MAXIMIZE THE MINIMUM WEIGHTED OUTDEGREE (Q2997922) (← links)
- The (2,1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2 (Q3000498) (← links)
- The (p,q)-total Labeling Problem for Trees (Q3060760) (← links)
- On the Approximability of Minimum Topic Connected Overlay and Its Special Instances (Q3088055) (← links)
- Approximability of the Path-Distance-Width for AT-free Graphs (Q3104783) (← links)
- Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation (Q3188863) (← links)
- Subexponential Fixed-Parameter Algorithms for Partial Vector Domination (Q3195339) (← links)
- Two-Player Competitive Diffusion Game: Graph Classes and the Existence of a Nash Equilibrium (Q3297794) (← links)
- Space-Efficient Algorithms for Longest Increasing Subsequence (Q3304143) (← links)
- GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE (Q3434271) (← links)
- The Complexity of Dominating Set Reconfiguration (Q3449837) (← links)
- An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees (Q3512458) (← links)
- On Approximation of Bookmark Assignments (Q3525561) (← links)
- THE SPACE COMPLEXITY OF LEADER ELECTION IN ANONYMOUS NETWORKS (Q3569285) (← links)
- The Balanced Edge Cover Problem (Q3596723) (← links)
- Deductive Inference for the Interiors and Exteriors of Horn Theories (Q3596735) (← links)
- Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG (Q3630194) (← links)
- A Linear Time Algorithm for L(2,1)-Labeling of Trees (Q3639233) (← links)
- A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems (Q3646120) (← links)
- How to Design a Linear Cover Time Random Walk on a Finite Graph (Q3646121) (← links)
- Route-Enabling Graph Orientation Problems (Q3652228) (← links)
- (Q4474096) (← links)
- A Hybrid Approach of Optimization and Sampling for Robust Portfolio Selection (Q4596233) (← links)
- A faster parameterized algorithm for pseudoforest deletion (Q4634390) (← links)
- Degree-constrained orientation of maximum satisfaction: Graph classes and parameterized complexity (Q4636502) (← links)
- Reconfiguration of List L(2,1)-Labelings in a Graph (Q4909520) (← links)
- Base Location Problems for Base-Monotone Regions (Q4914435) (← links)
- Parameterized Complexity of $$(A,\ell )$$-Path Packing (Q5041178) (← links)
- Computing L(p,1)-Labeling with Combined Parameters (Q5049996) (← links)
- Parameterized Complexity of Safe Set (Q5119377) (← links)
- On Directed Covering and Domination Problems (Q5136265) (← links)
- Settlement Fund Circulation Problem (Q5136266) (← links)
- Pattern Formation by Oblivious Asynchronous Mobile Robots (Q5258906) (← links)
- Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem (Q5323050) (← links)
- (Total) Vector Domination for Graphs with Bounded Branchwidth (Q5405043) (← links)
- Coalescing Random Walks and Voting on Connected Graphs (Q5408589) (← links)
- On the Parameterized Complexity for Token Jumping on Graphs (Q5410654) (← links)
- Drawing Borders Efficiently (Q5426027) (← links)