Tesshu Hanaka

From MaRDI portal
Person:782203

Available identifiers

zbMath Open hanaka.tesshuMaRDI QIDQ782203

List of research outcomes





PublicationDate of PublicationType
An improved spectral lower bound of treewidth2025-01-14Paper
Structural parameterizations of vertex integrity2024-12-12Paper
Maximizing utilitarian and egalitarian welfare of fractional hedonic games on tree-like graphs2024-09-16Paper
Structural parameterizations of vertex integrity (best paper)2024-07-19Paper
On the complexity of list \(\mathcal{H}\)-packing for sparse graph classes2024-07-19Paper
Grouped domination parameterized by vertex cover, twin cover, and beyond2024-04-04Paper
Winner determination algorithms for graph games with matching structures2024-03-25Paper
In)approximability of Maximum Minimal FVS2023-11-14Paper
Grouped domination parameterized by vertex cover, twin cover, and beyond2023-10-04Paper
Corrigendum to: ``Complexity and approximability of the happy set problem2023-09-21Paper
Exploring the gap between treedepth and vertex cover through vertex integrity2023-03-22Paper
https://portal.mardi4nfdi.de/entity/Q58755452023-02-03Paper
Computing densest \(k\)-subgraph with structural parameters2022-12-29Paper
Computing L(p,1)-Labeling with Combined Parameters2022-11-14Paper
Parameterized Complexity of $$(A,\ell )$$-Path Packing2022-10-13Paper
The existence of a pure Nash equilibrium in the two-player competitive diffusion game on graphs having chordality2022-09-15Paper
Winner determination algorithms for graph games with matching structures2022-08-30Paper
Exploring the gap between treedepth and vertex cover through vertex integrity2022-05-10Paper
An improved deterministic parameterized algorithm for cactus vertex deletion2022-05-09Paper
Parameterized complexity of \((A,\ell)\)-path packing2022-03-22Paper
(In)approximability of maximum minimal FVS2021-11-25Paper
Computing \(L(p, 1)\)-labeling with combined parameters2021-10-04Paper
Parameterized algorithms for the happy set problem2021-09-30Paper
New results on directed edge dominating set2021-08-04Paper
An optimal algorithm for bisection for bounded-treewidth graph2021-07-08Paper
A (probably) optimal algorithm for \textsc{bisection} on bounded-treewidth graphs2021-06-22Paper
Graph classes and approximability of the happy set problem2021-04-21Paper
Computing the largest bond and the maximum connected cut of a graph2021-04-19Paper
Complexity and approximability of the happy set problem2021-04-14Paper
Finding a maximum minimal separator: graph classes and fixed-parameter tractability2021-04-08Paper
On directed covering and domination problems2020-11-25Paper
Subgraph isomorphism on graph classes that exclude a substructure2020-11-11Paper
Parameterized complexity of safe set2020-09-04Paper
Independent set reconfiguration parameterized by modular-width2020-09-03Paper
Parameterized orientable deletion2020-08-25Paper
Parameterized algorithms for the happy set problem2020-07-22Paper
Two-player competitive diffusion game: graph classes and the existence of a Nash equilibrium2020-07-20Paper
Parameterized orientable deletion2020-05-21Paper
Independent set reconfiguration parameterized by modular-width2020-02-24Paper
Subgraph isomorphism on graph classes that exclude a substructure2020-02-06Paper
Parameterized complexity of safe set2020-02-06Paper
Reconfiguring spanning and induced subgraphs2020-01-16Paper
On the maximum weight minimal separator2019-11-13Paper
Optimal partition of a tree with social distance2019-10-15Paper
On directed covering and domination problems2019-03-28Paper
Reconfiguring spanning and induced subgraphs2018-10-04Paper
On the maximum weight minimal separator2017-05-19Paper
An improved spectral lower bound of treewidthN/APaper

Research outcomes over time

This page was built for person: Tesshu Hanaka