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

Search the dblp DataBase

Title:
Author:
Hans Kellerer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Hans Kellerer, Franz Rendl, Gerhard J. Woeginger
    Computing the optimum stock size. [Citation Graph (0, 0)][DBLP]
    IPCO, 1993, pp:147-159 [Conf]
  3. Luitpold Babel, Bo Chen, Hans Kellerer, Vladimir Kotov
    On-Line Algorithms for Cardinality Constrained Bin Packing Problems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:695-706 [Conf]
  4. 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]
  5. 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]
  6. Hans Kellerer
    A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 1999, pp:51-62 [Conf]
  7. Hans Kellerer, Thomas Tautenhahn, Gerhard J. Woeginger
    Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:418-426 [Conf]
  8. Thomas Erlebach, Hans Kellerer, Ulrich Pferschy
    Approximating Multi-objective Knapsack Problems. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:210-221 [Conf]
  9. Gábor Galambos, Hans Kellerer, Gerhard J. Woeginger
    A Lower Bound for On-Line Vector-Packing Algorithms. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1993, v:11, n:1-2, pp:23-34 [Journal]
  10. Rainer E. Burkard, Y. He, Hans Kellerer
    A Linear Compound Algorithm for Uniform Machine Scheduling. [Citation Graph (0, 0)][DBLP]
    Computing, 1998, v:61, n:1, pp:1-10 [Journal]
  11. Hans Kellerer, Gerhard J. Woeginger
    UET-scheduling with constrained processor allocations. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1992, v:19, n:1, pp:1-8 [Journal]
  12. Luitpold Babel, Bo Chen, Hans Kellerer, Vladimir Kotov
    Algorithms for on-line bin-packing problems with cardinality constraints. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:238-251 [Journal]
  13. Hans Kellerer, Vitaly A. Strusevich
    Scheduling problems for parallel dedicated machines under multiple resource constraints. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:133, n:1-3, pp:45-68 [Journal]
  14. Hans Kellerer, Gerhard J. Woeginger
    On the Euclidean two Paths Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:47, n:2, pp:165-173 [Journal]
  15. Hans Kellerer, Gerhard J. Woeginger
    A Tight Bound for 3-Partitioning. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:45, n:3, pp:249-259 [Journal]
  16. Werner Heise, Hans Kellerer
    Eine Verschärfung der Quadratwurzel-Schranke für Quadratische-Rest-Codes einer Länge n = -1 mod 4. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1987, v:23, n:2/3, pp:113-124 [Journal]
  17. Peter Greistorfer, Hans Kellerer
    Bounds and Tabu Search for a Cyclic Max-Min Scheduling Problem. [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 2001, v:7, n:4, pp:371-390 [Journal]
  18. 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]
  19. 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]
  20. Paolo Dell'Olmo, Hans Kellerer, Maria Grazia Speranza, Zsolt Tuza
    A 13/12 Approximation Algorithm for Bin Packing with Extendable Bins. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:65, n:5, pp:229-233 [Journal]
  21. 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]
  22. 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]
  23. József Békési, Gábor Galambos, Hans Kellerer
    A 5/4 Linear Time Bin Packing Algorithm. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2000, v:60, n:1, pp:145-160 [Journal]
  24. 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]
  25. Hans Kellerer, Vladimir Kotov
    An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:1, pp:35-41 [Journal]
  26. Hans Kellerer, Vladimir Kotov, Maria Grazia Speranza, Zsolt Tuza
    Semi on-line algorithms for the partition problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1997, v:21, n:5, pp:235-242 [Journal]
  27. Hans Kellerer, Thomas Tautenhahn, Gerhard J. Woeginger
    Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:4, pp:1155-1166 [Journal]
  28. T. C. Edwin Cheng, Hans Kellerer, Vladimir Kotov
    Semi-on-line multiprocessor scheduling with given total processing time. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:337, n:1-3, pp:134-146 [Journal]
  29. Hans Kellerer, Vitaly A. Strusevich
    A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:230-238 [Journal]
  30. Hans Kellerer, Vitaly A. Strusevich
    Scheduling parallel dedicated machines under a single non-shared resource. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2003, v:147, n:2, pp:345-364 [Journal]
  31. Hans Kellerer, Günther Wirsching
    Prime covers and periodic patterns. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:85, n:2, pp:191-206 [Journal]

  32. Operator non-availability periods. [Citation Graph (, )][DBLP]


Search in 0.048secs, Finished in 0.050secs
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