An improved approximation algorithm for the maximum weight independent set problem in d-claw free graphs M Neuwohner
arXiv preprint arXiv:2106.03545, 2021
22 2021 The limits of local search for weighted k-set packing M Neuwohner
Mathematical Programming, 1-39, 2023
6 2023 Passing the Limits of Pure Local Search for Weighted k -Set Packing M Neuwohner
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
6 2023 A fast optimal double-row legalization algorithm S Hougardy, M Neuwohner, U Schorr
ACM Transactions on Design Automation of Electronic Systems 28 (5), 1-26, 2023
3 2023 Passing the limits of pure local search for the maximum weight independent set problem in d-claw free graphs M Neuwohner
ArXiV, abs/2202.01248 3, 22, 2022
1 2022 Reducing Moser's Square Packing Problem to a Bounded Number of Squares M Neuwohner
arXiv preprint arXiv:2103.06597, 2021
1 2021 Improved Approximation Algorithms for Weighted k -Set Packing M Neuwohner
Universitäts-und Landesbibliothek Bonn, 2024
2024 Improved guarantees for the a priori TSP J Blauth, M Neuwohner, L Puhlmann, J Vygen
arXiv preprint arXiv:2309.10663, 2023
2023 The - -Set Packing problem and a -approximation for the Maximum Leaf Spanning Arborescence problem in rooted dags M Neuwohner
arXiv preprint arXiv:2305.07808, 2023
2023 The Pareto cover problem B Natura, M Neuwohner, S Weltge
arXiv preprint arXiv:2202.08035, 2022
2022 The Limits of Local Search for the Maximum Weight Independent Set Problem in d-Claw Free Graphs M Neuwohner
arXiv preprint arXiv:2106.03555, 2021
2021 Passing the Limits of Pure Local Search for the Maximum Weight M Neuwohner
Forschungsinstitut für Diskrete Mathematik, Rheinische Friedrich-Wilhelms …, 2021
2021