default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTomohiro Koana
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[b1]Tomohiro Koana:
New parameterized algorithms for matching and packing problems (Neue parametrisierte Algorithmen für Matching- und Packprobleme). TU Berlin, Germany, 2024- [j14]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: 106471 (2024) - [j13]Niclas Boehmer, Tomohiro Koana:
The Complexity of Finding Fair Many-to-One Matchings. ACM Trans. Algorithms 20(2): 17 (2024) - [c20]Eduard Eiben, Tomohiro Koana, Magnus Wahlström:
Determinantal Sieving. SODA 2024: 377-423 - [i23]Tomohiro Koana, Magnus Wahlström:
Faster algorithms on linear delta-matroids. CoRR abs/2402.11596 (2024) - [i22]Matthias Bentert, Klaus Heeger, Tomohiro Koana:
Fully Polynomial-time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication. CoRR abs/2403.01839 (2024) - 2023
- [j12]Niclas Boehmer, Tomohiro Koana, Rolf Niedermeier:
A refined complexity analysis of fair districting over graphs. Auton. Agents Multi Agent Syst. 37(1): 13 (2023) - [j11]Tomohiro Koana, Christian Komusiewicz, Frank Sommer:
Essentially Tight Kernels for (Weakly) Closed Graphs. Algorithmica 85(6): 1706-1735 (2023) - [j10]Tomohiro Koana, Christian Komusiewicz, Frank Sommer:
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs. Algorithmica 85(7): 2156-2187 (2023) - [j9]Matthias Bentert, Tomohiro Koana, Rolf Niedermeier:
The complexity of gerrymandering over graphs: Paths and trees. Discret. Appl. Math. 324: 103-112 (2023) - [j8]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: 508-526 (2023) - [j7]Tomohiro Koana, Vincent Froese, Rolf Niedermeier:
The complexity of binary matrix completion under diameter constraints. J. Comput. Syst. Sci. 132: 45-67 (2023) - [c19]Leon Kellerhals, Tomohiro Koana, Pascal Kunz, Rolf Niedermeier:
Parameterized Algorithms for Colored Clustering. AAAI 2023: 4400-4408 - [c18]Matthias Bentert, Klaus Heeger, Tomohiro Koana:
Fully Polynomial-Time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication. ESA 2023: 16:1-16:16 - [c17]Aleksander Figiel, Tomohiro Koana, André Nichterlein, Niklas Wünsche:
Correlating Theory and Practice in Finding Clubs and Plexes. ESA 2023: 47:1-47:18 - [c16]Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Tomohiro Koana:
FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges. MFCS 2023: 46:1-46:8 - [c15]Tomohiro Koana:
Induced Matching Below Guarantees: Average Paves the Way for Fixed-Parameter Tractability. STACS 2023: 39:1-39:21 - [i21]Leon Kellerhals, Tomohiro Koana, Pascal Kunz, Rolf Niedermeier:
Parameterized Algorithms for Colored Clustering. CoRR abs/2302.00630 (2023) - [i20]Eduard Eiben, Tomohiro Koana, Magnus Wahlström:
Determinantal Sieving. CoRR abs/2304.02091 (2023) - [i19]Lito Goldmann, Leon Kellerhals, Tomohiro Koana:
Structural Parameterizations of the Biclique-Free Vertex Deletion Problem. CoRR abs/2308.00501 (2023) - [i18]Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Tomohiro Koana:
FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges. CoRR abs/2308.15546 (2023) - 2022
- [j6]Leon Kellerhals, Tomohiro Koana:
Parameterized Complexity of Geodetic Set. J. Graph Algorithms Appl. 26(4): 401-419 (2022) - [j5]Tomohiro Koana, Christian Komusiewicz, Frank Sommer:
Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems. SIAM J. Discret. Math. 36(4): 2798-2821 (2022) - [c14]Niclas Boehmer, Tomohiro Koana, Rolf Niedermeier:
A Refined Complexity Analysis of Fair Districting over Graphs. AAMAS 2022: 1548-1550 - [c13]Niclas Boehmer, Tomohiro Koana:
The Complexity of Finding Fair Many-To-One Matchings. ICALP 2022: 27:1-27:18 - [c12]Leon Kellerhals, Tomohiro Koana, Pascal Kunz:
Vertex Cover and Feedback Vertex Set Above and Below Structural Guarantees. IPEC 2022: 19:1-19:14 - [c11]Matthias Bentert, Niclas Boehmer, Klaus Heeger, Tomohiro Koana:
Stable Matching with Multilayer Approval Preferences: Approvals Can Be Harder Than Strict Preferences. SAGT 2022: 436-453 - [c10]Tomohiro Koana, Christian Komusiewicz, André Nichterlein, Frank Sommer:
Covering Many (Or Few) Edges with k Vertices in Sparse Graphs. STACS 2022: 42:1-42:18 - [i17]Tomohiro Koana, Christian Komusiewicz, André Nichterlein, Frank Sommer:
Covering Many (or Few) Edges with k Vertices in Sparse Graphs. CoRR abs/2201.05465 (2022) - [i16]Leon Kellerhals, Tomohiro Koana, Pascal Kunz:
Vertex Cover and Feedback Vertex Set Above and Below Structural Guarantees. CoRR abs/2203.05887 (2022) - [i15]Matthias Bentert, Niclas Boehmer, Klaus Heeger, Tomohiro Koana:
Stable Matching with Multilayer Approval Preferences: Approvals can be Harder than Strict Preferences. CoRR abs/2205.07550 (2022) - [i14]Niclas Boehmer, Tomohiro Koana:
The Complexity of Finding Fair Many-to-One Matchings. CoRR abs/2206.06988 (2022) - [i13]Tomohiro Koana, André Nichterlein, Niklas Wünsche:
Kernelization for Partial Vertex Cover via (Additive) Expansion Lemma. CoRR abs/2211.07001 (2022) - [i12]Aleksander Figiel, Tomohiro Koana, André Nichterlein, Niklas Wünsche:
Correlating Theory and Practice in Finding Clubs and Plexes. CoRR abs/2212.07533 (2022) - [i11]Tomohiro Koana:
Induced Matching below Guarantees: Average Paves the Way for Fixed-Parameter Tractability. CoRR abs/2212.13962 (2022) - 2021
- [j4]Tomohiro Koana, André Nichterlein:
Detecting and enumerating small induced subgraphs in c-closed graphs. Discret. Appl. Math. 302: 198-207 (2021) - [j3]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: 1.3:1-1.3:30 (2021) - [j2]Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein:
Correction to: Parameterized Complexity of Min-Power Asymmetric Connectivity. Theory Comput. Syst. 65(7): 1141-1142 (2021) - [c9]Tomohiro Koana, Christian Komusiewicz, Frank Sommer:
Essentially Tight Kernels For (Weakly) Closed Graphs. ISAAC 2021: 35:1-35:15 - [c8]Leon Kellerhals, Tomohiro Koana, André Nichterlein, Philipp Zschoche:
The PACE 2021 Parameterized Algorithms and Computational Experiments Challenge: Cluster Editing. IPEC 2021: 26:1-26:18 - [c7]Tomohiro Koana, Vincent Froese, Rolf Niedermeier:
Binary Matrix Completion Under Diameter Constraints. STACS 2021: 47:1-47:14 - [c6]Matthias Bentert, Tomohiro Koana, Rolf Niedermeier:
The Complexity of Gerrymandering over Graphs: Paths and Trees. WG 2021: 195-206 - [i10]Matthias Bentert, Tomohiro Koana, Rolf Niedermeier:
The Complexity of Gerrymandering Over Graphs: Paths and Trees. CoRR abs/2102.08905 (2021) - [i9]Niclas Boehmer, Tomohiro Koana, Rolf Niedermeier:
A Refined Complexity Analysis of Fair Districting over Graphs. CoRR abs/2102.11864 (2021) - [i8]Tomohiro Koana, Christian Komusiewicz, Frank Sommer:
Essentially Tight Kernels for (Weakly) Closed Graphs. CoRR abs/2103.03914 (2021) - 2020
- [j1]Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein:
Parameterized Complexity of Min-Power Asymmetric Connectivity. Theory Comput. Syst. 64(7): 1158-1182 (2020) - [c5]Tomohiro Koana, Vincent Froese, Rolf Niedermeier:
Parameterized Algorithms for Matrix Completion with Radius Constraints. CPM 2020: 20:1-20:14 - [c4]Tomohiro Koana, Christian Komusiewicz, Frank Sommer:
Exploiting c-Closure in Kernelization Algorithms for Graph Problems. ESA 2020: 65:1-65:17 - [c3]Tomohiro Koana, Christian Komusiewicz, Frank Sommer:
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs. ISAAC 2020: 20:1-20:17 - [c2]Leon Kellerhals, Tomohiro Koana:
Parameterized Complexity of Geodetic Set. IPEC 2020: 20:1-20:14 - [i7]Leon Kellerhals, Tomohiro Koana:
Parameterized Complexity of Geodetic Set. CoRR abs/2001.03098 (2020) - [i6]Tomohiro Koana, Vincent Froese, Rolf Niedermeier:
Parameterized Algorithms for Matrix Completion With Radius Constraints. CoRR abs/2002.00645 (2020) - [i5]Tomohiro Koana, Vincent Froese, Rolf Niedermeier:
Complexity of Combinatorial Matrix Completion With Diameter Constraints. CoRR abs/2002.05068 (2020) - [i4]Tomohiro Koana, Christian Komusiewicz, Frank Sommer:
Exploiting $\mathbf{c}$-Closure in Kernelization Algorithms for Graph Problems. CoRR abs/2005.03986 (2020) - [i3]Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein:
Parameterized Complexity of Min-Power Asymmetric Connectivity. CoRR abs/2005.14620 (2020) - [i2]Tomohiro Koana, Christian Komusiewicz, Frank Sommer:
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs. CoRR abs/2007.05630 (2020) - [i1]Tomohiro Koana, André Nichterlein:
Detecting and Enumerating Small Induced Subgraphs in c-Closed Graphs. CoRR abs/2007.12077 (2020)
2010 – 2019
- 2019
- [c1]Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein:
Parameterized Complexity of Min-Power Asymmetric Connectivity. IWOCA 2019: 85-96
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
