Accepted Papers

• Paper accepted at AAAI'21
• Paper accepted at STACS'21
• Paper accepted at IJCAI'21
• Paper accepted at WG'21
• Paper accepted at STACS'22
• Paper accepted at MFCS'22
• Paper accepted at IPEC'22
• 2 Papers accepted at ACDA'23 Two of our papers are accepted at the SIAM Conference on Applied and Computational Discrete Algorithms (ACDA'23). To the paper Exact Algorithms for Group Closeness Centrality contributed Luca Pascal Staus, Christian Komusiewicz, Nils Morawietz und Frank Sommer (all Philipps-Universität Marburg). To the paper On the Group Coverage Centrality Problem: Parameterized Complexity and Heuristics contributed Christian Komusiewicz, Jannis Schramek and Frank Sommer (all Philipps-Universität Marburg).
• Paper accepted at ICML'23 Our paper on Computing Optimal Tree Ensembles was accepted for publication at the 2023 International Conference on Machine Learning (ICML'23). Authors are Christian Komusiewicz (Friedrich-Schiller-Universität Jena), Pascal Kunz (TU Berlin), Frank Sommer (Philipps-Universität Marburg), and Manuel Sorge (TU Wien).