I only update this page every once in a while.
For a more up-to-date list of publications, check also my Google Scholar profile.
2026:
- Cosigning Crossing Families and Outer-Planar Gadgets
- Ahmad Abdi, Mahsa Dalirrooyfard, Meike Neuwohner
- arXiv.2602.24124
- A Better-Than-2 Approximation for the Directed Tree Augmentation Problem
- Meike Neuwohner, Olha Silina, Michael Zlatin
- Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) doi:10.1137/1.9781611978971.56
2025:
- Approximation Schemes for Planar Graph Connectivity Problems
- Meike Neuwohner, Vera Traub, Rico Zenklusen
- arXiv.2512.21128
- Strong orientation of a connected graph for a crossing family
- Ahmad Abdi, Mahsa Dalirrooyfard, Meike Neuwohner
- Operations Research Letters, September 2025 doi:10.1016/j.orl.2025.107333
- Faster Dynamic Auctions via Polymatroid Sum
- Katharina Eickhoff, Meike Neuwohner, Britta Peis, Niklas Rieken, Laura Vargas Koch, László A. Végh
- ACM Transactions on Economics and Computation, June 2025 doi:10.1145/3729429
- 4/3-Approximation for the Maximum Leaf Spanning Arborescence Problem in DAGs
- Meike Neuwohner
- Mathematical Programming Series B, May 2025 doi:10.1007/s10107-025-02233-0
2024:
- Improved Guarantees for the A Priori TSP
- Jannis Blauth, Meike Neuwohner, Luise Puhlmann, Jens Vygen
- Mathematics of Operations Research, November 2024 doi:10.1287/moor.2023.0322
- A characterization of unimodular hypergraphs with disjoint hyperedges
- Marco Caoduro, Meike Neuwohner, Joseph Paat
- arXiv.2411.10593
- A 4/3-Approximation for the Maximum Leaf Spanning Arborescence Problem in DAGs
- Meike Neuwohner
- Integer Programming and Combinatorial Optimization (IPCO 2024) doi:10.1007/978-3-031-59835-7_25
2023:
- Improved Approximation Algorithms for Weighted k-Set Packing
- Meike Neuwohner
- PhD Thesis https://hdl.handle.net/20.500.11811/11246
- Improved Guarantees for the a Priori TSP
- Jannis Blauth, Meike Neuwohner, Luise Puhlmann, Jens Vygen
- 34th International Symposium on Algorithms and Computation (ISAAC 2023) doi:10.4230/LIPIcs.ISAAC.2023.14
- The Limits of Local Search for Weighted k-Set Packing
- Meike Neuwohner
- Mathematical Programming Series B, October 2023 doi:10.1007/s10107-023-02026-3
- The 2-3-Set Packing problem and a 4/3-approximation for the Maximum Leaf Spanning Arborescence problem in rooted dags
- Meike Neuwohner
- arXiv:2305.07808
- Passing the Limits of Pure Local Search for Weighted k-Set Packing
- Meike Neuwohner
- Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) doi:10.1137/1.9781611977554.ch41
- A Fast Optimal Double Row Legalization Algorithm
- Stefan Hougardy, Meike Neuwohner, Ulrike Schorr
- ACM Transactions on Design Automation of Electronic Systems, January 2023 doi:10.1145/3579844
2022:
- The Pareto Cover Problem
- Bento Natura, Meike Neuwohner, Stefan Weltge
- 30th Annual European Symposium on Algorithms (ESA 2022) doi:10.4230/LIPIcs.ESA.2022.80
- The Limits of Local Search for Weighted k-Set Packing
- Meike Neuwohner
- Integer Programming and Combinatorial Optimization (IPCO 2022) doi:10.1007/978-3-031-06901-7_31
2021:
- An Improved Approximation Algorithm for the Maximum Weight Independent Set Problem in d-Claw Free Graphs
- Meike Neuwohner
- 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021) doi:10.4230/LIPIcs.STACS.2021.53
- A Fast Optimal Double Row Legalization Algorithm
- Stefan Hougardy, Meike Neuwohner, Ulrike Schorr
- ISPD ’21: Proceedings of the 2021 International Symposium on Physical Design doi:10.1145/3439706.3447044
- Reducing Moser’s Square Packing Problem to a Bounded Number of Squares
- Meike Neuwohner
- arXiv:2103.06597