Tomohiro Koana

PhD Student at TU Berlin

About Me

I do research in theoretical computer science. I am primarily interested in the design of combinatorial algorithms for NP-hard problems.

Publications

Exploiting c-Clousre in Kernelization Algorithms for Graph Problems

Tomohiro Koana, Christian Komusiewicz, Frank Sommer.
ESA 2020 (to appear) | arXiv

Complexity of Combinatorial Matrix Completion With Diameter Constraints

Tomohiro Koana, Vincent Froese, Rolf Niedermeier.
arXiv

Parameterized Algorithms for Matrix Completion With Radius Constraints

Tomohiro Koana, Vincent Froese, Rolf Niedermeier.
CPM 2020 | arXiv

Parameterized Complexity of Geodetic Set

Leon Kellerhals, Tomohiro Koana.
arXiv

Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments

Tomohiro Koana, Viatcheslav Korenwein, André Nichterlein, Rolf Niedermeier, Philipp Zschoche.
arXiv

Parameterized Complexity of Min-Power Asymmetric Connectivity

Matthias Bentert, Roman Haag, Chris Hofer, Tomohiro Koana, André Nichterlein.
IWOCA (2019) | arXiv