Tesshu Hanaka

Available identifiers

zbMath Open hanaka.tesshuMaRDI QIDQ782203

List of research outcomes

Publication	Date of Publication	Type
Grouped domination parameterized by vertex cover, twin cover, and beyond	2024-04-04	Paper
Winner determination algorithms for graph games with matching structures	2024-03-25	Paper
https://portal.mardi4nfdi.de/entity/Q6065391	2023-11-14	Paper
Grouped domination parameterized by vertex cover, twin cover, and beyond	2023-10-04	Paper
Corrigendum to: ``Complexity and approximability of the happy set problem	2023-09-21	Paper
Exploring the gap between treedepth and vertex cover through vertex integrity	2023-03-22	Paper
https://portal.mardi4nfdi.de/entity/Q5875545	2023-02-03	Paper
Computing densest \(k\)-subgraph with structural parameters	2022-12-29	Paper
Computing L(p,1)-Labeling with Combined Parameters	2022-11-14	Paper
Parameterized Complexity of $$(A,\ell )$$-Path Packing	2022-10-13	Paper
The existence of a pure Nash equilibrium in the two-player competitive diffusion game on graphs having chordality	2022-09-15	Paper
Winner determination algorithms for graph games with matching structures	2022-08-30	Paper
Exploring the gap between treedepth and vertex cover through vertex integrity	2022-05-10	Paper
An improved deterministic parameterized algorithm for cactus vertex deletion	2022-05-09	Paper
Parameterized complexity of \((A,\ell)\)-path packing	2022-03-22	Paper
(In)approximability of maximum minimal FVS	2021-11-25	Paper
Computing \(L(p, 1)\)-labeling with combined parameters	2021-10-04	Paper
Parameterized algorithms for the happy set problem	2021-09-30	Paper
https://portal.mardi4nfdi.de/entity/Q5005171	2021-08-04	Paper
An optimal algorithm for bisection for bounded-treewidth graph	2021-07-08	Paper
A (probably) optimal algorithm for \textsc{bisection} on bounded-treewidth graphs	2021-06-22	Paper
Graph classes and approximability of the happy set problem	2021-04-21	Paper
Computing the largest bond and the maximum connected cut of a graph	2021-04-19	Paper
Complexity and approximability of the happy set problem	2021-04-14	Paper
Finding a maximum minimal separator: graph classes and fixed-parameter tractability	2021-04-08	Paper
https://portal.mardi4nfdi.de/entity/Q5136265	2020-11-25	Paper
Subgraph isomorphism on graph classes that exclude a substructure	2020-11-11	Paper
Parameterized Complexity of Safe Set	2020-09-04	Paper
Independent set reconfiguration parameterized by modular-width	2020-09-03	Paper
https://portal.mardi4nfdi.de/entity/Q5116488	2020-08-25	Paper
Parameterized algorithms for the happy set problem	2020-07-22	Paper
Two-Player Competitive Diffusion Game: Graph Classes and the Existence of a Nash Equilibrium	2020-07-20	Paper
Parameterized orientable deletion	2020-05-21	Paper
Independent set reconfiguration parameterized by modular-width	2020-02-24	Paper
Parameterized complexity of safe set	2020-02-06	Paper
Subgraph isomorphism on graph classes that exclude a substructure	2020-02-06	Paper
Reconfiguring spanning and induced subgraphs	2020-01-16	Paper
On the maximum weight minimal separator	2019-11-13	Paper
Optimal partition of a tree with social distance	2019-10-15	Paper
On directed covering and domination problems	2019-03-28	Paper
Reconfiguring spanning and induced subgraphs	2018-10-04	Paper
On the Maximum Weight Minimal Separator	2017-05-19	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Tesshu Hanaka