Tomohiro Koana

Publication Activity (10 Years)

Years Active: 2019-2024
Publications (10 Years): 57

Top Topics

Matrix Completion

Parameterized Complexity

Subgraph Mining

Top Venues

Publications

Eduard Eiben, Tomohiro Koana, Magnus Wahlström
Determinantal Sieving. SODA (2024)
Tomohiro Koana, Magnus Wahlström
Faster algorithms on linear delta-matroids. CoRR (2024)
Matthias Bentert, Klaus Heeger, Tomohiro Koana
Fully Polynomial-time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication. CoRR (2024)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Tomohiro Koana
FPT approximation and subexponential algorithms for covering few or many edges. Inf. Process. Lett. 185 (2024)
Niclas Boehmer, Tomohiro Koana
The Complexity of Finding Fair Many-to-One Matchings. ACM Trans. Algorithms 20 (2) (2024)
Niclas Boehmer, Tomohiro Koana, Rolf Niedermeier
A refined complexity analysis of fair districting over graphs. Auton. Agents Multi Agent Syst. 37 (1) (2023)
Lito Goldmann, Leon Kellerhals, Tomohiro Koana
Structural Parameterizations of the Biclique-Free Vertex Deletion Problem. CoRR (2023)
Tomohiro Koana, Christian Komusiewicz, Frank Sommer
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs. Algorithmica 85 (7) (2023)
Aleksander Figiel, Tomohiro Koana, André Nichterlein, Niklas Wünsche
Correlating Theory and Practice in Finding Clubs and Plexes. ESA (2023)
Tomohiro Koana, Vincent Froese, Rolf Niedermeier
The complexity of binary matrix completion under diameter constraints. J. Comput. Syst. Sci. 132 (2023)
Eduard Eiben, Tomohiro Koana, Magnus Wahlström
Determinantal Sieving. CoRR (2023)
Matthias Bentert, Klaus Heeger, Tomohiro Koana
Fully Polynomial-Time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication. ESA (2023)
Matthias Bentert, Tomohiro Koana, Rolf Niedermeier
The complexity of gerrymandering over graphs: Paths and trees. Discret. Appl. Math. 324 (2023)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Tomohiro Koana
FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges. MFCS (2023)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Tomohiro Koana
FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges. CoRR (2023)
Matthias Bentert, Niclas Boehmer, Klaus Heeger, Tomohiro Koana
Stable matching with multilayer approval preferences: Approvals can be harder than strict preferences. Games Econ. Behav. 142 (2023)
Tomohiro Koana, Christian Komusiewicz, Frank Sommer
Essentially Tight Kernels for (Weakly) Closed Graphs. Algorithmica 85 (6) (2023)
Leon Kellerhals, Tomohiro Koana, Pascal Kunz, Rolf Niedermeier
Parameterized Algorithms for Colored Clustering. CoRR (2023)
Leon Kellerhals, Tomohiro Koana, Pascal Kunz, Rolf Niedermeier
Parameterized Algorithms for Colored Clustering. AAAI (2023)
Tomohiro Koana
Induced Matching Below Guarantees: Average Paves the Way for Fixed-Parameter Tractability. STACS (2023)
Leon Kellerhals, Tomohiro Koana, Pascal Kunz
Vertex Cover and Feedback Vertex Set Above and Below Structural Guarantees. CoRR (2022)
Matthias Bentert, Niclas Boehmer, Klaus Heeger, Tomohiro Koana
Stable Matching with Multilayer Approval Preferences: Approvals Can Be Harder Than Strict Preferences. SAGT (2022)
Tomohiro Koana, Christian Komusiewicz, Frank Sommer
Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems. SIAM J. Discret. Math. 36 (4) (2022)
Tomohiro Koana, Christian Komusiewicz, André Nichterlein, Frank Sommer
Covering Many (or Few) Edges with k Vertices in Sparse Graphs. CoRR (2022)
Aleksander Figiel, Tomohiro Koana, André Nichterlein, Niklas Wünsche
Correlating Theory and Practice in Finding Clubs and Plexes. CoRR (2022)
Tomohiro Koana, André Nichterlein, Niklas Wünsche
Kernelization for Partial Vertex Cover via (Additive) Expansion Lemma. CoRR (2022)
Leon Kellerhals, Tomohiro Koana, Pascal Kunz
Vertex Cover and Feedback Vertex Set Above and Below Structural Guarantees. IPEC (2022)
Matthias Bentert, Niclas Boehmer, Klaus Heeger, Tomohiro Koana
Stable Matching with Multilayer Approval Preferences: Approvals can be Harder than Strict Preferences. CoRR (2022)
Tomohiro Koana
Induced Matching below Guarantees: Average Paves the Way for Fixed-Parameter Tractability. CoRR (2022)
Niclas Boehmer, Tomohiro Koana
The Complexity of Finding Fair Many-To-One Matchings. ICALP (2022)
Leon Kellerhals, Tomohiro Koana
Parameterized Complexity of Geodetic Set. J. Graph Algorithms Appl. 26 (4) (2022)
Niclas Boehmer, Tomohiro Koana
The Complexity of Finding Fair Many-to-One Matchings. CoRR (2022)
Niclas Boehmer, Tomohiro Koana, Rolf Niedermeier
A Refined Complexity Analysis of Fair Districting over Graphs. AAMAS (2022)
Tomohiro Koana, Christian Komusiewicz, André Nichterlein, Frank Sommer
Covering Many (Or Few) Edges with k Vertices in Sparse Graphs. STACS (2022)
Tomohiro Koana, André Nichterlein
Detecting and enumerating small induced subgraphs in c-closed graphs. Discret. Appl. Math. 302 (2021)
Tomohiro Koana, Christian Komusiewicz, Frank Sommer
Essentially Tight Kernels For (Weakly) Closed Graphs. ISAAC (2021)
Tomohiro Koana, Christian Komusiewicz, Frank Sommer
Essentially Tight Kernels for (Weakly) Closed Graphs. CoRR (2021)
Matthias Bentert, Tomohiro Koana, Rolf Niedermeier
The Complexity of Gerrymandering Over Graphs: Paths and Trees. CoRR (2021)
Leon Kellerhals, Tomohiro Koana, André Nichterlein, Philipp Zschoche
The PACE 2021 Parameterized Algorithms and Computational Experiments Challenge: Cluster Editing. IPEC (2021)
Tomohiro Koana, Vincent Froese, Rolf Niedermeier
Binary Matrix Completion Under Diameter Constraints. STACS (2021)
Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein
Correction to: Parameterized Complexity of Min-Power Asymmetric Connectivity. Theory Comput. Syst. 65 (7) (2021)
Tomohiro Koana, Viatcheslav Korenwein, André Nichterlein, Rolf Niedermeier, Philipp Zschoche
Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments. ACM J. Exp. Algorithmics 26 (2021)
Matthias Bentert, Tomohiro Koana, Rolf Niedermeier
The Complexity of Gerrymandering over Graphs: Paths and Trees. WG (2021)
Niclas Boehmer, Tomohiro Koana, Rolf Niedermeier
A Refined Complexity Analysis of Fair Districting over Graphs. CoRR (2021)
Tomohiro Koana, Vincent Froese, Rolf Niedermeier
Parameterized Algorithms for Matrix Completion with Radius Constraints. CPM (2020)
Tomohiro Koana, Christian Komusiewicz, Frank Sommer
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs. ISAAC (2020)
Tomohiro Koana, Christian Komusiewicz, Frank Sommer
Exploiting c-Closure in Kernelization Algorithms for Graph Problems. ESA (2020)
Tomohiro Koana, Vincent Froese, Rolf Niedermeier
Complexity of Combinatorial Matrix Completion With Diameter Constraints. CoRR (2020)
Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein
Parameterized Complexity of Min-Power Asymmetric Connectivity. CoRR (2020)
Leon Kellerhals, Tomohiro Koana
Parameterized Complexity of Geodetic Set. CoRR (2020)
Tomohiro Koana, Christian Komusiewicz, Frank Sommer
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs. CoRR (2020)
Leon Kellerhals, Tomohiro Koana
Parameterized Complexity of Geodetic Set. IPEC (2020)
Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein
Parameterized Complexity of Min-Power Asymmetric Connectivity. Theory Comput. Syst. 64 (7) (2020)
Tomohiro Koana, André Nichterlein
Detecting and Enumerating Small Induced Subgraphs in c-Closed Graphs. CoRR (2020)
Tomohiro Koana, Christian Komusiewicz, Frank Sommer
Exploiting $\mathbf{c}$-Closure in Kernelization Algorithms for Graph Problems. CoRR (2020)
Tomohiro Koana, Vincent Froese, Rolf Niedermeier
Parameterized Algorithms for Matrix Completion With Radius Constraints. CoRR (2020)
Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein
Parameterized Complexity of Min-Power Asymmetric Connectivity. IWOCA (2019)