Lene M. Favrholdt

Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt: Comparing online algorithms for bin packing problems. J. Scheduling 15(1): 13-21 (2012)

Joan Boyar, Lene M. Favrholdt: A new variable-sized bin packing problem. J. Scheduling 15(3): 273-287 (2012)

Leah Epstein, Lene M. Favrholdt, Asaf Levin: Online variable-sized bin packing with conflicts. Discrete Optimization 8(2): 333-343 (2011)

Joan Boyar, Lene M. Favrholdt: Scheduling Jobs on Grid Processors. Algorithmica 57(4): 819-847 (2010)

Martin R. Ehmsen, Lene M. Favrholdt, Jens S. Kohrt, Rodica Mihai: Comparing First-Fit and Next-Fit for online edge coloring. Theor. Comput. Sci. 411(16-18): 1734-1741 (2010)

Martin R. Ehmsen, Lene M. Favrholdt, Jens S. Kohrt, Rodica Mihai: Comparing First-Fit and Next-Fit for Online Edge Coloring. ISAAC 2008: 89-99

Joan Boyar, Lene M. Favrholdt, Kim S. Larsen: The relative worst-order ratio applied to paging. J. Comput. Syst. Sci. 73(5): 818-843 (2007)

Joan Boyar, Lene M. Favrholdt: The relative worst order ratio for online algorithms. ACM Transactions on Algorithms 3(2) (2007)

Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt: Separating online scheduling algorithms with the relative worst order ratio. J. Comb. Optim. 12(4): 363-386 (2006)

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. Theor. Comput. Sci. 362(1-3): 127-139 (2006)

Joan Boyar, Lene M. Favrholdt: Scheduling Jobs on Grid Processors. SWAT 2006: 17-28

Leah Epstein, Lene M. Favrholdt: Optimal non-preemptive semi-online scheduling on two related machines. J. Algorithms 57(1): 49-73 (2005)

Susanne Albers, Lene M. Favrholdt, Oliver Giel: On paging with locality of reference. J. Comput. Syst. Sci. 70(2): 145-175 (2005)

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. FCT 2005: 397-408

Joan Boyar, Lene M. Favrholdt, Kim S. Larsen: The relative worst order ratio applied to paging. SODA 2005: 718-727

Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen: Extending the accommodating function. Acta Inf. 40(1): 3-35 (2003)

Leah Epstein, Lene M. Favrholdt: On-Line Maximizing the Number of Items Packed in Variable-Sized Bins. Acta Cybern. 16(1): 57-66 (2003)

Lene M. Favrholdt, Morten N. Nielsen: On-Line Edge-Coloring with a Fixed Number of Colors. Algorithmica 35(2): 176-191 (2003)

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. J. Scheduling 6(2): 131-147 (2003)

Joan Boyar, Lene M. Favrholdt: The Relative Worst Order Ratio for On-Line Algorithms. CIAC 2003: 58-69

Yossi Azar, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen, Leah Epstein: Fair versus Unrestricted Bin Packing. Algorithmica 34(2): 181-196 (2002)

Leah Epstein, Lene M. Favrholdt: Optimal preemptive semi-online scheduling to minimize makespan on two related machines. Oper. Res. Lett. 30(4): 269-275 (2002)

Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen: Extending the Accommodating Function. COCOON 2002: 87-96

Leah Epstein, Lene M. Favrholdt: On-Line Maximizing the Number of Items Packed in Variable-Sized Bins. COCOON 2002: 467-475

Leah Epstein, Lene M. Favrholdt: Optimal Non-preemptive Semi-online Scheduling on Two Related Machines. MFCS 2002: 245-256

Susanne Albers, Lene M. Favrholdt, Oliver Giel: On paging with locality of reference. STOC 2002: 258-267

Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen: The Competitive Ratio for On-Line Dual Bin Packing with Restricted Input Sequences. Nord. J. Comput. 8(4): 463-472 (2001)

Lene M. Favrholdt, Morten N. Nielsen: On-Line Edge-Coloring with a Fixed Number of Colors. FSTTCS 2000: 106-116

Yossi Azar, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen: Fair versus Unrestricted Bin Packing. SWAT 2000: 200-213