Publications

2024:

  • Faster Dynamic Auctions via Polymatroid Sum
    • Katharina Eickhoff, Meike Neuwohner, Britta Peis, Niklas Rieken, Laura Vargas Koch, László A. Végh
    • arXiv:2310.08454
  • A 4/3-Approximation for the Maximum Leaf Spanning Arborescence Problem in DAGs

2023:

  • Improved Approximation Algorithms for Weighted k-Set Packing
  • 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
  • The 2-3-Set Packing problem and a 4/3-approximation for the Maximum Leaf Spanning Arborescence problem in rooted dags
  • Passing the Limits of Pure Local Search for Weighted k-Set Packing
  • 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
  • The Limits of Local Search for Weighted k-Set Packing

2021:

  • An Improved Approximation Algorithm for the Maximum Weight Independent Set Problem in d-Claw Free Graphs
  • 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

list_of_publications