The following pages link to Tesshu Hanaka (Q782203):
Displayed 40 items.
- On directed covering and domination problems (Q1735678) (← links)
- Graph classes and approximability of the happy set problem (Q2019476) (← links)
- A (probably) optimal algorithm for \textsc{bisection} on bounded-treewidth graphs (Q2034399) (← links)
- An optimal algorithm for bisection for bounded-treewidth graph (Q2037961) (← links)
- (In)approximability of maximum minimal FVS (Q2051849) (← links)
- Parameterized complexity of \((A,\ell)\)-path packing (Q2118381) (← links)
- An improved deterministic parameterized algorithm for cactus vertex deletion (Q2135634) (← 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)
- Parameterized orientable deletion (Q2182093) (← links)
- Computing \(L(p, 1)\)-labeling with combined parameters (Q2232248) (← links)
- Parameterized complexity of safe set (Q2294039) (← links)
- Optimal partition of a tree with social distance (Q2327524) (← links)
- On the maximum weight minimal separator (Q2333804) (← links)
- Finding a maximum minimal separator: graph classes and fixed-parameter tractability (Q2661784) (← links)
- Complexity and approximability of the happy set problem (Q2662689) (← links)
- Computing the largest bond and the maximum connected cut of a graph (Q2663713) (← links)
- Computing densest \(k\)-subgraph with structural parameters (Q2680362) (← links)
- On the Maximum Weight Minimal Separator (Q2988830) (← links)
- Two-Player Competitive Diffusion Game: Graph Classes and the Existence of a Nash Equilibrium (Q3297794) (← links)
- New Results on Directed Edge Dominating Set (Q5005171) (← links)
- Parameterized Complexity of $$(A,\ell )$$-Path Packing (Q5041178) (← links)
- Computing L(p,1)-Labeling with Combined Parameters (Q5049996) (← links)
- (Q5116488) (← links)
- Parameterized Complexity of Safe Set (Q5119377) (← links)
- On Directed Covering and Domination Problems (Q5136265) (← links)
- (Q5875545) (← links)
- Parameterized algorithms for the happy set problem (Q5896128) (← links)
- Reconfiguring spanning and induced subgraphs (Q5916255) (← links)
- Exploring the gap between treedepth and vertex cover through vertex integrity (Q5918674) (← links)
- Independent set reconfiguration parameterized by modular-width (Q5918925) (← links)
- Subgraph isomorphism on graph classes that exclude a substructure (Q5919029) (← links)
- Parameterized algorithms for the happy set problem (Q5919103) (← links)
- Subgraph isomorphism on graph classes that exclude a substructure (Q5919398) (← links)
- Exploring the gap between treedepth and vertex cover through vertex integrity (Q5925679) (← links)
- Grouped domination parameterized by vertex cover, twin cover, and beyond (Q6057339) (← links)
- In)approximability of Maximum Minimal FVS (Q6065391) (← links)
- Corrigendum to: ``Complexity and approximability of the happy set problem'' (Q6076349) (← links)
- Winner determination algorithms for graph games with matching structures (Q6119832) (← links)
- Grouped domination parameterized by vertex cover, twin cover, and beyond (Q6131196) (← links)