Ulrich Pferschy

2006
27	EE	Jakob Puchinger, Günther R. Raidl, Ulrich Pferschy: The Core Concept for the Multidimensional Knapsack Problem. EvoCOP 2006: 195-208
26	EE	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	EE	Bettina Klinz, Ulrich Pferschy, Joachim Schauer: ILP Models for a Nurse Scheduling Problem. OR 2006: 319-324
24	EE	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	EE	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	EE	Alberto Caprara, Ulrich Pferschy: Modified subset sum heuristics for bin packing. Inf. Process. Lett. 96(1): 18-23 (2005)
2004
21	EE	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	EE	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	EE	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	EE	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	EE	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	EE	Alberto Caprara, Hans Kellerer, Ulrich Pferschy: Approximation Schemes for Ordered Vector Packing Problems. RANDOM-APPROX 2001: 63-74
14	EE	Thomas Erlebach, Hans Kellerer, Ulrich Pferschy: Approximating Multi-objective Knapsack Problems. WADS 2001: 210-221
2000
13	EE	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	EE	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	EE	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	EE	Ulrich Pferschy: Solution Methods and Computational Investigations for the Linear Bottleneck Assignment Problem. Computing 59(3): 237-258 (1997)
7	EE	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	EE	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	EE	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	Thomas Erlebach	[14]
5	Matteo Fischetti	[23] [24]
6	Gábor Galambos	[4] [5] [6]
7	Hans Kellerer	[9] [10] [11] [13] [14] [15] [16] [17] [20]
8	Gunnar W. Klau	[18] [21] [23] [24]
9	Bettina Klinz	[25]
10	Ivana Ljubic	[18] [21] [23] [24]
11	Renata Mansini	[17]
12	Andreas Moser	[21]
13	Petra Mutzel	[18] [21] [23] [24] [26]
14	Philipp Neuner	[21]
15	David Pisinger	[7]
16	Jakob Puchinger	[27]
17	Günther R. Raidl	[21] [26] [27]
18	Rüdiger Rudolf	[1]
19	Joachim Schauer	[25]
20	Maria Grazia Speranza	[9] [17]
21	Daniel Wagner	[26]
22	René Weiskircher	[18] [21] [23] [24]
23	Gerhard J. Woeginger	[1] [2] [4] [5] [6] [7]
24	En-Yu Yao	[2]