| Enumerating connected induced subgraphs: Improved delay and experimental comparison C Komusiewicz, F Sommer Discrete Applied Mathematics 303, 262-282, 2021 | 26 | 2021 |
| Exploiting -Closure in Kernelization Algorithms for Graph Problems T Koana, C Komusiewicz, F Sommer SIAM Journal on Discrete Mathematics 36 (4), 2798-2821, 2022 | 22 | 2022 |
| Computing dense and sparse subgraphs of weakly closed graphs T Koana, C Komusiewicz, F Sommer Algorithmica, 1-32, 2023 | 19 | 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 | 15 | 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 | 13 | 2019 |
| Essentially tight kernels for (weakly) closed graphs T Koana, C Komusiewicz, F Sommer Algorithmica, 1-30, 2023 | 12 | 2023 |
| 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 | 9 | 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 | 9 | 2022 |
| 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 | 6 | 2023 |
| Exact algorithms for group closeness centrality LP Staus, C Komusiewicz, N Morawietz, F Sommer SIAM conference on applied and computational discrete algorithms (ACDA23), 1-12, 2023 | 5 | 2023 |
| Colored cut games N Morawietz, N Grüttemeier, C Komusiewicz, F Sommer Theoretical Computer Science 936, 13-32, 2022 | 5 | 2022 |
| On the complexity of community-aware network sparsification E Herrendorf, C Komusiewicz, N Morawietz, F Sommer arXiv preprint arXiv:2402.15494, 2024 | 4 | 2024 |
| 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 | 4 | 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 | 4 | 2021 |
| Destroying Bicolored s by Deleting Few Edges 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 |
| Parameterized algorithms for module map problems F Sommer, C Komusiewicz Discrete Applied Mathematics 283, 396-416, 2020 | 3 | 2020 |
| 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 | 3 | 2020 |
| Witty: An Efficient Solver for Computing Minimum-Size Decision Trees LP Staus, C Komusiewicz, F Sommer, M Sorge arXiv preprint arXiv:2412.11954, 2024 | 2 | 2024 |
| Complexity of Local Search for Euclidean Clustering Problems B Manthey, N Morawietz, J van Rhijn, F Sommer arXiv preprint arXiv:2312.14916, 2023 | 2 | 2023 |
Christian KomusiewiczFriedrich-Schiller-Universität JenaVerified email at uni-jena.de
