An Improved Approximation Algorithm for the Maximum Weight Independent Set Problem in d-Claw Free Graphs. - Meike Neuwohner (STACS, 2021)

Reducing Moser's Square Packing Problem to a Bounded Number of Squares. - Meike Neuwohner (CoRR, 2021)

The Limits of Local Search for the Maximum Weight Independent Set Problem in d-Claw Free Graphs. - Meike Neuwohner (CoRR, 2021)

The Pareto Cover Problem. - Bento Natura; Meike Neuwohner; Stefan Weltge (ESA, 2022)

Passing the Limits of Pure Local Search for the Maximum Weight Independent Set Problem in d-Claw Free Graphs. - Meike Neuwohner (CoRR, 2022)

Improved Guarantees for the a Priori TSP. - Jannis Blauth; Meike Neuwohner; Luise Puhlmann; Jens Vygen (ISAAC, 2023)

Passing the Limits of Pure Local Search for Weighted k-Set Packing. - Meike Neuwohner (SODA, 2023)

The 2-3-Set Packing problem and a 3/4-approximation for the Maximum Leaf Spanning Arborescence problem in rooted dags. - Meike Neuwohner (CoRR, 2023)

A Fast Optimal Double-row Legalization Algorithm. - Stefan Hougardy; Meike Neuwohner; Ulrike Schorr (ACM Trans. Design Autom. Electr. Syst., 2023)

A $ icefrac {4}{3}$-Approximation for the Maximum Leaf Spanning Arborescence Problem in DAGs. - Meike Neuwohner (IPCO, 2024)

A 4/3-Approximation for the Maximum Leaf Spanning Arborescence Problem in DAGs. - Meike Neuwohner (CoRR, 2024)

The limits of local search for weighted k-set packing. - Meike Neuwohner (Math. Program., 2024)

Strong orientation of a connected graph for a crossing family. - Ahmad Abdi; Mahsa Dalirrooyfard; Meike Neuwohner (Oper. Res. Lett., 2025)