| The knapsack problem with conflict graphs U Pferschy, J Schauer Journal of Graph Algorithms and Applications 13 (2), 233-249, 2009 | 176 | 2009 |
| Paths, trees and matchings under disjunctive constraints A Darmann, U Pferschy, J Schauer, GJ Woeginger Discrete Applied Mathematics 159 (16), 1726-1735, 2011 | 131 | 2011 |
| Group activity selection problem A Darmann, E Elkind, S Kurz, J Lang, J Schauer, G Woeginger Internet and Network Economics: 8th International Workshop, WINE 2012 …, 2012 | 100 | 2012 |
| Maximizing Nash product social welfare in allocating indivisible goods A Darmann, J Schauer European Journal of Operational Research 247 (2), 548-559, 2015 | 90 | 2015 |
| The maximum flow problem with disjunctive constraints U Pferschy, J Schauer Journal of Combinatorial Optimization 26 (1), 109-119, 2013 | 75 | 2013 |
| Approximation of knapsack problems with conflict and forcing graphs U Pferschy, J Schauer Journal of Combinatorial Optimization 33 (4), 1300-1323, 2017 | 58 | 2017 |
| Resource allocation with time intervals A Darmann, U Pferschy, J Schauer Theoretical Computer Science 411 (49), 4217-4234, 2010 | 58 | 2010 |
| Determining a minimum spanning tree with disjunctive constraints A Darmann, U Pferschy, J Schauer International conference on algorithmic decision theory, 414-423, 2009 | 54 | 2009 |
| Group activity selection problem with approval preferences A Darmann, E Elkind, S Kurz, J Lang, J Schauer, G Woeginger International Journal of Game Theory 47, 767-796, 2018 | 37 | 2018 |
| The subset sum game A Darmann, G Nicosia, U Pferschy, J Schauer European Journal of Operational Research 233 (3), 539-549, 2014 | 34 | 2014 |
| On the Stackelberg knapsack game U Pferschy, G Nicosia, A Pacifici, J Schauer European Journal of Operational Research 291 (1), 18-31, 2021 | 26 | 2021 |
| Order batching and routing in a non-standard warehouse U Pferschy, J Schauer Electronic Notes in Discrete Mathematics 69, 125-132, 2018 | 25 | 2018 |
| Asymptotic behavior of the quadratic knapsack problem J Schauer European Journal of Operational Research 255 (2), 357-363, 2016 | 20 | 2016 |
| Approximation of the quadratic knapsack problem U Pferschy, J Schauer INFORMS Journal on Computing 28 (2), 308-318, 2016 | 19 | 2016 |
| Approximating the product knapsack problem U Pferschy, J Schauer, C Thielen Optimization Letters 15 (8), 2529-2540, 2021 | 16 | 2021 |
| The maximum flow problem with conflict and forcing conditions U Pferschy, J Schauer International conference on network optimization, 289-294, 2011 | 15 | 2011 |
| Fair allocation of indivisible items with conflict graphs N Chiarelli, M Krnc, M Milanič, U Pferschy, N Pivač, J Schauer Algorithmica 85 (5), 1459-1489, 2023 | 9 | 2023 |
| Fair packing of independent sets N Chiarelli, M Krnc, M Milanič, U Pferschy, N Pivač, J Schauer Combinatorial Algorithms: 31st International Workshop, IWOCA 2020, Bordeaux …, 2020 | 9 | 2020 |
| The shortest path game: Complexity and algorithms A Darmann, U Pferschy, J Schauer IFIP International Conference on Theoretical Computer Science, 39-53, 2014 | 9 | 2014 |
| Minimal spanning trees with conflict graphs A Darmann, U Pferschy, J Schauer Optimization online, 2009 | 9 | 2009 |
Ulrich PferschyUniversity of GrazVerifisert e-postadresse på uni-graz.at
