Ulrich Pferschy

1. The Product Knapsack Problem: Approximation and Complexity
   2019/01/03 by Ulrich Pferschy, Pferschy, Ulrich, Joachim Schauer +3 · 2 citations
   Computer Science · Engineering · #Advanced Manufacturing and Logistics Optimization #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Optimization and Control (math.OC) #Optimization and Packing Problems #Optimization and Search Problems
2. Fair allocation of indivisible items with conflict graphs
   2020/03/25 by Nina Chiarelli, Matjaž Krnc, Chiarelli, Nina +9 · 1 citation
   Decision Sciences · Economics, Econometrics and Finance · #05C85 #68Q25 #68W25 #90C27 #90C39 #91B32 #Auction Theory and Applications #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #Economic theories and models #FOS: Computer and information sciences #FOS: Mathematics #Game Theory and Voting Systems #Optimization and Control (math.OC)
3. Fair Allocation Algorithms for Indivisible Items under Structured Conflict Constraints
   2023/08/18 by Nina Chiarelli, Chiarelli, Nina, Matjaž Krnc +7 · 2 citations
   Decision Sciences · #Auction Theory and Applications