Tomohiro Koana

72 papers A* 3A 9B 12C 1Journal 46

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Determinantal Sieving. TheoretiCS Eduard Eiben, Tomohiro Koana, Magnus Wahlström
2025	J	`jnl`	FPT algorithms over linear delta-matroids with applications. CoRR Eduard Eiben, Tomohiro Koana, Magnus Wahlström
2025	A	`conf`	Faster Algorithms on Linear Delta-Matroids. STACS Tomohiro Koana, Magnus Wahlström
2025	A	`conf`	Faster Edge Coloring by Partition Sieving. STACS Shyan Akmal, Tomohiro Koana
2025	J	`jnl`	Faster Edge Coloring by Partition Sieving. CoRR Shyan Akmal, Tomohiro Koana
2025	J	`jnl`	Faster Minimization of Total Weighted Completion Time on Parallel Machines. CoRR Danny Hermelin, Tomohiro Koana, Dvir Shabtay
2025	B	`conf`	Graph Coloring Below Guarantees via Co-Triangle Packing. ISAAC Shyan Akmal, Tomohiro Koana
2025	J	`jnl`	Graph Coloring Below Guarantees via Co-Triangle Packing. CoRR Shyan Akmal, Tomohiro Koana
2025	J	`jnl`	Kronecker scaling of tensors with applications to arithmetic circuits and algorithms. CoRR Andreas Björklund, Petteri Kaski, Tomohiro Koana, Jesper Nederlof
2024	B	`conf`	A Polynomial Time Algorithm for Steiner Tree When Terminals Avoid a Rooted K₄-Minor. IPEC Carla Groenland, Jesper Nederlof, Tomohiro Koana
2024	J	`jnl`	A Polynomial Time Algorithm for Steiner Tree when Terminals Avoid a K CoRR Carla Groenland, Jesper Nederlof, Tomohiro Koana
2024	A*	`conf`	Determinantal Sieving. SODA Eduard Eiben, Tomohiro Koana, Magnus Wahlström
2024	J	`jnl`	FPT approximation and subexponential algorithms for covering few or many edges. Inf. Process. Lett. Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Tomohiro Koana
2024	J	`jnl`	Faster algorithms on linear delta-matroids. CoRR Tomohiro Koana, Magnus Wahlström
2024	J	`jnl`	Fully Polynomial-time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication. CoRR Matthias Bentert, Klaus Heeger, Tomohiro Koana
2024	—	`—`	New parameterized algorithms for matching and packing problems (Neue parametrisierte Algorithmen für Matching- und Packprobleme) Tomohiro Koana
2024	J	`jnl`	Structural Parameterizations of the Biclique-Free Vertex Deletion Problem. Discret. Math. Theor. Comput. Sci. Lito Goldmann, Leon Kellerhals, Tomohiro Koana
2024	B	`conf`	Subexponential Algorithms for Clique Cover on Unit Disk and Unit Ball Graphs. IPEC Tomohiro Koana, Nidhi Purohit, Kirill Simonov
2024	J	`jnl`	Subexponential Algorithms for Clique Cover on Unit Disk and Unit Ball Graphs. CoRR Tomohiro Koana, Nidhi Purohit, Kirill Simonov
2024	J	`jnl`	The Complexity of Finding Fair Many-to-One Matchings. ACM Trans. Algorithms Niclas Boehmer, Tomohiro Koana
2023	J	`jnl`	A refined complexity analysis of fair districting over graphs. Auton. Agents Multi Agent Syst. Niclas Boehmer, Tomohiro Koana, Rolf Niedermeier
2023	J	`jnl`	Computing Dense and Sparse Subgraphs of Weakly Closed Graphs. Algorithmica Tomohiro Koana, Christian Komusiewicz, Frank Sommer
2023	A	`conf`	Correlating Theory and Practice in Finding Clubs and Plexes. ESA Aleksander Figiel, Tomohiro Koana, André Nichterlein, Niklas Wünsche
2023	J	`jnl`	Determinantal Sieving. CoRR Eduard Eiben, Tomohiro Koana, Magnus Wahlström
2023	J	`jnl`	Essentially Tight Kernels for (Weakly) Closed Graphs. Algorithmica Tomohiro Koana, Christian Komusiewicz, Frank Sommer
2023	B	`conf`	FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges. MFCS Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Tomohiro Koana
2023	J	`jnl`	FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges. CoRR Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Tomohiro Koana
2023	A	`conf`	Fully Polynomial-Time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication. ESA Matthias Bentert, Klaus Heeger, Tomohiro Koana
2023	A	`conf`	Induced Matching Below Guarantees: Average Paves the Way for Fixed-Parameter Tractability. STACS Tomohiro Koana
2023	A*	`conf`	Parameterized Algorithms for Colored Clustering. AAAI Leon Kellerhals, Tomohiro Koana, Pascal Kunz, Rolf Niedermeier
2023	J	`jnl`	Parameterized Algorithms for Colored Clustering. CoRR Leon Kellerhals, Tomohiro Koana, Pascal Kunz, Rolf Niedermeier
2023	J	`jnl`	Stable matching with multilayer approval preferences: Approvals can be harder than strict preferences. Games Econ. Behav. Matthias Bentert, Niclas Boehmer, Klaus Heeger, Tomohiro Koana
2023	J	`jnl`	Structural Parameterizations of the Biclique-Free Vertex Deletion Problem. CoRR Lito Goldmann, Leon Kellerhals, Tomohiro Koana
2023	J	`jnl`	The complexity of binary matrix completion under diameter constraints. J. Comput. Syst. Sci. Tomohiro Koana, Vincent Froese, Rolf Niedermeier
2023	J	`jnl`	The complexity of gerrymandering over graphs: Paths and trees. Discret. Appl. Math. Matthias Bentert, Tomohiro Koana, Rolf Niedermeier
2022	A	`conf`	A Refined Complexity Analysis of Fair Districting over Graphs. AAMAS Niclas Boehmer, Tomohiro Koana, Rolf Niedermeier
2022	J	`jnl`	Correlating Theory and Practice in Finding Clubs and Plexes. CoRR Aleksander Figiel, Tomohiro Koana, André Nichterlein, Niklas Wünsche
2022	A	`conf`	Covering Many (Or Few) Edges with k Vertices in Sparse Graphs. STACS Tomohiro Koana, Christian Komusiewicz, André Nichterlein, Frank Sommer
2022	J	`jnl`	Covering Many (or Few) Edges with k Vertices in Sparse Graphs. CoRR Tomohiro Koana, Christian Komusiewicz, André Nichterlein, Frank Sommer
2022	J	`jnl`	Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems. SIAM J. Discret. Math. Tomohiro Koana, Christian Komusiewicz, Frank Sommer
2022	J	`jnl`	Induced Matching below Guarantees: Average Paves the Way for Fixed-Parameter Tractability. CoRR Tomohiro Koana
2022	J	`jnl`	Kernelization for Partial Vertex Cover via (Additive) Expansion Lemma. CoRR Tomohiro Koana, André Nichterlein, Niklas Wünsche
2022	J	`jnl`	Parameterized Complexity of Geodetic Set. J. Graph Algorithms Appl. Leon Kellerhals, Tomohiro Koana
2022	B	`conf`	Stable Matching with Multilayer Approval Preferences: Approvals Can Be Harder Than Strict Preferences. SAGT Matthias Bentert, Niclas Boehmer, Klaus Heeger, Tomohiro Koana
2022	J	`jnl`	Stable Matching with Multilayer Approval Preferences: Approvals can be Harder than Strict Preferences. CoRR Matthias Bentert, Niclas Boehmer, Klaus Heeger, Tomohiro Koana
2022	A*	`conf`	The Complexity of Finding Fair Many-To-One Matchings. ICALP Niclas Boehmer, Tomohiro Koana
2022	J	`jnl`	The Complexity of Finding Fair Many-to-One Matchings. CoRR Niclas Boehmer, Tomohiro Koana
2022	B	`conf`	Vertex Cover and Feedback Vertex Set Above and Below Structural Guarantees. IPEC Leon Kellerhals, Tomohiro Koana, Pascal Kunz
2022	J	`jnl`	Vertex Cover and Feedback Vertex Set Above and Below Structural Guarantees. CoRR Leon Kellerhals, Tomohiro Koana, Pascal Kunz
2021	J	`jnl`	A Refined Complexity Analysis of Fair Districting over Graphs. CoRR Niclas Boehmer, Tomohiro Koana, Rolf Niedermeier
2021	A	`conf`	Binary Matrix Completion Under Diameter Constraints. STACS Tomohiro Koana, Vincent Froese, Rolf Niedermeier
2021	J	`jnl`	Correction to: Parameterized Complexity of Min-Power Asymmetric Connectivity. Theory Comput. Syst. Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein
2021	J	`jnl`	Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments. ACM J. Exp. Algorithmics Tomohiro Koana, Viatcheslav Korenwein, André Nichterlein, Rolf Niedermeier, Philipp Zschoche
2021	J	`jnl`	Detecting and enumerating small induced subgraphs in c-closed graphs. Discret. Appl. Math. Tomohiro Koana, André Nichterlein
2021	B	`conf`	Essentially Tight Kernels For (Weakly) Closed Graphs. ISAAC Tomohiro Koana, Christian Komusiewicz, Frank Sommer
2021	J	`jnl`	Essentially Tight Kernels for (Weakly) Closed Graphs. CoRR Tomohiro Koana, Christian Komusiewicz, Frank Sommer
2021	J	`jnl`	The Complexity of Gerrymandering Over Graphs: Paths and Trees. CoRR Matthias Bentert, Tomohiro Koana, Rolf Niedermeier
2021	B	`conf`	The Complexity of Gerrymandering over Graphs: Paths and Trees. WG Matthias Bentert, Tomohiro Koana, Rolf Niedermeier
2021	B	`conf`	The PACE 2021 Parameterized Algorithms and Computational Experiments Challenge: Cluster Editing. IPEC Leon Kellerhals, Tomohiro Koana, André Nichterlein, Philipp Zschoche
2020	J	`jnl`	Complexity of Combinatorial Matrix Completion With Diameter Constraints. CoRR Tomohiro Koana, Vincent Froese, Rolf Niedermeier
2020	B	`conf`	Computing Dense and Sparse Subgraphs of Weakly Closed Graphs. ISAAC Tomohiro Koana, Christian Komusiewicz, Frank Sommer
2020	J	`jnl`	Computing Dense and Sparse Subgraphs of Weakly Closed Graphs. CoRR Tomohiro Koana, Christian Komusiewicz, Frank Sommer
2020	J	`jnl`	Detecting and Enumerating Small Induced Subgraphs in c-Closed Graphs. CoRR Tomohiro Koana, André Nichterlein
2020	J	`jnl`	Exploiting $\mathbf{c}$-Closure in Kernelization Algorithms for Graph Problems. CoRR Tomohiro Koana, Christian Komusiewicz, Frank Sommer
2020	A	`conf`	Exploiting c-Closure in Kernelization Algorithms for Graph Problems. ESA Tomohiro Koana, Christian Komusiewicz, Frank Sommer
2020	J	`jnl`	Parameterized Algorithms for Matrix Completion With Radius Constraints. CoRR Tomohiro Koana, Vincent Froese, Rolf Niedermeier
2020	B	`conf`	Parameterized Algorithms for Matrix Completion with Radius Constraints. CPM Tomohiro Koana, Vincent Froese, Rolf Niedermeier
2020	B	`conf`	Parameterized Complexity of Geodetic Set. IPEC Leon Kellerhals, Tomohiro Koana
2020	J	`jnl`	Parameterized Complexity of Geodetic Set. CoRR Leon Kellerhals, Tomohiro Koana
2020	J	`jnl`	Parameterized Complexity of Min-Power Asymmetric Connectivity. CoRR Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein
2020	J	`jnl`	Parameterized Complexity of Min-Power Asymmetric Connectivity. Theory Comput. Syst. Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein
2019	C	`conf`	Parameterized Complexity of Min-Power Asymmetric Connectivity. IWOCA Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein