Ulrich Pferschy

Christian Klamler, Ulrich Pferschy, Stefan Ruzika: Committee selection under weight constraints. Mathematical Social Sciences 64(1): 48-56 (2012)

Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy: Strategies for Single-machine Multi-agent Scheduling Problems. CTW 2012: 197-200

Andreas Darmann, Ulrich Pferschy, Joachim Schauer, Gerhard J. Woeginger: Paths, trees and matchings under disjunctive constraints. Discrete Applied Mathematics 159(16): 1726-1735 (2011)

Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy: Competitive subset selection with two agents. Discrete Applied Mathematics 159(16): 1865-1877 (2011)

Michele Monaci, Ulrich Pferschy: On the Robust Knapsack Problem. CTW 2011: 207-210

Ulrich Pferschy, Joachim Schauer: The Maximum Flow Problem with Conflict and Forcing Conditions. INOC 2011: 289-294

Jakob Puchinger, Günther R. Raidl, Ulrich Pferschy: The Multidimensional Knapsack Problem: Structure and Algorithms. INFORMS Journal on Computing 22(2): 250-265 (2010)

Andreas Darmann, Christian Klamler, Ulrich Pferschy: A note on maximizing the minimum voter satisfaction on spanning trees. Mathematical Social Sciences 60(1): 82-85 (2010)

Andreas Darmann, Ulrich Pferschy, Joachim Schauer: Resource allocation with time intervals. Theor. Comput. Sci. 411(49): 4217-4234 (2010)

Renata Mansini, Ulrich Pferschy: A Two-Period Portfolio Selection Model for Asset-backed Securitization. Algorithmic Operations Research 4(2): 155-170 (2009)

Behrooz Alizadeh, Rainer E. Burkard, Ulrich Pferschy: Inverse 1-center location problems with edge length augmentation on trees. Computing 86(4): 331-343 (2009)

Ulrich Pferschy, Joachim Schauer: The Knapsack Problem with Conflict Graphs. J. Graph Algorithms Appl. 13(2): 233-249 (2009)

Andreas Darmann, Christian Klamler, Ulrich Pferschy: Maximizing the minimum voter satisfaction on spanning trees. Mathematical Social Sciences 58(2): 238-250 (2009)

Christian Klamler, Ulrich Pferschy, Stefan Ruzika: Committee Selection with a Weight Constraint Based on Lexicographic Rankings of Individuals. ADT 2009: 50-61

Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy: Subset Weight Maximization with Two Competing Agents. ADT 2009: 74-85

Andreas Darmann, Ulrich Pferschy, Joachim Schauer: Determining a Minimum Spanning Tree with Disjunctive Constraints. ADT 2009: 414-423

Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy: On Multi-Agent Knapsack Problems. CTW 2009: 44-47

Andreas Darmann, Ulrich Pferschy, Joachim Schauer, Gerhard J. Woeginger: Combinatorial Optimization Problems with Conflict Graphs. CTW 2009: 293-296

Christian Klamler, Ulrich Pferschy: The traveling group problem. Social Choice and Welfare 29(3): 429-452 (2007)

Ivana Ljubic, René Weiskircher, Ulrich Pferschy, Gunnar W. Klau, Petra Mutzel, Matteo Fischetti: An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem. Math. Program. 105(2-3): 427-449 (2006)

Jakob Puchinger, Günther R. Raidl, Ulrich Pferschy: The Core Concept for the Multidimensional Knapsack Problem. EvoCOP 2006: 195-208

Daniel Wagner, Günther R. Raidl, Ulrich Pferschy, Petra Mutzel, Peter Bachhiesl: A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks. OR 2006: 197-202

Bettina Klinz, Ulrich Pferschy, Joachim Schauer: ILP Models for a Nurse Scheduling Problem. OR 2006: 319-324

Alberto Caprara, Ulrich Pferschy: Modified subset sum heuristics for bin packing. Inf. Process. Lett. 96(1): 18-23 (2005)

Ivana Ljubic, René Weiskircher, Ulrich Pferschy, Gunnar W. Klau, Petra Mutzel, Matteo Fischetti: Solving the Prize-Collecting Steiner Tree Problem to Optimality. ALENEX/ANALCO 2005: 68-76

Hans Kellerer, Ulrich Pferschy, David Pisinger: Knapsack problems. Springer 2004, isbn 978-3-540-40286-2, pp. I-XX, 1-546

