Tomohiro Koana

From MaRDI portal
Person:2032276

Available identifiers

zbMath Open koana.tomohiroMaRDI QIDQ2032276

List of research outcomes





PublicationDate of PublicationType
Fully polynomial-time algorithms parameterized by vertex integrity using fast matrix multiplication2025-01-06Paper
Correlating theory and practice in finding clubs and plexes2025-01-06Paper
FPT approximation and subexponential algorithms for covering few or many edges2024-12-03Paper
Determinantal sieving2024-11-28Paper
Induced matching below guarantees: average paves the way for fixed-parameter tractability2024-10-08Paper
The complexity of finding fair many-to-one matchings2024-06-24Paper
Covering many (or few) edges with \(k\) vertices in sparse graphs2024-04-23Paper
FPT approximation and subexponential algorithms for covering few or many edges2024-03-13Paper
https://portal.mardi4nfdi.de/entity/Q61924942024-02-12Paper
https://portal.mardi4nfdi.de/entity/Q61475372024-01-15Paper
Stable matching with multilayer approval preferences: approvals can be harder than strict preferences2024-01-11Paper
https://portal.mardi4nfdi.de/entity/Q60654172023-11-14Paper
Parameterized Complexity of Geodetic Set2023-11-13Paper
Stable matching with multilayer approval preferences: approvals can be harder than strict preferences2023-07-28Paper
Computing dense and sparse subgraphs of weakly closed graphs2023-06-28Paper
Essentially tight kernels for (weakly) closed graphs2023-06-05Paper
Exploiting c-Closure in Kernelization Algorithms for Graph Problems2023-02-07Paper
Parameterized Algorithms for Matrix Completion with Radius Constraints.2023-02-07Paper
The complexity of binary matrix completion under diameter constraints2023-01-09Paper
Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems2022-11-15Paper
Parameterized Complexity of Geodetic Set2022-11-14Paper
The complexity of gerrymandering over graphs: paths and trees2022-11-11Paper
Data Reduction for Maximum Matching on Real-World Graphs2022-09-06Paper
The complexity of gerrymandering over graphs: paths and trees2022-06-08Paper
Detecting and enumerating small induced subgraphs in \(c\)-closed graphs2021-08-02Paper
Parameterized complexity of min-power asymmetric connectivity2021-06-11Paper
Parameterized complexity of min-power asymmetric connectivity2020-02-25Paper

Research outcomes over time

This page was built for person: Tomohiro Koana

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:2032276&oldid=6512336"
Powered by MediaWiki