2008 |
24 | EE | 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 |
2007 |
23 | EE | Joan Boyar,
Lene M. Favrholdt:
The relative worst order ratio for online algorithms.
ACM Transactions on Algorithms 3(2): (2007) |
22 | EE | 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) |
2006 |
21 | EE | Joan Boyar,
Lene M. Favrholdt:
Scheduling Jobs on Grid Processors.
SWAT 2006: 17-28 |
20 | EE | 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) |
19 | EE | 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) |
2005 |
18 | EE | 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 |
17 | EE | Joan Boyar,
Lene M. Favrholdt,
Kim S. Larsen:
The relative worst order ratio applied to paging.
SODA 2005: 718-727 |
16 | EE | Leah Epstein,
Lene M. Favrholdt:
Optimal non-preemptive semi-online scheduling on two related machines.
J. Algorithms 57(1): 49-73 (2005) |
15 | EE | Susanne Albers,
Lene M. Favrholdt,
Oliver Giel:
On paging with locality of reference.
J. Comput. Syst. Sci. 70(2): 145-175 (2005) |
2003 |
14 | EE | Joan Boyar,
Lene M. Favrholdt:
The Relative Worst Order Ratio for On-Line Algorithms.
CIAC 2003: 58-69 |
13 | EE | Leah Epstein,
Lene M. Favrholdt:
On-Line Maximizing the Number of Items Packed in Variable-Sized Bins.
Acta Cybern. 16(1): 57-66 (2003) |
12 | EE | Joan Boyar,
Lene M. Favrholdt,
Kim S. Larsen,
Morten N. Nielsen:
Extending the accommodating function.
Acta Inf. 40(1): 3-35 (2003) |
11 | EE | Lene M. Favrholdt,
Morten N. Nielsen:
On-Line Edge-Coloring with a Fixed Number of Colors.
Algorithmica 35(2): 176-191 (2003) |
10 | | 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) |
2002 |
9 | EE | Leah Epstein,
Lene M. Favrholdt:
On-Line Maximizing the Number of Items Packed in Variable-Sized Bins.
COCOON 2002: 467-475 |
8 | EE | Joan Boyar,
Lene M. Favrholdt,
Kim S. Larsen,
Morten N. Nielsen:
Extending the Accommodating Function.
COCOON 2002: 87-96 |
7 | EE | Leah Epstein,
Lene M. Favrholdt:
Optimal Non-preemptive Semi-online Scheduling on Two Related Machines.
MFCS 2002: 245-256 |
6 | EE | Susanne Albers,
Lene M. Favrholdt,
Oliver Giel:
On paging with locality of reference.
STOC 2002: 258-267 |
5 | EE | 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) |
4 | EE | 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) |
2001 |
3 | EE | 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) |
2000 |
2 | EE | Lene M. Favrholdt,
Morten N. Nielsen:
On-Line Edge-Coloring with a Fixed Number of Colors.
FSTTCS 2000: 106-116 |
1 | EE | Yossi Azar,
Joan Boyar,
Lene M. Favrholdt,
Kim S. Larsen,
Morten N. Nielsen:
Fair versus Unrestricted Bin Packing.
SWAT 2000: 200-213 |