Renata Mansini, Ulrich Pferschy: Securitization of Financial Assets: Approximation in Theory and Practice. Comp. Opt. and Appl. 29(2): 147-171 (2004)

Hans Kellerer, Ulrich Pferschy: Improved Dynamic Programming in Connection with an FPTAS for the Knapsack Problem. J. Comb. Optim. 8(1): 5-11 (2004)

Alberto Caprara, Ulrich Pferschy: Worst-case analysis of the subset sum algorithm for bin packing. Oper. Res. Lett. 32(2): 159-166 (2004)

Gunnar W. Klau, Ivana Ljubic, Andreas Moser, Petra Mutzel, Philipp Neuner, Ulrich Pferschy, Günther R. Raidl, René Weiskircher: Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem. GECCO (1) 2004: 1304-1315

Alberto Caprara, Hans Kellerer, Ulrich Pferschy: A 3/4-Approximation Algorithm for Multiple Subset Sum. J. Heuristics 9(2): 99-111 (2003)

Hans Kellerer, Renata Mansini, Ulrich Pferschy, Maria Grazia Speranza: An efficient fully polynomial approximation scheme for the Subset-Sum Problem. J. Comput. Syst. Sci. 66(2): 349-370 (2003)

Gunnar W. Klau, Ivana Ljubic, Petra Mutzel, Ulrich Pferschy, René Weiskircher: The Fractional Prize-Collecting Steiner Tree Problem on Trees: Extended Abstract. ESA 2003: 691-702

Alberto Caprara, Hans Kellerer, Ulrich Pferschy: Approximation Schemes for Ordered Vector Packing Problems. RANDOM-APPROX 2001: 63-74

Thomas Erlebach, Hans Kellerer, Ulrich Pferschy: Approximating Multi-objective Knapsack Problems. WADS 2001: 210-221

Alberto Caprara, Hans Kellerer, Ulrich Pferschy, David Pisinger: Approximation algorithms for knapsack problems with cardinality constraints. European Journal of Operational Research 123(2): 333-345 (2000)

Alberto Caprara, Hans Kellerer, Ulrich Pferschy: A PTAS for the Multiple Subset Sum Problem with different knapsack capacities. Inf. Process. Lett. 73(3-4): 111-118 (2000)

Alberto Caprara, Hans Kellerer, Ulrich Pferschy: The Multiple Subset Sum Problem. SIAM Journal on Optimization 11(2): 308-319 (2000)

Ulrich Pferschy: Dynamic Programming Revisited: Improving Knapsack Algorithms. Computing 63(4): 419-430 (1999)

Hans Kellerer, Ulrich Pferschy: A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem. J. Comb. Optim. 3(1): 59-71 (1999)

Hans Kellerer, Ulrich Pferschy: A New Fully Polynomial Approximation Scheme for the Knapsack Problem. APPROX 1998: 123-134

Ulrich Pferschy: Solution Methods and Computational Investigations for the Linear Bottleneck Assignment Problem. Computing 59(3): 237-258 (1997)

Ulrich Pferschy, David Pisinger, Gerhard J. Woeginger: Simple But Efficient Approaches for the Collapsing Knapsack Problem. Discrete Applied Mathematics 77(3): 271-280 (1997)

József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger: Greedy Algorithms for On-Line Data Compression. J. Algorithms 25(2): 274-289 (1997)

Hans Kellerer, Ulrich Pferschy, Maria Grazia Speranza: An Efficient Approximation Scheme for the Subset-Sum Problem. ISAAC 1997: 394-403

József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger: The Fractional Greedy Algorithm for Data Compression. Computing 56(1): 29-46 (1996)

József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger: Worst-Case Analysis for On-Line Data Compression. Combinatorics and Computer Science 1995: 288-300

Ulrich Pferschy: The Random Linear Bottleneck Assignment Problem. IPCO 1995: 145-156

Ulrich Pferschy, Gerhard J. Woeginger, En-Yu Yao: Partitioning Graphs into Two Trees. Acta Cybern. 11(3): 233-240 (1994)

Ulrich Pferschy, Rüdiger Rudolf, Gerhard J. Woeginger: Some Geometric Clustering Problems. Nord. J. Comput. 1(2): 246-263 (1994)