| |
Publications
- Comparing Online Algorithms for Bin Packing Problems
- Leah Epstein, Lene M. Favrholdt, and Jens S. Kohrt
Journal of Scheduling (to appear)
- Scheduling Jobs on Grid Processors
- Joan Boyar and Lene M. Favrholdt
Algorithmica (to appear)
(Preliminary version in SWAT 2006, LNCS 4059: 17-28.)
- Comparing First-Fit and Next-Fit for Online Edge Coloring
- Martin R. Ehmsen, Lene M. Favrholdt, Jens S. Kohrt, and Rodica Mihai
19th International Symposium on Algorithms and Computation, 89-99, 2008.
- The Relative Worst-Order Ratio Applied to Paging
- Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
Journal of Computer and System Sciences, 73: 818-843, 2007.
(Preliminary version in SODA 2005, 718-727.)
- The Relative Worst Order Ratio for On-Line Algorithms
- Joan Boyar, Lene M. Favrholdt
- ACM Transactions on Algorithms, 3(2), 2007.
- (Preliminary version in CIAC 2003, LNCS 2653: 58-69.)
- Separating Online Scheduling Algorithms with the Relative Worst Order Ratio.
- Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt
- Journal of Combinatorial Optimization, 12(4): 362-385, 2006.
- The Maximum Resource Bin Packing Problem
- J. Boyar, L. Epstein, L.M. Favrholdt, J.S. Kohrt, K.S. Larsen,
M.M. Pedersen, S. Wøhlk
Theoretical Computer Science, 362(1-3):127-139, 2006.
(Preliminary version in FCT'05, pp. 397-408.)
- Optimal Non-Preemptive Semi-Online Scheduling on Two Related
Machines
- Leah Epstein, Lene M. Favrholdt
- Journal of Algorithms, 57(1): 49-73, 2005.
- (Preliminary version in MFCS 2002, pp. 245-256.)
- On Paging with Locality of Reference
- Susanne Albers, Lene M. Favrholdt, Oliver Giel
- Journal of Computer and System Sciences, 70: 145-175, 2005.
- (Preliminary version in STOC 2002, pp. 258-267.)
- Extending the Accommodating Function
- Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen
- Acta Informatica, 40: 3-35, 2003.
- (Preliminary version in COCOON 2002.)
- On-Line Maximizing the Number of Items Packed in Variable-Sized Bins
- Leah Epstein, Lene M. Favrholdt
- Acta Cybernetica 16: 57-66, 2003.
- (Also in COCOON 2002.)
- Tight Bounds on the Competitive Ratio on Accommodating Sequences
for the Seat Reservation Problem
- Eric Bach, Joan Boyar, Leah Epstein, Lene M. Favrholdt, Tao Jiang,
Kim S. Larsen, Guo-Hui Lin, Rob van Stee
Journal of Scheduling 6(2): 131-147, 2003.
- On-Line Edge Coloring with a Fixed Number of Colors
- Lene M. Favrholdt, Morten N. Nielsen
- Algorithmica, 35(2): 176-191, 2003.
- (Preliminary version in FST TCS 2000.)
- Fair versus Unrestricted Bin Packing
- Yossi Azar, Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen
- Algorithmica, 34(2): 181-196, 2002.
- Optimal Preemptive Semi-Online Scheduling to Minimize Makespan on
Two Related Machines
- Leah Epstein, Lene M. Favrholdt
- Operations Research Letters, 30(4): 269-275, 2002.
- The Competitive Ratio for On-Line Dual Bin Packing with Restricted Input Sequences
- Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen
- Nordic Journal of Computing, 8(4): 463-472, 2001.
- Fair versus Unrestricted Bin Packing
- Yossi Azar, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen
- Seventh Scandinavian Workshop on Algorithm Theory,
LNCS 1851: 200-213, 2000.
PhD Thesis
Title: "On-Line Problems with Restricted Input"
Supervisor: Joan Boyar
Master's Thesis
Title: "Edge Coloring of Graphs" (in
Danish).
Supervisor: Bjarne Toft
|
|
