Ulrich Pferschy

132 papers A 1B 7C 9Journal 96Unranked 18

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	REDS: Resource-Efficient Deep Subnetworks for Dynamic Resource Constraints. IEEE Trans. Mob. Comput. Francesco Corti, Balz Maag, Joachim Schauer, Ulrich Pferschy, Olga Saukh
2026	J	`jnl`	Scheduling with Time Dependent Utilities: Fairness and Efficiency. CoRR Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
2025	J	`jnl`	Curriculum-based university course timetabling considering individual course of studies. Central Eur. J. Oper. Res. Elmar Steiner, Ulrich Pferschy, Andrea Schaerf
2025	J	`jnl`	Flow shop scheduling with inter-stage flexibility and blocking constraints. Comput. Oper. Res. Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy, Anna Russo Russo, Cecilia Salvatore
2025	J	`jnl`	Integrating multiple sources of ordinal information in portfolio optimization. Ann. Oper. Res. Eranda Çela, Stephan Hafner, Roland Mestel, Ulrich Pferschy
2025	J	`jnl`	Minimizing maximum dissatisfaction in the allocation of indivisible items under a common preference graph. Discret. Optim. Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy
2024	—	`conf`	A Dynamic Algorithm Configuration Framework Using Combinatorial Problem Features and Reinforcement Learning. MIC (2) Elmar Steiner, Ulrich Pferschy
2024	J	`jnl`	Allocation of Indivisible Items with a Common Preference Graph: Minimizing Total Dissatisfaction. CoRR Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy
2024	J	`jnl`	Flow Shop Scheduling with Inter-Stage Flexibility and Blocking Constraints. CoRR Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy, Anna Russo Russo, Cecilia Salvatore
2024	J	`jnl`	Operational Research: methods and applications. J. Oper. Res. Soc. Fotios Petropoulos, Gilbert Laporte, Emel Aktas, Sibel A. Alumur, Claudia Archetti, Hayriye Ayhan, Maria Battarra, Julia A. Bennell, Jean-Marie Bourjolly, John E. Boylan, Michèle Breton, David Canca, Laurent Charlin, Bo Chen, Cihan Tugrul Cicek, Louis Anthony Cox, Christine S. M. Currie, Erik Demeulemeester, Li Ding, Stephen M. Disney, Matthias Ehrgott, Martin J. Eppler, Günes Erdogan, Bernard Fortz, L. Alberto Franco, Jens Frische, Salvatore Greco, Amanda J. Gregory, Raimo P. Hämäläinen, Willy Herroelen, Mike Hewitt, Jan Holmström, John N. Hooker, Tugçe Isik, Jill Johnes, Bahar Yetis Kara, Özlem Karsu, Katherine Kent, Charlotte Köhler, Martin H. Kunc, Yong-Hong Kuo, Adam N. Letchford, Janny Leung, Dong Li, Haitao Li, Judit Lienert, Ivana Ljubic, Andrea Lodi, Sebastián Lozano, Virginie Lurkin, Silvano Martello, Ian G. McHale, Gerald Midgley, John D. W. Morecroft, Akshay Mutha, Ceyda Oguz, Sanja Petrovic, Ulrich Pferschy, Harilaos N. Psaraftis, Sam Rose, Lauri Saarinen, Saïd Salhi, Jing-Sheng Song, Dimitrios Sotiros, Kathryn E. Stecke, Arne K. Strauss, Istenç Tarhan, Clemens Thielen, Paolo Toth, Tom Van Woensel, Greet Vanden Berghe, Christos Vasilakis, Vikrant Vaze, Daniele Vigo, Kai Virtanen, Xun Wang, Rafal Weron, Leroy White, Mike Yearworth, E. Alper Yildirim, Georges Zaccour, Xuying Zhao
2024	J	`jnl`	Planning a zero-emission mixed-fleet public bus system with minimal life cycle cost. Public Transp. Nathalie Marion Frieß, Ulrich Pferschy
2024	J	`jnl`	Rescheduling with New Orders Under Bounded Disruption. INFORMS J. Comput. Stefan Lendl, Ulrich Pferschy, Elena Rener
2023	J	`jnl`	Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs. J. Sched. Ulrich Pferschy, Julia Resch, Giovanni Righini
2023	J	`jnl`	Allocation of indivisible items with individual preference graphs. Discret. Appl. Math. Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy, Nevena Pivac
2023	J	`jnl`	Approximating single- and multi-objective nonlinear sum and product knapsack problems. Discret. Optim. Jan Boeckmann, Clemens Thielen, Ulrich Pferschy
2023	J	`jnl`	Corrigendum to: 'Integer optimization with penalized fractional values: The Knapsack case' [European Journal of Operational Research (2019) 874-888]. Eur. J. Oper. Res. Enrico Malaguti, Michele Monaci, Paolo Paronuzzi, Ulrich Pferschy
2023	J	`jnl`	Fair Allocation Algorithms for Indivisible Items under Structured Conflict Constraints. CoRR Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Joachim Schauer
2023	J	`jnl`	Fair Allocation of Indivisible Items with Conflict Graphs. Algorithmica Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer
2023	J	`jnl`	Fair allocation algorithms for indivisible items under structured conflict constraints. Comput. Appl. Math. Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Joachim Schauer
2023	J	`jnl`	Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph. CoRR Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy
2023	J	`jnl`	One-dimensional stock cutting resilient against singular random defects. Comput. Oper. Res. Claudio Arbib, Fabrizio Marinelli, Ulrich Pferschy, Fatemeh K. Ranjbar
2023	J	`jnl`	REDS: Resource-Efficient Deep Subnetworks for Dynamic Resource Constraints. CoRR Francesco Corti, Balz Maag, Joachim Schauer, Ulrich Pferschy, Olga Saukh
2022	J	`jnl`	Allocation of Indivisible Items with Individual Preference Graphs. CoRR Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy, Nevena Pivac
2022	J	`jnl`	Bin packing with lexicographic objectives for loading weight- and volume-constrained trucks in a direct-shipping system. OR Spectr. Katrin Heßler, Stefan Irnich, Tobias Kreiter, Ulrich Pferschy
2021	—	`conf`	Allocating Indivisible Items with Minimum Dissatisfaction on Preference Graphs. ADT Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Nevena Pivac, Ulrich Pferschy
2021	J	`jnl`	Approximating the product knapsack problem. Optim. Lett. Ulrich Pferschy, Joachim Schauer, Clemens Thielen
2021	B	`conf`	Decision-Support System for the Optimal Technology Split of a Decarbonized Bus Network. COMPSAC Nathalie Frieß, Ulrich Pferschy
2021	J	`jnl`	On the Stackelberg knapsack game. Eur. J. Oper. Res. Ulrich Pferschy, Gaia Nicosia, Andrea Pacifici, Joachim Schauer
2021	J	`jnl`	Optimally rescheduling jobs with a LIFO buffer. CoRR Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy, Julia Resch, Giovanni Righini
2021	J	`jnl`	Optimally rescheduling jobs with a Last-In-First-Out buffer. J. Sched. Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy, Julia Resch, Giovanni Righini
2020	C	`conf`	Fair Packing of Independent Sets. IWOCA Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer
2020	J	`jnl`	Fair packing of independent sets. CoRR Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer
2020	J	`jnl`	Integer programming models versus advanced planning business software for a multi-level mixed-model assembly line problem. Central Eur. J. Oper. Res. Tobias Kreiter, Ulrich Pferschy
2019	J	`jnl`	A Stackelberg knapsack game with weight control. Theor. Comput. Sci. Ulrich Pferschy, Gaia Nicosia, Andrea Pacifici
2019	J	`jnl`	Geometric and LP-based heuristics for angular travelling salesman problems in the plane. Comput. Oper. Res. Rostislav Stanek, Peter Greistorfer, Klaus Ladner, Ulrich Pferschy
2019	J	`jnl`	Integer optimization with penalized fractional values: The Knapsack case. Eur. J. Oper. Res. Enrico Malaguti, Michele Monaci, Paolo Paronuzzi, Ulrich Pferschy
2019	J	`jnl`	New exact approaches and approximation results for the Penalized Knapsack Problem. Discret. Appl. Math. Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia
2019	J	`jnl`	On approximating the Incremental Knapsack Problem. Discret. Appl. Math. Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia
2019	J	`jnl`	The Product Knapsack Problem: Approximation and Complexity. CoRR Ulrich Pferschy, Joachim Schauer, Clemens Thielen
2018	J	`jnl`	Approximating the 3-period Incremental Knapsack Problem. J. Discrete Algorithms Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia
2018	J	`jnl`	Approximating the Incremental Knapsack Problem. CoRR Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia
2018	J	`jnl`	Competitive multi-agent scheduling with an iterative selection rule. 4OR Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
2018	J	`jnl`	Geometric and LP-based heuristics for the quadratic travelling salesman problem. CoRR Rostislav Stanek, Peter Greistorfer, Klaus Ladner, Ulrich Pferschy
2018	J	`jnl`	Improved dynamic programming and approximation results for the knapsack problem with setups. Int. Trans. Oper. Res. Ulrich Pferschy, Rosario Scatamacchia
2018	J	`jnl`	On a Stackelberg Subset Sum Game. CoRR Ulrich Pferschy, Gaia Nicosia, Andrea Pacifici
2018	J	`jnl`	On a Stackelberg Subset Sum Game. Electron. Notes Discret. Math. Ulrich Pferschy, Gaia Nicosia, Andrea Pacifici
2018	J	`jnl`	Optimised scheduling in human-robot collaboration - a use case in the assembly of printed circuit boards. Int. J. Prod. Res. Karin Bogner, Ulrich Pferschy, Roland Unterberger, Herwig Zeiner
2018	J	`jnl`	Order Batching and Routing in a Non-Standard Warehouse. Electron. Notes Discret. Math. Ulrich Pferschy, Joachim Schauer
2017	C	`conf`	Approximation Results for the Incremental Knapsack Problem. IWOCA Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia
2017	J	`jnl`	Approximation of knapsack problems with conflict and forcing graphs. J. Comb. Optim. Ulrich Pferschy, Joachim Schauer
2017	J	`jnl`	Dynamic programming algorithms, efficient solution of the LP-relaxation and approximation schemes for the Penalized Knapsack Problem. CoRR Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia
2017	J	`jnl`	Generating subtour elimination constraints for the TSP from pure integer solutions. Central Eur. J. Oper. Res. Ulrich Pferschy, Rostislav Stanek
2017	J	`jnl`	On the Shortest Path Game. Discret. Appl. Math. Andreas Darmann, Ulrich Pferschy, Joachim Schauer
2017	J	`jnl`	Price of Fairness for allocating a bounded resource. Eur. J. Oper. Res. Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
2017	J	`jnl`	The shortest connection game. Discret. Appl. Math. Andreas Darmann, Ulrich Pferschy, Joachim Schauer
2016	—	`conf`	A Simulation study of Fairness-Profit Trade-off in Project Selection based on HHI and Knapsack Models. EMS Maurizio Naldi, Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy, Bernhard Leder
2016	J	`jnl`	Approximation of the Quadratic Knapsack Problem. INFORMS J. Comput. Ulrich Pferschy, Joachim Schauer
2016	J	`jnl`	Linear Models and Computational Experiments for the Quadratic TSP. Electron. Notes Discret. Math. Anja Fischer, J. Fabian Meier, Ulrich Pferschy, Rostislav Stanek
2016	J	`jnl`	Maximin Fairness in Project Budget Allocation. Electron. Notes Discret. Math. Maurizio Naldi, Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
2016	—	`conf`	Maximin Fairness-profit Tradeoff in Project Budget Allocation. CENTERIS/ProjMAN/HCist Maurizio Naldi, Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
2015	B	`conf`	Brief Announcement: On the Fair Subset Sum Problem. SAGT Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
2015	J	`jnl`	On the shortest path game: extended version. CoRR Andreas Darmann, Ulrich Pferschy, Joachim Schauer
2015	—	`conf`	Personnel Planning with Multi-tasking and Structured Qualifications. OR Tobias Kreiter, Ulrich Pferschy, Joachim Schauer
2015	J	`jnl`	Price of Fairness for Allocating a Bounded Resource. CoRR Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
2015	C	`conf`	Price of Fairness for Multiagent Subset Sum Problems. CTW Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
2015	J	`jnl`	Scheduling two agent task chains with a central selection mechanism. J. Sched. Alessandro Agnetis, Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
2015	J	`jnl`	The Shortest Connection Game. CoRR Andreas Darmann, Ulrich Pferschy, Joachim Schauer
2015	J	`jnl`	Two agent scheduling with a central selection mechanism. Theor. Comput. Sci. Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
2014	—	`conf`	A Quadratic Knapsack Model for Optimizing the Media Mix of a Promotional Campaign. ICORES (Selected Papers) Ulrich Pferschy, Joachim Schauer, Gerhild Maier
2014	C	`conf`	Media Mix Optimization - Applying a Quadratic Knapsack Model. ICORES Ulrich Pferschy, Joachim Schauer, Gerhild Maier
2014	—	`conf`	The Shortest Path Game: Complexity and Algorithms. IFIP TCS Andreas Darmann, Ulrich Pferschy, Joachim Schauer
2014	J	`jnl`	The Subset Sum game. Eur. J. Oper. Res. Andreas Darmann, Gaia Nicosia, Ulrich Pferschy, Joachim Schauer
2013	B	`conf`	Approximating the Quadratic Knapsack Problem on Special Graph Classes. WAOA Ulrich Pferschy, Joachim Schauer
2013	J	`jnl`	Exact solution of the robust knapsack problem. Comput. Oper. Res. Michele Monaci, Ulrich Pferschy, Paolo Serafini
2013	J	`jnl`	On the Robust Knapsack Problem. SIAM J. Optim. Michele Monaci, Ulrich Pferschy
2013	J	`jnl`	Strategies in competing subset selection. Ann. Oper. Res. Claudia Marini, Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
2013	J	`jnl`	The maximum flow problem with disjunctive constraints. J. Comb. Optim. Ulrich Pferschy, Joachim Schauer
2013	—	`conf`	Two Agents Competing for a Shared Machine. ADT Alessandro Agnetis, Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
2012	J	`jnl`	Committee selection under weight constraints. Math. Soc. Sci. Christian Klamler, Ulrich Pferschy, Stefan Ruzika
2012	C	`conf`	Strategies for Single-machine Multi-agent Scheduling Problems. CTW Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
2011	J	`jnl`	Competitive subset selection with two agents. Discret. Appl. Math. Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
2011	C	`conf`	On the Robust Knapsack Problem. CTW Michele Monaci, Ulrich Pferschy
2011	J	`jnl`	Paths, trees and matchings under disjunctive constraints. Discret. Appl. Math. Andreas Darmann, Ulrich Pferschy, Joachim Schauer, Gerhard J. Woeginger
2011	C	`conf`	The Maximum Flow Problem with Conflict and Forcing Conditions. INOC Ulrich Pferschy, Joachim Schauer
2010	J	`jnl`	A note on maximizing the minimum voter satisfaction on spanning trees. Math. Soc. Sci. Andreas Darmann, Christian Klamler, Ulrich Pferschy
2010	J	`jnl`	Resource allocation with time intervals. Theor. Comput. Sci. Andreas Darmann, Ulrich Pferschy, Joachim Schauer
2010	J	`jnl`	The Multidimensional Knapsack Problem: Structure and Algorithms. INFORMS J. Comput. Jakob Puchinger, Günther R. Raidl, Ulrich Pferschy
2009	J	`jnl`	A Two-Period Portfolio Selection Model for Asset-backed Securitization. Algorithmic Oper. Res. Renata Mansini, Ulrich Pferschy
2009	C	`conf`	Combinatorial Optimization Problems with Conflict Graphs. CTW Andreas Darmann, Ulrich Pferschy, Joachim Schauer, Gerhard J. Woeginger
2009	—	`conf`	Committee Selection with a Weight Constraint Based on Lexicographic Rankings of Individuals. ADT Christian Klamler, Ulrich Pferschy, Stefan Ruzika
2009	—	`conf`	Determining a Minimum Spanning Tree with Disjunctive Constraints. ADT Andreas Darmann, Ulrich Pferschy, Joachim Schauer
2009	J	`jnl`	Inverse 1-center location problems with edge length augmentation on trees. Computing Behrooz Alizadeh, Rainer E. Burkard, Ulrich Pferschy
2009	J	`jnl`	Maximizing the minimum voter satisfaction on spanning trees. Math. Soc. Sci. Andreas Darmann, Christian Klamler, Ulrich Pferschy
2009	C	`conf`	On Multi-Agent Knapsack Problems. CTW Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
2009	—	`conf`	Subset Weight Maximization with Two Competing Agents. ADT Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
2009	J	`jnl`	The Knapsack Problem with Conflict Graphs. J. Graph Algorithms Appl. Ulrich Pferschy, Joachim Schauer
2007	J	`jnl`	The traveling group problem. Soc. Choice Welf. Christian Klamler, Ulrich Pferschy
2006	—	`conf`	A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks. OR Daniel Wagner, Günther R. Raidl, Ulrich Pferschy, Petra Mutzel, Peter Bachhiesl
2006	J	`jnl`	An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem. Math. Program. Ivana Ljubic, René Weiskircher, Ulrich Pferschy, Gunnar W. Klau, Petra Mutzel, Matteo Fischetti
2006	—	`conf`	ILP Models for a Nurse Scheduling Problem. OR Bettina Klinz, Ulrich Pferschy, Joachim Schauer
2006	B	`conf`	The Core Concept for the Multidimensional Knapsack Problem. EvoCOP Jakob Puchinger, Günther R. Raidl, Ulrich Pferschy
2005	J	`jnl`	Modified subset sum heuristics for bin packing. Inf. Process. Lett. Alberto Caprara, Ulrich Pferschy
2005	—	`conf`	Solving the Prize-Collecting Steiner Tree Problem to Optimality. ALENEX/ANALCO Ivana Ljubic, René Weiskircher, Ulrich Pferschy, Gunnar W. Klau, Petra Mutzel, Matteo Fischetti
2004	—	`conf`	Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem. GECCO (1) Gunnar W. Klau, Ivana Ljubic, Andreas Moser, Petra Mutzel, Philipp Neuner, Ulrich Pferschy, Günther R. Raidl, René Weiskircher
2004	J	`jnl`	Improved Dynamic Programming in Connection with an FPTAS for the Knapsack Problem. J. Comb. Optim. Hans Kellerer, Ulrich Pferschy
2004	—	`book`	Knapsack problems. Hans Kellerer, Ulrich Pferschy, David Pisinger
2004	J	`jnl`	Securitization of Financial Assets: Approximation in Theory and Practice. Comput. Optim. Appl. Renata Mansini, Ulrich Pferschy
2004	J	`jnl`	Worst-case analysis of the subset sum algorithm for bin packing. Oper. Res. Lett. Alberto Caprara, Ulrich Pferschy
2003	J	`jnl`	A 3/4-Approximation Algorithm for Multiple Subset Sum. J. Heuristics Alberto Caprara, Hans Kellerer, Ulrich Pferschy
2003	J	`jnl`	An efficient fully polynomial approximation scheme for the Subset-Sum Problem. J. Comput. Syst. Sci. Hans Kellerer, Renata Mansini, Ulrich Pferschy, Maria Grazia Speranza
2003	A	`conf`	The Fractional Prize-Collecting Steiner Tree Problem on Trees: Extended Abstract. ESA Gunnar W. Klau, Ivana Ljubic, Petra Mutzel, Ulrich Pferschy, René Weiskircher
2002	J	`jnl`	Approximating Multiobjective Knapsack Problems. Manag. Sci. Thomas Erlebach, Hans Kellerer, Ulrich Pferschy
2001	B	`conf`	Approximating Multi-objective Knapsack Problems. WADS Thomas Erlebach, Hans Kellerer, Ulrich Pferschy
2001	—	`conf`	Approximation Schemes for Ordered Vector Packing Problems. RANDOM-APPROX Alberto Caprara, Hans Kellerer, Ulrich Pferschy
2000	J	`jnl`	A PTAS for the Multiple Subset Sum Problem with different knapsack capacities. Inf. Process. Lett. Alberto Caprara, Hans Kellerer, Ulrich Pferschy
2000	J	`jnl`	Approximation algorithms for knapsack problems with cardinality constraints. Eur. J. Oper. Res. Alberto Caprara, Hans Kellerer, Ulrich Pferschy, David Pisinger
2000	J	`jnl`	The Multiple Subset Sum Problem. SIAM J. Optim. Alberto Caprara, Hans Kellerer, Ulrich Pferschy
1999	J	`jnl`	A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem. J. Comb. Optim. Hans Kellerer, Ulrich Pferschy
1999	J	`jnl`	Cardinality constrained bin‐packing problems. Ann. Oper. Res. Hans Kellerer, Ulrich Pferschy
1999	J	`jnl`	Dynamic Programming Revisited: Improving Knapsack Algorithms. Computing Ulrich Pferschy
1998	—	`conf`	A New Fully Polynomial Approximation Scheme for the Knapsack Problem. APPROX Hans Kellerer, Ulrich Pferschy
1997	B	`conf`	An Efficient Approximation Scheme for the Subset-Sum Problem. ISAAC Hans Kellerer, Ulrich Pferschy, Maria Grazia Speranza
1997	J	`jnl`	Greedy Algorithms for On-Line Data Compression. J. Algorithms József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger
1997	J	`jnl`	Simple But Efficient Approaches for the Collapsing Knapsack Problem. Discret. Appl. Math. Ulrich Pferschy, David Pisinger, Gerhard J. Woeginger
1997	J	`jnl`	Solution Methods and Computational Investigations for the Linear Bottleneck Assignment Problem. Computing Ulrich Pferschy
1996	J	`jnl`	The Fractional Greedy Algorithm for Data Compression. Computing József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger
1995	B	`conf`	The Random Linear Bottleneck Assignment Problem. IPCO Ulrich Pferschy
1995	—	`conf`	Worst-Case Analysis for On-Line Data Compression. Combinatorics and Computer Science József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger
1994	J	`jnl`	Linear programs with an additional rank two reverse convex constraint. J. Glob. Optim. Ulrich Pferschy, Hoang Tuy
1994	J	`jnl`	Monge matrices make maximization manageable. Oper. Res. Lett. Ulrich Pferschy, Rüdiger Rudolf, Gerhard J. Woeginger
1994	J	`jnl`	Partitioning Graphs into Two Trees. Acta Cybern. Ulrich Pferschy, Gerhard J. Woeginger, En-Yu Yao
1994	J	`jnl`	Some Geometric Clustering Problems. Nord. J. Comput. Ulrich Pferschy, Rüdiger Rudolf, Gerhard J. Woeginger