Scholar
Tomohiro Koana
Google Scholar ID: PewfzVoAAAAJ
Keio University
Algorithms
Parameterized Complexity
Follow
Google Scholar
↗
Citations & Impact
All-time
Citations
335
H-index
11
i10-index
13
Publications
20
Co-authors
13
list available
Contact
No contact links provided.
Publications
14 items
High-Multiplicity Bin Packing is FPT
2026
Cited
0
Single-Exponential Algorithms and a Polynomial Kernel for Strong Connectivity Augmentation
2026
Cited
0
Graph Coloring with Color Preferences
2026
Cited
0
Complexity of induced subgraph isomorphism and maximum common induced subgraph parameterized by cluster vertex deletion number
2026
Cited
0
A Single-Exponential FPT Algorithm for 2-Vertex-Connectivity Augmentation
2026
Cited
0
Kernelization for $H$-Packing Revisited
2026
Cited
0
New Parameterized and Exact Exponential Time Algorithms for Strongly Connected Steiner Subgraph
2026
Cited
0
Lawler-Moore Speedups via Additive Combinatorics
2026
Cited
0
Load more
Resume (English only)
Co-authors
13 total
André Nichterlein
TU Berlin
Rolf Niedermeier
TU Berlin
Leon Kellerhals
TU Clausthal
Frank Sommer
Technische Universität Wien
Christian Komusiewicz
Friedrich-Schiller-Universität Jena
Matthias Bentert
UiB
Co-author 7
Niclas Boehmer
Hasso Plattner Institute
