About Me
I do research in theoretical computer science. I am primarily interested in the design of combinatorial algorithms for NP-hard problems.
Publications
Covering Many (or Few) Edges with k Vertices in Sparse Graphs
Tomohiro Koana, Christian Komusiewicz, André Nichterlein, Frank Sommer.
STACS 2022 |
arXiv
A Refined Complexity Analysis of Fair Districting over Graphs
Niclas Boehmer, Tomohiro Koana, Rolf Niedermeier.
AAMAS 2022 (extened abstract to appear) |
arXiv
Essentially Tight Kernels for (Weakly) Closed Graphs
Tomohiro Koana, Christian Komusiewicz, Frank Sommer.
ISAAC 2021 |
arXiv
Complexity of Combinatorial Matrix Completion With Diameter Constraints
Tomohiro Koana, Vincent Froese, Rolf Niedermeier.
STACS 2021 |
arXiv
The Complexity of Gerrymandering Over Graphs: Paths and Trees
Exploiting c-Clousre in Kernelization Algorithms for Graph Problems
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs
Tomohiro Koana, Christian Komusiewicz, Frank Sommer.
ISAAC 2020 |
arXiv
Detecting and Enumerating Small Induced Subgraphs in c-Closed Graphs
Tomohiro Koana, André Nichterlein.
Discrete Appl. Math. |
arXiv
Parameterized Algorithms for Matrix Completion With Radius Constraints
Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments
Tomohiro Koana, Viatcheslav Korenwein, André Nichterlein, Rolf Niedermeier, Philipp Zschoche.
ACM J. Exp. Algorithmics |
arXiv
Parameterized Complexity of Min-Power Asymmetric Connectivity
Matthias Bentert, Roman Haag, Chris Hofer, Tomohiro Koana, André Nichterlein.
Theory Comput. Syst. |
IWOCA 2019 |
arXiv