Papers accepted at IPEC 2024 and ADT 2024
Published:
Two papers by the group were accepted at the conferences IPEC and ADT, respectively.
In Modularity Clustering parameterized by Max Leaf Number, coauthored by Jaroslav Garvardt and Christian Komusiewicz, we consider the popular modularity score for clusterings of undirected graphs. We continue the parameterized complexity analysis of the NP-hard problem of finding a clustering with a maximum modularity score. We prove the previous conjecture that the problem is fixed parameter tractable for the parameter max leaf number. This paper will be presented at the International Symposium on Parameterized and Exact Computation (IPEC 2024External link) held at Royal Holloway, University of London.
In Protective and Nonprotective Subset Sum Games: A Parameterized Complexity Analysis, coauthored by Jaroslav Garvardt, Christian Komusiewicz, Ber Lorke, and Jannik Schestag, we study the parameterized complexity of the two-player Subset Sum Game, where players A and B alternatingly add items to a shared knapsack. We present improved algorithms and introduce a new variant where player A only wins when both players reach their goal. This paper will be presented at the 8th International Conference on Algorithmic Decision Theory (ADT 2024)External link in Piscataway, New Jersey.