![]()  | Up a level | 
    Eickhoff, Katharina, Neuwohner, Meike 
ORCID: 0000-0002-3664-3687, Peis, Britta, Rieken, Niklas, Vargas Koch, Laura and Végh, Lázló A. 
ORCID: 0000-0003-1152-200X 
  
(2025)
Faster dynamic auctions via polymatroid sum.
    ACM Transactions on Economics and Computation, 13 (3).
    
     ISSN 2167-8375
  
  
    Abdi, Ahmad 
ORCID: 0000-0002-3008-4167, Dalirrooyfarda, Mahsa and Neuwohner, Meike 
ORCID: 0000-0002-3664-3687 
  
(2025)
Strong orientation of a connected graph for a crossing family.
    Operations Research Letters, 62.
    
     ISSN 0167-6377
  
  
    Neuwohner, Meike 
ORCID: 0000-0002-3664-3687 
  
(2025)
A 4/3-approximation for the maximum leaf spanning arborescence problem in DAGs.
    Mathematical Programming.
    
     ISSN 0025-5610
  
  
    Blauth, Jannis, Neuwohner, Meike 
ORCID: 0000-0002-3664-3687, Puhlmann, Luise and Vygen, Jens 
  
(2024)
Improved guarantees for the A Priori TSP.
    Mathematics of Operations Research.
    
     ISSN 0364-765X
  
  
    Natura, Bento, Neuwohner, Meike 
ORCID: 0000-0002-3664-3687 and Weltge, Stefan 
  
(2022)
The Pareto cover problem.
    
      In: Chechik, Shiri, Navarro, Gonzalo, Rotenberg, Eva and Herman, Grzegorz, (eds.)
      Leibniz International Proceedings in Informatics, LIPIcs.
    
      Leibniz International Proceedings in Informatics, LIPIcs.
    
    Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing.
     ISBN 9783959772471