Ulrich Pferschy

	2009
32		Andreas Darmann, Ulrich Pferschy, Joachim Schauer: Determining a Minimum Spanning Tree with Disjunctive Constraints. ADT 2009: 414-423
31		Christian Klamler, Ulrich Pferschy, Stefan Ruzika: Committee Selection with a Weight Constraint Based on Lexicographic Rankings of Individuals. ADT 2009: 50-61
30		Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy: Subset Weight Maximization with Two Competing Agents. ADT 2009: 74-85
29		Andreas Darmann, Ulrich Pferschy, Joachim Schauer, Gerhard J. Woeginger: Combinatorial Optimization Problems with Conflict Graphs. CTW 2009: 293-296
28		Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy: On Multi-Agent Knapsack Problems. CTW 2009: 44-47
	2006
27		Jakob Puchinger, Günther R. Raidl, Ulrich Pferschy: The Core Concept for the Multidimensional Knapsack Problem. EvoCOP 2006: 195-208
26		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
25		Bettina Klinz, Ulrich Pferschy, Joachim Schauer: ILP Models for a Nurse Scheduling Problem. OR 2006: 319-324
24		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)
	2005
23		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
22		Alberto Caprara, Ulrich Pferschy: Modified subset sum heuristics for bin packing. Inf. Process. Lett. 96(1): 18-23 (2005)
	2004
21		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
20		Hans Kellerer, Ulrich Pferschy: Improved Dynamic Programming in Connection with an FPTAS for the Knapsack Problem. J. Comb. Optim. 8(1): 5-11 (2004)
19		Alberto Caprara, Ulrich Pferschy: Worst-case analysis of the subset sum algorithm for bin packing. Oper. Res. Lett. 32(2): 159-166 (2004)
	2003
18		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
17		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)
16		Alberto Caprara, Hans Kellerer, Ulrich Pferschy: A 3/4-Approximation Algorithm for Multiple Subset Sum. J. Heuristics 9(2): 99-111 (2003)
	2001
15		Alberto Caprara, Hans Kellerer, Ulrich Pferschy: Approximation Schemes for Ordered Vector Packing Problems. RANDOM-APPROX 2001: 63-74
14		Thomas Erlebach, Hans Kellerer, Ulrich Pferschy: Approximating Multi-objective Knapsack Problems. WADS 2001: 210-221
	2000
13		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)
	1999
12		Ulrich Pferschy: Dynamic Programming Revisited: Improving Knapsack Algorithms. Computing 63(4): 419-430 (1999)
11		Hans Kellerer, Ulrich Pferschy: A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem. J. Comb. Optim. 3(1): 59-71 (1999)
	1998
10		Hans Kellerer, Ulrich Pferschy: A New Fully Polynomial Approximation Scheme for the Knapsack Problem. APPROX 1998: 123-134
	1997
9		Hans Kellerer, Ulrich Pferschy, Maria Grazia Speranza: An Efficient Approximation Scheme for the Subset-Sum Problem. ISAAC 1997: 394-403
8		Ulrich Pferschy: Solution Methods and Computational Investigations for the Linear Bottleneck Assignment Problem. Computing 59(3): 237-258 (1997)
7		Ulrich Pferschy, David Pisinger, Gerhard J. Woeginger: Simple But Efficient Approaches for the Collapsing Knapsack Problem. Discrete Applied Mathematics 77(3): 271-280 (1997)
6		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)
	1996
5		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)
	1995
4		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
3		Ulrich Pferschy: The Random Linear Bottleneck Assignment Problem. IPCO 1995: 145-156
	1994
2		Ulrich Pferschy, Gerhard J. Woeginger, En-Yu Yao: Partitioning Graphs into Two Trees. Acta Cybern. 11(3): 233-240 (1994)
1		Ulrich Pferschy, Rüdiger Rudolf, Gerhard J. Woeginger: Some Geometric Clustering Problems. Nord. J. Comput. 1(2): 246-263 (1994)

Coauthor Index

1	Peter Bachhiesl	[26]
2	József Békési	[4] [5] [6]
3	Alberto Caprara	[13] [15] [16] [19] [22]
4	Andreas Darmann	[29] [32]
5	Thomas Erlebach	[14]
6	Matteo Fischetti	[23] [24]
7	Gábor Galambos	[4] [5] [6]
8	Hans Kellerer	[9] [10] [11] [13] [14] [15] [16] [17] [20]
9	Christian Klamler	[31]
10	Gunnar W. Klau	[18] [21] [23] [24]
11	Bettina Klinz	[25]
12	Ivana Ljubic	[18] [21] [23] [24]
13	Renata Mansini	[17]
14	Andreas Moser	[21]
15	Petra Mutzel	[18] [21] [23] [24] [26]
16	Philipp Neuner	[21]
17	Gaia Nicosia	[28] [30]
18	Andrea Pacifici	[28] [30]
19	David Pisinger	[7]
20	Jakob Puchinger	[27]
21	Günther R. Raidl	[21] [26] [27]
22	Rüdiger Rudolf	[1]
23	Stefan Ruzika	[31]
24	Joachim Schauer	[25] [29] [32]
25	Maria Grazia Speranza	[9] [17]
26	Daniel Wagner	[26]
27	René Weiskircher	[18] [21] [23] [24]
28	Gerhard J. Woeginger	[1] [2] [4] [5] [6] [7] [29]
29	En-Yu Yao	[2]

Colors in the list of coauthors