The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Ulrich Pferschy: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ivana Ljubic, René Weiskircher, Ulrich Pferschy, Gunnar W. Klau, Petra Mutzel, Matteo Fischetti
    Solving the Prize-Collecting Steiner Tree Problem to Optimality. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALCO, 2005, pp:68-76 [Conf]
  2. Hans Kellerer, Ulrich Pferschy
    A New Fully Polynomial Approximation Scheme for the Knapsack Problem. [Citation Graph (0, 0)][DBLP]
    APPROX, 1998, pp:123-134 [Conf]
  3. József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger
    Worst-Case Analysis for On-Line Data Compression. [Citation Graph (0, 0)][DBLP]
    Combinatorics and Computer Science, 1995, pp:288-300 [Conf]
  4. Gunnar W. Klau, Ivana Ljubic, Petra Mutzel, Ulrich Pferschy, René Weiskircher
    The Fractional Prize-Collecting Steiner Tree Problem on Trees: Extended Abstract. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:691-702 [Conf]
  5. Jakob Puchinger, Günther R. Raidl, Ulrich Pferschy
    The Core Concept for the Multidimensional Knapsack Problem. [Citation Graph (0, 0)][DBLP]
    EvoCOP, 2006, pp:195-208 [Conf]
  6. 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. [Citation Graph (0, 0)][DBLP]
    GECCO (1), 2004, pp:1304-1315 [Conf]
  7. Ulrich Pferschy
    The Random Linear Bottleneck Assignment Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 1995, pp:145-156 [Conf]
  8. Hans Kellerer, Ulrich Pferschy, Maria Grazia Speranza
    An Efficient Approximation Scheme for the Subset-Sum Problem. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1997, pp:394-403 [Conf]
  9. Alberto Caprara, Hans Kellerer, Ulrich Pferschy
    Approximation Schemes for Ordered Vector Packing Problems. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:63-74 [Conf]
  10. Thomas Erlebach, Hans Kellerer, Ulrich Pferschy
    Approximating Multi-objective Knapsack Problems. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:210-221 [Conf]
  11. Ulrich Pferschy, Gerhard J. Woeginger, En-Yu Yao
    Partitioning Graphs into Two Trees. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1994, v:11, n:3, pp:233-240 [Journal]
  12. József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger
    The Fractional Greedy Algorithm for Data Compression. [Citation Graph (0, 0)][DBLP]
    Computing, 1996, v:56, n:1, pp:29-46 [Journal]
  13. Ulrich Pferschy
    Solution Methods and Computational Investigations for the Linear Bottleneck Assignment Problem. [Citation Graph (0, 0)][DBLP]
    Computing, 1997, v:59, n:3, pp:237-258 [Journal]
  14. Ulrich Pferschy
    Dynamic Programming Revisited: Improving Knapsack Algorithms. [Citation Graph (0, 0)][DBLP]
    Computing, 1999, v:63, n:4, pp:419-430 [Journal]
  15. Ulrich Pferschy, David Pisinger, Gerhard J. Woeginger
    Simple But Efficient Approaches for the Collapsing Knapsack Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:77, n:3, pp:271-280 [Journal]
  16. Alberto Caprara, Hans Kellerer, Ulrich Pferschy
    A 3/4-Approximation Algorithm for Multiple Subset Sum. [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 2003, v:9, n:2, pp:99-111 [Journal]
  17. Alberto Caprara, Hans Kellerer, Ulrich Pferschy
    A PTAS for the Multiple Subset Sum Problem with different knapsack capacities. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:73, n:3-4, pp:111-118 [Journal]
  18. Alberto Caprara, Ulrich Pferschy
    Modified subset sum heuristics for bin packing. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:96, n:1, pp:18-23 [Journal]
  19. József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger
    Greedy Algorithms for On-Line Data Compression. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:25, n:2, pp:274-289 [Journal]
  20. Hans Kellerer, Ulrich Pferschy
    Improved Dynamic Programming in Connection with an FPTAS for the Knapsack Problem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2004, v:8, n:1, pp:5-11 [Journal]
  21. Hans Kellerer, Ulrich Pferschy
    A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1999, v:3, n:1, pp:59-71 [Journal]
  22. Hans Kellerer, Renata Mansini, Ulrich Pferschy, Maria Grazia Speranza
    An efficient fully polynomial approximation scheme for the Subset-Sum Problem. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:66, n:2, pp:349-370 [Journal]
  23. 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. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:105, n:2-3, pp:427-449 [Journal]
  24. Ulrich Pferschy, Rüdiger Rudolf, Gerhard J. Woeginger
    Some Geometric Clustering Problems. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1994, v:1, n:2, pp:246-263 [Journal]
  25. Alberto Caprara, Ulrich Pferschy
    Worst-case analysis of the subset sum algorithm for bin packing. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:2, pp:159-166 [Journal]

  26. ILP Models for a Nurse Scheduling Problem. [Citation Graph (, )][DBLP]


  27. A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks. [Citation Graph (, )][DBLP]


  28. Combinatorial Optimization Problems with Conflict Graphs. [Citation Graph (, )][DBLP]


  29. On Multi-Agent Knapsack Problems. [Citation Graph (, )][DBLP]


  30. Determining a Minimum Spanning Tree with Disjunctive Constraints. [Citation Graph (, )][DBLP]


  31. Committee Selection with a Weight Constraint Based on Lexicographic Rankings of Individuals. [Citation Graph (, )][DBLP]


  32. Subset Weight Maximization with Two Competing Agents. [Citation Graph (, )][DBLP]


  33. Inverse 1-center location problems with edge length augmentation on trees. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.302secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002