Tomohiro Koana

Available identifiers

zbMath Open koana.tomohiroMaRDI QIDQ2032276

List of research outcomes

Publication	Date of Publication	Type
Covering many (or few) edges with $k$ vertices in sparse graphs	2024-04-23	Paper
FPT approximation and subexponential algorithms for covering few or many edges	2024-03-13	Paper
https://portal.mardi4nfdi.de/entity/Q6192494	2024-02-12	Paper
https://portal.mardi4nfdi.de/entity/Q6147537	2024-01-15	Paper
Stable matching with multilayer approval preferences: approvals can be harder than strict preferences	2024-01-11	Paper
https://portal.mardi4nfdi.de/entity/Q6065417	2023-11-14	Paper
Parameterized Complexity of Geodetic Set	2023-11-13	Paper
Stable matching with multilayer approval preferences: approvals can be harder than strict preferences	2023-07-28	Paper
Computing dense and sparse subgraphs of weakly closed graphs	2023-06-28	Paper
Essentially tight kernels for (weakly) closed graphs	2023-06-05	Paper
Parameterized Algorithms for Matrix Completion with Radius Constraints.	2023-02-07	Paper
Exploiting c-Closure in Kernelization Algorithms for Graph Problems	2023-02-07	Paper
The complexity of binary matrix completion under diameter constraints	2023-01-09	Paper
Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems	2022-11-15	Paper
Parameterized Complexity of Geodetic Set	2022-11-14	Paper
The complexity of gerrymandering over graphs: paths and trees	2022-11-11	Paper
Data Reduction for Maximum Matching on Real-World Graphs	2022-09-06	Paper
The complexity of gerrymandering over graphs: paths and trees	2022-06-08	Paper
Detecting and enumerating small induced subgraphs in $c$-closed graphs	2021-08-02	Paper
Parameterized complexity of min-power asymmetric connectivity	2021-06-11	Paper
Parameterized complexity of min-power asymmetric connectivity	2020-02-25	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: Tomohiro Koana

Publication	Date of Publication	Type
Covering many (or few) edges with \(k\) vertices in sparse graphs	2024-04-23	Paper
FPT approximation and subexponential algorithms for covering few or many edges	2024-03-13	Paper
https://portal.mardi4nfdi.de/entity/Q6192494	2024-02-12	Paper
https://portal.mardi4nfdi.de/entity/Q6147537	2024-01-15	Paper
Stable matching with multilayer approval preferences: approvals can be harder than strict preferences	2024-01-11	Paper
https://portal.mardi4nfdi.de/entity/Q6065417	2023-11-14	Paper
Parameterized Complexity of Geodetic Set	2023-11-13	Paper
Stable matching with multilayer approval preferences: approvals can be harder than strict preferences	2023-07-28	Paper
Computing dense and sparse subgraphs of weakly closed graphs	2023-06-28	Paper
Essentially tight kernels for (weakly) closed graphs	2023-06-05	Paper
Parameterized Algorithms for Matrix Completion with Radius Constraints.	2023-02-07	Paper
Exploiting c-Closure in Kernelization Algorithms for Graph Problems	2023-02-07	Paper
The complexity of binary matrix completion under diameter constraints	2023-01-09	Paper
Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems	2022-11-15	Paper
Parameterized Complexity of Geodetic Set	2022-11-14	Paper
The complexity of gerrymandering over graphs: paths and trees	2022-11-11	Paper
Data Reduction for Maximum Matching on Real-World Graphs	2022-09-06	Paper
The complexity of gerrymandering over graphs: paths and trees	2022-06-08	Paper
Detecting and enumerating small induced subgraphs in \(c\)-closed graphs	2021-08-02	Paper
Parameterized complexity of min-power asymmetric connectivity	2021-06-11	Paper
Parameterized complexity of min-power asymmetric connectivity	2020-02-25	Paper