Data reduction for maximum matching on real-world graphs: Theory and experiments T Koana, V Korenwein, A Nichterlein, R Niedermeier, P Zschoche
Journal of Experimental Algorithmics (JEA) 26, 1-30, 2021
49 2021 Parameterized complexity of geodetic set L Kellerhals, T Koana
arXiv preprint arXiv:2001.03098, 2020
31 2020 The PACE 2021 parameterized algorithms and computational experiments challenge: Cluster editing L Kellerhals, T Koana, A Nichterlein, P Zschoche
16th International Symposium on Parameterized and Exact Computation (IPEC …, 2021
23 2021 Exploiting T Koana, C Komusiewicz, F Sommer
SIAM Journal on Discrete Mathematics, 2022
22 2022 Computing dense and sparse subgraphs of weakly closed graphs T Koana, C Komusiewicz, F Sommer
Algorithmica 85 (7), 2156-2187, 2023
19 2023 Determinantal sieving E Eiben, T Koana, M Wahlström
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024
15 2024 Covering many (or few) edges with k vertices in sparse graphs T Koana, C Komusiewicz, A Nichterlein, F Sommer
39th International Symposium on Theoretical Aspects of Computer Science …, 2022
15 2022 The complexity of binary matrix completion under diameter constraints T Koana, V Froese, R Niedermeier
Journal of Computer and System Sciences 132, 45-67, 2023
13 * 2023 Essentially tight kernels for (weakly) closed graphs T Koana, C Komusiewicz, F Sommer
Algorithmica 85 (6), 1706-1735, 2023
12 2023 Detecting and enumerating small induced subgraphs in c-closed graphs T Koana, A Nichterlein
Discrete Applied Mathematics 302, 198-207, 2021
12 2021 The complexity of finding fair many-to-one matchings N Boehmer, T Koana
49th International Colloquium on Automata, Languages, and Programming (ICALP …, 2022
11 2022 Parameterized Algorithms for Matrix Completion With Radius Constraints T Koana, V Froese, R Niedermeier
31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020) 161, 20:1 …, 2020
10 2020 A refined complexity analysis of fair districting over graphs N Boehmer, T Koana, R Niedermeier
Autonomous Agents and Multi-Agent Systems 37 (1), 13, 2023
9 2023 The complexity of gerrymandering over graphs: paths and trees M Bentert, T Koana, R Niedermeier
Discrete Applied Mathematics 324, 103-112, 2023
9 2023 Stable matching with multilayer approval preferences: approvals can be harder than strict preferences M Bentert, N Boehmer, K Heeger, T Koana
Games and Economic Behavior 142, 508-526, 2023
8 2023 Parameterized complexity of min-power asymmetric connectivity M Bentert, R Haag, C Hofer, T Koana, A Nichterlein
Theory of Computing Systems 64, 1158-1182, 2020
7 2020 Fully polynomial-time algorithms parameterized by vertex integrity using fast matrix multiplication M Bentert, K Heeger, T Koana
arXiv preprint arXiv:2403.01839, 2024
6 2024 Vertex cover and feedback vertex set above and below structural guarantees L Kellerhals, T Koana, P Kunz
arXiv preprint arXiv:2203.05887, 2022
6 2022 Parameterized algorithms for colored clustering L Kellerhals, T Koana, P Kunz, R Niedermeier
Proceedings of the AAAI Conference on Artificial Intelligence 37 (4), 4400-4408, 2023
5 2023 Induced matching below guarantees: average paves the way for fixed-parameter tractability T Koana
arXiv preprint arXiv:2212.13962, 2022
5 2022 
André NichterleinTU BerlinZweryfikowany adres z tu-berlin.de
