Enumerating connected induced subgraphs: Improved delay and experimental comparison C Komusiewicz, F Sommer
Discrete Applied Mathematics 303, 262-282, 2021
21 2021 Exploiting T Koana, C Komusiewicz, F Sommer
SIAM Journal on Discrete Mathematics 36 (4), 2798-2821, 2022
19 2022 Computing dense and sparse subgraphs of weakly closed graphs T Koana, C Komusiewicz, F Sommer
Algorithmica, 1-32, 2023
18 2023 Covering many (or few) edges with k vertices in sparse graphs T Koana, C Komusiewicz, A Nichterlein, F Sommer
Proceedings of the 39th International Symposium on Theoretical Aspects of …, 2022
11 2022 Approximation algorithms for balancedCC multiwinner rules M Brill, P Faliszewski, F Sommer, N Talmon
Proceedings of the 18th International Conference on Autonomous Agents and …, 2019
11 2019 Essentially tight kernels for (weakly) closed graphs T Koana, C Komusiewicz, F Sommer
Algorithmica, 1-30, 2023
10 2023 Refined parameterizations for computing colored cuts in edge-colored graphs N Morawietz, N Grüttemeier, C Komusiewicz, F Sommer
Theory of Computing Systems 66 (5), 1019-1045, 2022
6 2022 Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic Temporal Graphs E Arrighi, N Grüttemeier, N Morawietz, F Sommer, P Wolf
International Conference on Current Trends in Theory and Practice of …, 2023
5 2023 Colored cut games N Morawietz, N Grüttemeier, C Komusiewicz, F Sommer
Theoretical Computer Science 936, 13-32, 2022
4 2022 Destroying Bicolored N Grüttemeier, C Komusiewicz, J Schestag, F Sommer
Discrete Mathematics & Theoretical Computer Science 23 (Graph Theory), 2021
4 2021 FixCon: A generic solver for fixed-cardinality subgraph problems C Komusiewicz, F Sommer
2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and …, 2020
4 2020 Destroying multicolored paths and cycles in edge-colored graphs NJ Eckstein, N Grüttemeier, C Komusiewicz, F Sommer
Discrete Mathematics & Theoretical Computer Science 25 (Graph Theory), 2023
3 2023 Preventing Small (s,t)-Cuts by Protecting Edges N Grüttemeier, C Komusiewicz, N Morawietz, F Sommer
International Workshop on Graph-Theoretic Concepts in Computer Science, 143-155, 2021
3 2021 Parameterized algorithms for module map problems F Sommer, C Komusiewicz
Discrete Applied Mathematics 283, 396-416, 2020
3 2020 On the complexity of community-aware network sparsification E Herrendorf, C Komusiewicz, N Morawietz, F Sommer
arXiv preprint arXiv:2402.15494, 2024
2 2024 On Computing Optimal Tree Ensembles C Komusiewicz, P Kunz, F Sommer, M Sorge
Proceedings of the 40th International Conference on Machine Learning (ICML 2023), 2023
2 2023 On Critical Node Problems with Vulnerable Vertices J Schestag, N Grüttemeier, C Komusiewicz, F Sommer
International Workshop on Combinatorial Algorithms, 494-508, 2022
2 2022 String Factorizations Under Various Collision Constraints N Grüttemeier, C Komusiewicz, N Morawietz, F Sommer
Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching …, 2020
2 2020 The Parameterized Complexity of s -Club with Triangle and Seed Constraints J Garvardt, C Komusiewicz, F Sommer
Theory of Computing Systems 67 (5), 1050-1081, 2023
1 2023 On the Complexity of Finding a Sparse Connected Spanning Subgraph in a non-Uniform Failure Model M Bentert, J Schestag, F Sommer
Proceedings of the 18th International Symposium on Parameterized and Exact …, 2023
1 2023 
Christian KomusiewiczFriedrich-Schiller-Universität JenaDirección de correo verificada de uni-jena.de
