The following pages link to Hirotaka Ono (Q260259):
Displayed 50 items.
- Degree-constrained graph orientation: maximum satisfaction and minimum violation (Q260260) (← links)
- (Total) vector domination for graphs with bounded branchwidth (Q290105) (← links)
- The \((p,q)\)-total labeling problem for trees (Q408175) (← links)
- On the approximability and hardness of minimum topic connected overlay and its special instances (Q418776) (← links)
- A tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs (Q450562) (← links)
- Corrigendum to ``On the approximability and hardness of minimum topic connected overlay and its special instances'' (Q476920) (← links)
- Linear-time algorithm for sliding tokens on trees (Q496016) (← links)
- The complexity of dominating set reconfiguration (Q517018) (← links)
- Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree (Q543514) (← links)
- Broadcastings and digit tilings on three-dimensional torus networks (Q620939) (← links)
- Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree (Q716177) (← links)
- Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity (Q724225) (← links)
- Base-object location problems for base-monotone regions (Q744059) (← links)
- An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees (Q837161) (← links)
- How to collect balls moving in the Euclidean plane (Q860383) (← links)
- The hitting and cover times of Metropolis walks (Q964410) (← links)
- Local move connectedness of domino tilings with diagonal impurities (Q973117) (← links)
- Approximability and inapproximability of the minimum certificate dispersal problem (Q982648) (← links)
- Interior and exterior functions of positive Boolean functions. (Q1408452) (← links)
- Safe sets in graphs: graph classes and structural parameters (Q1631677) (← links)
- A faster parameterized algorithm for pseudoforest deletion (Q1693129) (← links)
- On directed covering and domination problems (Q1735678) (← links)
- Subexponential fixed-parameter algorithms for partial vector domination (Q1751177) (← links)
- Logical analysis of data with decomposable structures. (Q1853578) (← links)
- A decomposability index in logical analysis of data (Q1878410) (← links)
- On space complexity of self-stabilizing leader election in mediated population protocol (Q1938386) (← links)
- Route-enabling graph orientation problems (Q1939659) (← links)
- Space-efficient algorithms for longest increasing subsequence (Q1987516) (← links)
- Upper and lower degree-constrained graph orientation with minimum penalty (Q2062132) (← links)
- Parameterized complexity of \((A,\ell)\)-path packing (Q2118381) (← links)
- Winner determination algorithms for graph games with matching structures (Q2169988) (← links)
- The existence of a pure Nash equilibrium in the two-player competitive diffusion game on graphs having chordality (Q2172410) (← links)
- Exact algorithms for the bounded repetition longest common subsequence problem (Q2180128) (← links)
- Parameterized complexity of independent set reconfiguration problems (Q2192091) (← links)
- Exact algorithms for the repetition-bounded longest common subsequence problem (Q2197547) (← links)
- A 116/13-approximation algorithm for \(L(2,1)\)-labeling of unit disk graphs (Q2206246) (← links)
- Computing \(L(p, 1)\)-labeling with combined parameters (Q2232248) (← links)
- Reconfiguration of list \(L(2,1)\)-labelings in a graph (Q2250462) (← links)
- Drawing borders efficiently (Q2272197) (← links)
- Parameterized complexity of safe set (Q2294039) (← links)
- Settlement fund circulation problem (Q2312652) (← links)
- Graph orientation with edge modifications (Q2327085) (← links)
- Optimal partition of a tree with social distance (Q2327524) (← links)
- On the maximum weight minimal separator (Q2333804) (← links)
- Approximability of minimum certificate dispersal with tree structures (Q2354400) (← links)
- The searchlight problem for road networks (Q2354403) (← links)
- A linear time algorithm for \(L(2,1)\)-labeling of trees (Q2375957) (← links)
- Approximating the path-distance-width for AT-free graphs and graphs in related classes (Q2442209) (← links)
- Optimal approximability of bookmark assignments (Q2444527) (← links)
- Reconfiguration of cliques in a graph (Q2700609) (← links)