| 2026 | ESA | FPT Algorithms over Linear Delta-Matroids with Applications. | Eduard Eiben, Tomohiro Koana, Magnus Wahlstrm |
| 2026 | ESA | Kernelization for H-Packing Revisited. | Tomohiro Koana, Soh Kumabe |
| 2026 | ICALP | Kronecker Scaling of Tensors with Applications to Arithmetic Circuits and Algorithms. | Andreas Bjrklund, Petteri Kaski, Tomohiro Koana, Jesper Nederlof |
| 2025 | ISAAC | Graph Coloring Below Guarantees via Co-Triangle Packing. | Shyan Akmal, Tomohiro Koana |
| 2025 | STACS | Faster Edge Coloring by Partition Sieving. | Shyan Akmal, Tomohiro Koana |
| 2025 | STACS | Faster Algorithms on Linear Delta-Matroids. | Tomohiro Koana, Magnus Wahlstrm |
| 2024 | SODA | Determinantal Sieving. | Eduard Eiben, Tomohiro Koana, Magnus Wahlstrm |
| 2023 | AAAI | Parameterized Algorithms for Colored Clustering. | Leon Kellerhals, Tomohiro Koana, Pascal Kunz, Rolf Niedermeier |
| 2023 | ESA | Fully Polynomial-Time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication. | Matthias Bentert, Klaus Heeger, Tomohiro Koana |
| 2023 | ESA | Correlating Theory and Practice in Finding Clubs and Plexes. | Aleksander Figiel, Tomohiro Koana, Andr Nichterlein, Niklas Wnsche |
| 2023 | MFCS | FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges. | Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Tomohiro Koana |
| 2023 | STACS | Induced Matching Below Guarantees: Average Paves the Way for Fixed-Parameter Tractability. | Tomohiro Koana |
| 2022 | ICALP | The Complexity of Finding Fair Many-To-One Matchings. | Niclas Boehmer, Tomohiro Koana |
| 2022 | STACS | Covering Many (Or Few) Edges with k Vertices in Sparse Graphs. | Tomohiro Koana, Christian Komusiewicz, Andr Nichterlein, Frank Sommer |
| 2022 | SAGT | Stable Matching with Multilayer Approval Preferences: Approvals Can Be Harder Than Strict Preferences. | Matthias Bentert, Niclas Boehmer, Klaus Heeger, Tomohiro Koana |
| 2021 | ISAAC | Essentially Tight Kernels For (Weakly) Closed Graphs. | Tomohiro Koana, Christian Komusiewicz, Frank Sommer |
| 2021 | STACS | Binary Matrix Completion Under Diameter Constraints. | Tomohiro Koana, Vincent Froese, Rolf Niedermeier |
| 2021 | WG | The Complexity of Gerrymandering over Graphs: Paths and Trees. | Matthias Bentert, Tomohiro Koana, Rolf Niedermeier |
| 2020 | CPM | Parameterized Algorithms for Matrix Completion with Radius Constraints. | Tomohiro Koana, Vincent Froese, Rolf Niedermeier |
| 2020 | ESA | Exploiting c-Closure in Kernelization Algorithms for Graph Problems. | Tomohiro Koana, Christian Komusiewicz, Frank Sommer |
| 2020 | ISAAC | Computing Dense and Sparse Subgraphs of Weakly Closed Graphs. | Tomohiro Koana, Christian Komusiewicz, Frank Sommer |
| 2019 | IWOCA | Parameterized Complexity of Min-Power Asymmetric Connectivity. | Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, Andr Nichterlein |