| 2021 | COMPSAC | Decision-Support System for the Optimal Technology Split of a Decarbonized Bus Network. | Nathalie Frie, Ulrich Pferschy |
| 2020 | IWOCA | Fair Packing of Independent Sets. | Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer |
| 2017 | IWOCA | Approximation Results for the Incremental Knapsack Problem. | Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia |
| 2015 | SAGT | Brief Announcement: On the Fair Subset Sum Problem. | Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy |
| 2014 | ICORES | Media Mix Optimization - Applying a Quadratic Knapsack Model. | Ulrich Pferschy, Joachim Schauer, Gerhild Maier |
| 2014 | ICORES | A Quadratic Knapsack Model for Optimizing the Media Mix of a Promotional Campaign. | Ulrich Pferschy, Joachim Schauer, Gerhild Maier |
| 2013 | WAOA | Approximating the Quadratic Knapsack Problem on Special Graph Classes. | Ulrich Pferschy, Joachim Schauer |
| 2011 | INOC | The Maximum Flow Problem with Conflict and Forcing Conditions. | Ulrich Pferschy, Joachim Schauer |
| 2005 | ALENEX | Solving the Prize-Collecting Steiner Tree Problem to Optimality. | Ivana Ljubic, Ren Weiskircher, Ulrich Pferschy, Gunnar W. Klau, Petra Mutzel, Matteo Fischetti |
| 2004 | GECCO | Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem. | Gunnar W. Klau, Ivana Ljubic, Andreas Moser, Petra Mutzel, Philipp Neuner, Ulrich Pferschy, Gnther R. Raidl, Ren Weiskircher |
| 2003 | ESA | The Fractional Prize-Collecting Steiner Tree Problem on Trees: Extended Abstract. | Gunnar W. Klau, Ivana Ljubic, Petra Mutzel, Ulrich Pferschy, Ren Weiskircher |
| 2001 | WADS | Approximating Multi-objective Knapsack Problems. | Thomas Erlebach, Hans Kellerer, Ulrich Pferschy |
| 1997 | ISAAC | An Efficient Approximation Scheme for the Subset-Sum Problem. | Hans Kellerer, Ulrich Pferschy, Maria Grazia Speranza |
| 1995 | IPCO | The Random Linear Bottleneck Assignment Problem. | Ulrich Pferschy |