Parameterized Algorithms for Matrix Completion with Radius Constraints. - Tomohiro Koana; Vincent Froese; Rolf Niedermeier (CPM, 2020)

Complexity of Combinatorial Matrix Completion With Diameter Constraints. - Tomohiro Koana; Vincent Froese; Rolf Niedermeier (CoRR, 2020)

Exploiting $ mathbf{c}$-Closure in Kernelization Algorithms for Graph Problems. - Tomohiro Koana; Christian Komusiewicz; Frank Sommer (CoRR, 2020)

Parameterized Complexity of Min-Power Asymmetric Connectivity. - Matthias Bentert; Roman Haag; Christian Hofer; Tomohiro Koana; André Nichterlein (Theory Comput. Syst., 2020)

The PACE 2021 Parameterized Algorithms and Computational Experiments Challenge: Cluster Editing. - Leon Kellerhals; Tomohiro Koana; André Nichterlein; Philipp Zschoche (IPEC, 2021)

Binary Matrix Completion Under Diameter Constraints. - Tomohiro Koana; Vincent Froese; Rolf Niedermeier (STACS, 2021)

Detecting and enumerating small induced subgraphs in c-closed graphs. - Tomohiro Koana; André Nichterlein (Discret. Appl. Math., 2021)

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, 2021)

Correction to: Parameterized Complexity of Min-Power Asymmetric Connectivity. - Matthias Bentert; Roman Haag; Christian Hofer; Tomohiro Koana; André Nichterlein (Theory Comput. Syst., 2021)

Vertex Cover and Feedback Vertex Set Above and Below Structural Guarantees. - Leon Kellerhals; Tomohiro Koana; Pascal Kunz 001 (IPEC, 2022)

Covering Many (Or Few) Edges with k Vertices in Sparse Graphs. - Tomohiro Koana; Christian Komusiewicz; André Nichterlein; Frank Sommer (STACS, 2022)

Kernelization for Partial Vertex Cover via (Additive) Expansion Lemma. - Tomohiro Koana; André Nichterlein; Niklas Wünsche (CoRR, 2022)

Parameterized Complexity of Geodetic Set. - Leon Kellerhals; Tomohiro Koana (J. Graph Algorithms Appl., 2022)

Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems. - Tomohiro Koana; Christian Komusiewicz; Frank Sommer (SIAM J. Discret. Math., 2022)

Parameterized Algorithms for Colored Clustering. - Leon Kellerhals; Tomohiro Koana; Pascal Kunz 001; Rolf Niedermeier (AAAI, 2023)

Fully Polynomial-Time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication. - Matthias Bentert; Klaus Heeger; Tomohiro Koana (ESA, 2023)

Correlating Theory and Practice in Finding Clubs and Plexes. - Aleksander Figiel; Tomohiro Koana; André Nichterlein; Niklas Wünsche (ESA, 2023)

Induced Matching Below Guarantees: Average Paves the Way for Fixed-Parameter Tractability. - Tomohiro Koana (STACS, 2023)

A refined complexity analysis of fair districting over graphs. - Niclas Boehmer; Tomohiro Koana; Rolf Niedermeier (Auton. Agents Multi Agent Syst., 2023)

The complexity of gerrymandering over graphs: Paths and trees. - Matthias Bentert; Tomohiro Koana; Rolf Niedermeier (Discret. Appl. Math., 2023)

The complexity of binary matrix completion under diameter constraints. - Tomohiro Koana; Vincent Froese; Rolf Niedermeier (J. Comput. Syst. Sci., 2023)

Essentially Tight Kernels for (Weakly) Closed Graphs. - Tomohiro Koana; Christian Komusiewicz; Frank Sommer (Algorithmica, 2023)

Computing Dense and Sparse Subgraphs of Weakly Closed Graphs. - Tomohiro Koana; Christian Komusiewicz; Frank Sommer (Algorithmica, 2023)

Stable matching with multilayer approval preferences: Approvals can be harder than strict preferences. - Matthias Bentert; Niclas Boehmer; Klaus Heeger; Tomohiro Koana (Games Econ. Behav., 2023)

A Polynomial Time Algorithm for Steiner Tree When Terminals Avoid a Rooted K₄-Minor. - Carla Groenland; Jesper Nederlof; Tomohiro Koana (IPEC, 2024)

Subexponential Algorithms for Clique Cover on Unit Disk and Unit Ball Graphs. - Tomohiro Koana; Nidhi Purohit; Kirill Simonov (IPEC, 2024)

Determinantal Sieving. - Eduard Eiben; Tomohiro Koana; Magnus Wahlström (SODA, 2024)

A Polynomial Time Algorithm for Steiner Tree when Terminals Avoid a K4-Minor. - Carla Groenland; Jesper Nederlof; Tomohiro Koana (CoRR, 2024)

Structural Parameterizations of the Biclique-Free Vertex Deletion Problem. - Lito Goldmann; Leon Kellerhals; Tomohiro Koana (Discret. Math. Theor. Comput. Sci., 2024)

New parameterized algorithms for matching and packing problems (Neue parametrisierte Algorithmen für Matching- und Packprobleme) - Tomohiro Koana (2024)

FPT approximation and subexponential algorithms for covering few or many edges. - Fedor V. Fomin; Petr A. Golovach; Tanmay Inamdar 002; Tomohiro Koana (Inf. Process. Lett., 2024)

The Complexity of Finding Fair Many-to-One Matchings. - Niclas Boehmer; Tomohiro Koana (ACM Trans. Algorithms, 2024)

Faster Edge Coloring by Partition Sieving. - Shyan Akmal; Tomohiro Koana (STACS, 2025)

Faster Algorithms on Linear Delta-Matroids. - Tomohiro Koana; Magnus Wahlström (STACS, 2025)

Faster Minimization of Total Weighted Completion Time on Parallel Machines. - Danny Hermelin; Tomohiro Koana; Dvir Shabtay (CoRR, 2025)

FPT algorithms over linear delta-matroids with applications. - Eduard Eiben; Tomohiro Koana; Magnus Wahlström (CoRR, 2025)

Kronecker scaling of tensors with applications to arithmetic circuits and algorithms. - Andreas Björklund; Petteri Kaski; Tomohiro Koana; Jesper Nederlof (CoRR, 2025)