The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Lene M. Favrholdt: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Joan Boyar, Lene M. Favrholdt
    The Relative Worst Order Ratio for On-Line Algorithms. [Citation Graph (0, 0)][DBLP]
    CIAC, 2003, pp:58-69 [Conf]
  2. Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen
    Extending the Accommodating Function. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:87-96 [Conf]
  3. Leah Epstein, Lene M. Favrholdt
    On-Line Maximizing the Number of Items Packed in Variable-Sized Bins. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:467-475 [Conf]
  4. Joan Boyar, Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt, Kim S. Larsen, Morten Monrad Pedersen, Sanne Wøhlk
    The Maximum Resource Bin Packing Problem. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:397-408 [Conf]
  5. Lene M. Favrholdt, Morten N. Nielsen
    On-Line Edge-Coloring with a Fixed Number of Colors. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:106-116 [Conf]
  6. Leah Epstein, Lene M. Favrholdt
    Optimal Non-preemptive Semi-online Scheduling on Two Related Machines. [Citation Graph (0, 0)][DBLP]
    MFCS, 2002, pp:245-256 [Conf]
  7. Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
    The relative worst order ratio applied to paging. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:718-727 [Conf]
  8. Susanne Albers, Lene M. Favrholdt, Oliver Giel
    On paging with locality of reference. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:258-267 [Conf]
  9. Joan Boyar, Lene M. Favrholdt
    Scheduling Jobs on Grid Processors. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:17-28 [Conf]
  10. Yossi Azar, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen
    Fair versus Unrestricted Bin Packing. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:200-213 [Conf]
  11. Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen
    Extending the accommodating function. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2003, v:40, n:1, pp:3-35 [Journal]
  12. Leah Epstein, Lene M. Favrholdt
    On-Line Maximizing the Number of Items Packed in Variable-Sized Bins. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 2003, v:16, n:1, pp:57-66 [Journal]
  13. Yossi Azar, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen, Leah Epstein
    Fair versus Unrestricted Bin Packing. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:34, n:2, pp:181-196 [Journal]
  14. Lene M. Favrholdt, Morten N. Nielsen
    On-Line Edge-Coloring with a Fixed Number of Colors. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:35, n:2, pp:176-191 [Journal]
  15. Leah Epstein, Lene M. Favrholdt
    Optimal non-preemptive semi-online scheduling on two related machines. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2005, v:57, n:1, pp:49-73 [Journal]
  16. Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt
    Separating online scheduling algorithms with the relative worst order ratio. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2006, v:12, n:4, pp:363-386 [Journal]
  17. Susanne Albers, Lene M. Favrholdt, Oliver Giel
    On paging with locality of reference. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2005, v:70, n:2, pp:145-175 [Journal]
  18. Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen
    The Competitive Ratio for On-Line Dual Bin Packing with Restricted Input Sequences. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2001, v:8, n:4, pp:463-472 [Journal]
  19. Leah Epstein, Lene M. Favrholdt
    Optimal preemptive semi-online scheduling to minimize makespan on two related machines. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2002, v:30, n:4, pp:269-275 [Journal]
  20. Eric Bach, Joan Boyar, Leah Epstein, Lene M. Favrholdt, Tao Jiang, Kim S. Larsen, Guo-Hui Lin, Rob van Stee
    Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2003, v:6, n:2, pp:131-147 [Journal]
  21. Joan Boyar, Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt, Kim S. Larsen, Morten Monrad Pedersen, Sanne Wøhlk
    The maximum resource bin packing problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:362, n:1-3, pp:127-139 [Journal]
  22. Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
    The relative worst-order ratio applied to paging. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2007, v:73, n:5, pp:818-843 [Journal]
  23. Joan Boyar, Lene M. Favrholdt
    The relative worst order ratio for online algorithms. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:2, pp:- [Journal]

  24. Comparing First-Fit and Next-Fit for Online Edge Coloring. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002