| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy |
Competitive subset selection with two agents.  |
Discrete Applied Mathematics  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Darmann, Ulrich Pferschy, Joachim Schauer, Gerhard J. Woeginger |
Paths, trees and matchings under disjunctive constraints. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ulrich Pferschy, Joachim Schauer |
The Maximum Flow Problem with Conflict and Forcing Conditions. |
INOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michele Monaci, Ulrich Pferschy |
On the Robust Knapsack Problem. |
CTW |
2011 |
DBLP BibTeX RDF |
|
| 1 | Andreas Darmann, Ulrich Pferschy, Joachim Schauer |
Resource allocation with time intervals. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Darmann, Christian Klamler, Ulrich Pferschy |
A note on maximizing the minimum voter satisfaction on spanning trees. |
Mathematical Social Sciences |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jakob Puchinger, Günther R. Raidl, Ulrich Pferschy |
The Multidimensional Knapsack Problem: Structure and Algorithms. |
INFORMS Journal on Computing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Behrooz Alizadeh, Rainer E. Burkard, Ulrich Pferschy |
Inverse 1-center location problems with edge length augmentation on trees. |
Computing |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Renata Mansini, Ulrich Pferschy |
A Two-Period Portfolio Selection Model for Asset-backed Securitization. |
Algorithmic Operations Research |
2009 |
DBLP BibTeX RDF |
|
| 1 | Andreas Darmann, Christian Klamler, Ulrich Pferschy |
Maximizing the minimum voter satisfaction on spanning trees. |
Mathematical Social Sciences |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ulrich Pferschy, Joachim Schauer |
The Knapsack Problem with Conflict Graphs. |
J. Graph Algorithms Appl. |
2009 |
DBLP BibTeX RDF |
|
| 1 | Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy |
Subset Weight Maximization with Two Competing Agents. |
ADT |
2009 |
DBLP DOI BibTeX RDF |
multi-agent optimization, games |
| 1 | Andreas Darmann, Ulrich Pferschy, Joachim Schauer |
Determining a Minimum Spanning Tree with Disjunctive Constraints. |
ADT |
2009 |
DBLP DOI BibTeX RDF |
minimum spanning tree, conflict graph |
| 1 | Christian Klamler, Ulrich Pferschy, Stefan Ruzika |
Committee Selection with a Weight Constraint Based on Lexicographic Rankings of Individuals. |
ADT |
2009 |
DBLP DOI BibTeX RDF |
knapsack constraint, committee selection |
| 1 | Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy |
On Multi-Agent Knapsack Problems. |
CTW |
2009 |
DBLP BibTeX RDF |
|
| 1 | Andreas Darmann, Ulrich Pferschy, Joachim Schauer, Gerhard J. Woeginger |
Combinatorial Optimization Problems with Conflict Graphs. |
CTW |
2009 |
DBLP BibTeX RDF |
|
| 1 | Christian Klamler, Ulrich Pferschy |
The traveling group problem. |
Social Choice and Welfare |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2006 |
DBLP DOI BibTeX RDF |
Steiner Arborescence, Prize Collecting, Network Design, Branch-and-Cut |
| 1 | Jakob Puchinger, Günther R. Raidl, Ulrich Pferschy |
The Core Concept for the Multidimensional Knapsack Problem. |
EvoCOP |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Bettina Klinz, Ulrich Pferschy, Joachim Schauer |
ILP Models for a Nurse Scheduling Problem. |
OR |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Alberto Caprara, Ulrich Pferschy |
Modified subset sum heuristics for bin packing. |
Inf. Process. Lett. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Alberto Caprara, Ulrich Pferschy |
Worst-case analysis of the subset sum algorithm for bin packing. |
Oper. Res. Lett. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans Kellerer, Ulrich Pferschy |
Improved Dynamic Programming in Connection with an FPTAS for the Knapsack Problem. |
J. Comb. Optim. |
2004 |
DBLP DOI BibTeX RDF |
fully polynomial approximation scheme, dynamic programming, knapsack problem |
| 1 | Hans Kellerer, Ulrich Pferschy, David Pisinger |
Knapsack problems. |
|
2004 |
RDF |
|
| 1 | 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 |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Alberto Caprara, Hans Kellerer, Ulrich Pferschy |
A 3/4-Approximation Algorithm for Multiple Subset Sum. |
J. Heuristics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans Kellerer, Renata Mansini, Ulrich Pferschy, Maria Grazia Speranza |
An efficient fully polynomial approximation scheme for the Subset-Sum Problem. |
J. Comput. Syst. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Gunnar W. Klau, Ivana Ljubic, Petra Mutzel, Ulrich Pferschy, René Weiskircher |
The Fractional Prize-Collecting Steiner Tree Problem on Trees: Extended Abstract. |
ESA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Erlebach, Hans Kellerer, Ulrich Pferschy |
Approximating Multi-objective Knapsack Problems. |
WADS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Alberto Caprara, Hans Kellerer, Ulrich Pferschy |
Approximation Schemes for Ordered Vector Packing Problems. |
RANDOM-APPROX |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Alberto Caprara, Hans Kellerer, Ulrich Pferschy |
A PTAS for the Multiple Subset Sum Problem with different knapsack capacities. |
Inf. Process. Lett. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Alberto Caprara, Hans Kellerer, Ulrich Pferschy |
The Multiple Subset Sum Problem. |
SIAM Journal on Optimization |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Alberto Caprara, Hans Kellerer, Ulrich Pferschy, David Pisinger |
Approximation algorithms for knapsack problems with cardinality constraints. |
European Journal of Operational Research |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans Kellerer, Ulrich Pferschy |
A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem. |
J. Comb. Optim. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Ulrich Pferschy |
Dynamic Programming Revisited: Improving Knapsack Algorithms. |
Computing |
1999 |
DBLP DOI BibTeX RDF |
AMS Subject Classifications: 90C10, 90C39 |
| 1 | Hans Kellerer, Ulrich Pferschy |
A New Fully Polynomial Approximation Scheme for the Knapsack Problem. |
APPROX |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Ulrich Pferschy |
Solution Methods and Computational Investigations for the Linear Bottleneck Assignment Problem. |
Computing |
1997 |
DBLP BibTeX RDF |
|
| 1 | József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger |
Greedy Algorithms for On-Line Data Compression. |
J. Algorithms |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Ulrich Pferschy, David Pisinger, Gerhard J. Woeginger |
Simple But Efficient Approaches for the Collapsing Knapsack Problem. |
Discrete Applied Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans Kellerer, Ulrich Pferschy, Maria Grazia Speranza |
An Efficient Approximation Scheme for the Subset-Sum Problem. |
ISAAC |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger |
The Fractional Greedy Algorithm for Data Compression. |
Computing |
1996 |
DBLP DOI BibTeX RDF |
Optimal and heuristic encoding, textual substitution, shortest paths |
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Ulrich Pferschy |
The Random Linear Bottleneck Assignment Problem. |
IPCO |
1995 |
DBLP DOI BibTeX RDF |
Random Bottleneck Assignment, Average Case Analysis, Random Graphs |
| 1 | Ulrich Pferschy, Gerhard J. Woeginger, En-Yu Yao |
Partitioning Graphs into Two Trees. |
Acta Cybern. |
1994 |
DBLP BibTeX RDF |
|
| 1 | Ulrich Pferschy, Rüdiger Rudolf, Gerhard J. Woeginger |
Some Geometric Clustering Problems. |
Nord. J. Comput. |
1994 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")