Meike Neuwohner

24 papers A* 2A 2B 3Journal 16Unranked 1
YearRankTypeTitle / Venue / Authors
2026 A* conf
A Better-Than-2 Approximation for the Directed Tree Augmentation Problem.
SODA
Meike Neuwohner, Olha Silina, Michael Zlatin
2025 J jnl
A Better-Than-2 Approximation for the Directed Tree Augmentation Problem.
CoRR
Meike Neuwohner, Olha Silina, Michael Zlatin
2025 J jnl
Approximation Schemes for Planar Graph Connectivity Problems.
CoRR
Meike Neuwohner, Vera Traub, Rico Zenklusen
2025 J jnl
Faster Dynamic Auctions via Polymatroid Sum.
ACM Trans. Economics and Comput.
Katharina Eickhoff, Meike Neuwohner, Britta Peis, Niklas Rieken, Laura Vargas Koch, László A. Végh
2025 J jnl
Improved Guarantees for the A Priori TSP.
Math. Oper. Res.
Jannis Blauth, Meike Neuwohner, Luise Puhlmann, Jens Vygen
2025 J jnl
Strong orientation of a connected graph for a crossing family.
Oper. Res. Lett.
Ahmad Abdi, Mahsa Dalirrooyfard, Meike Neuwohner
2024 B conf
A $\nicefrac {4}{3}$-Approximation for the Maximum Leaf Spanning Arborescence Problem in DAGs.
IPCO
Meike Neuwohner
2024 J jnl
A 4/3-Approximation for the Maximum Leaf Spanning Arborescence Problem in DAGs.
CoRR
Meike Neuwohner
2024 J jnl
The limits of local search for weighted k-set packing.
Math. Program.
Meike Neuwohner
2023 J jnl
A Fast Optimal Double-row Legalization Algorithm.
ACM Trans. Design Autom. Electr. Syst.
Stefan Hougardy, Meike Neuwohner, Ulrike Schorr
2023 B conf
Improved Guarantees for the a Priori TSP.
ISAAC
Jannis Blauth, Meike Neuwohner, Luise Puhlmann, Jens Vygen
2023 J jnl
Improved guarantees for the a priori TSP.
CoRR
Jannis Blauth, Meike Neuwohner, Luise Puhlmann, Jens Vygen
2023 A* conf
Passing the Limits of Pure Local Search for Weighted
SODA
Meike Neuwohner
2023 J jnl
The 2-3-Set Packing problem and a 3/4-approximation for the Maximum Leaf Spanning Arborescence problem in rooted dags.
CoRR
Meike Neuwohner
2022 J jnl
Passing the Limits of Pure Local Search for the Maximum Weight Independent Set Problem in d-Claw Free Graphs.
CoRR
Meike Neuwohner
2022 B conf
The Limits of Local Search for Weighted k-Set Packing.
IPCO
Meike Neuwohner
2022 A conf
The Pareto Cover Problem.
ESA
Bento Natura, Meike Neuwohner, Stefan Weltge
2022 J jnl
The Pareto cover problem.
CoRR
Bento Natura, Meike Neuwohner, Stefan Weltge
2021 — conf
A Fast Optimal Double Row Legalization Algorithm.
ISPD
Stefan Hougardy, Meike Neuwohner, Ulrike Schorr
2021 J jnl
A Fast Optimal Double Row Legalization Algorithm.
CoRR
Stefan Hougardy, Meike Neuwohner, Ulrike Schorr
2021 A conf
An Improved Approximation Algorithm for the Maximum Weight Independent Set Problem in d-Claw Free Graphs.
STACS
Meike Neuwohner
2021 J jnl
An Improved Approximation Algorithm for the Maximum Weight Independent Set Problem in d-Claw Free Graphs.
CoRR
Meike Neuwohner
2021 J jnl
Reducing Moser's Square Packing Problem to a Bounded Number of Squares.
CoRR
Meike Neuwohner
2021 J jnl
The Limits of Local Search for the Maximum Weight Independent Set Problem in d-Claw Free Graphs.
CoRR
Meike Neuwohner