Lene M. Favrholdt

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 33

Top Topics

Tractable Cases

Minimum Spanning Trees

Top Venues

Publications

Magnus Berg, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
Complexity Classes for Online Problems with and without Predictions. CoRR (2024)
Magnus Berg, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
Online Minimum Spanning Trees with Weight Predictions. WADS (2023)
Magnus Berg, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
Online Minimum Spanning Trees with Weight Predictions. CoRR (2023)
Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen
Online Interval Scheduling with Predictions. CoRR (2023)
Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen
Online Interval Scheduling with Predictions. WADS (2023)
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
Online Unit Profit Knapsack with Untrusted Predictions. CoRR (2022)
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
Online Unit Profit Knapsack with Untrusted Predictions. SWAT (2022)
Joan Boyar, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen
Relaxing the Irrevocability Requirement for Online Graph Algorithms. Algorithmica 84 (7) (2022)
Antonios Antoniadis, Joan Boyar, Marek Eliás, Lene M. Favrholdt, Ruben Hoeksma, Kim S. Larsen, Adam Polak, Bertrand Simon
Paging with Succinct Predictions. CoRR (2022)
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
Relative Worst-order Analysis: A Survey. ACM Comput. Surv. 54 (1) (2021)
Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen
Online Bin Covering with Advice. Algorithmica 83 (3) (2021)
Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen
Online Bin Covering with Advice. CoRR (2019)
Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen
Online Bin Covering with Advice. WADS (2019)
Joan Boyar, Stephan J. Eidenbenz, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen
Online Dominating Set. Algorithmica 81 (5) (2019)
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
Relative Worst-Order Analysis: A Survey. Adventures Between Lower Bounds and Higher Altitudes (2018)
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
Online-bounded analysis. J. Sched. 21 (4) (2018)
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen
Weighted Online Problems with Advice. Theory Comput. Syst. 62 (6) (2018)
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
Batch Coloring of Graphs. Algorithmica 80 (11) (2018)
Lene M. Favrholdt, Jesper W. Mikkelsen
Online edge coloring of paths and trees with a fixed number of colors. Acta Informatica 55 (1) (2018)
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
Relative Worst-Order Analysis: A Survey. CoRR (2018)
Joan Boyar, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen
Relaxing the Irrevocability Requirement for Online Graph Algorithms. WADS (2017)
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Kim S. Larsen, Jesper W. Mikkelsen
Online Algorithms with Advice: A Survey. ACM Comput. Surv. 50 (2) (2017)
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Michal Kotrbcík
Relaxing the Irrevocability Requirement for Online Graph Algorithms. CoRR (2017)
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen
The Advice Complexity of a Class of Hard Online Problems. Theory Comput. Syst. 61 (4) (2017)
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
Online Bounded Analysis. CoRR (2016)
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen
Weighted Online Problems with Advice. CoRR (2016)
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
Online Bounded Analysis. CSR (2016)
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen
Weighted Online Problems with Advice. IWOCA (2016)
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
Batch Coloring of Graphs. WAOA (2016)
Joan Boyar, Stephan J. Eidenbenz, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen
Online Dominating Set. CoRR (2016)
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
Batch Coloring of Graphs. CoRR (2016)
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Kim S. Larsen, Jesper W. Mikkelsen
Online Algorithms with Advice: A Survey. SIGACT News 47 (3) (2016)
Joan Boyar, Stephan J. Eidenbenz, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen
Online Dominating Set. SWAT (2016)
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen
Advice Complexity for a Class of Online Problems. STACS (2015)
Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen
Online multi-coloring with advice. Theor. Comput. Sci. 596 (2015)
Lene M. Favrholdt, Jesper W. Mikkelsen
Online Max-Edge-Coloring of Paths and Trees. CoRR (2014)
Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen
Online Multi-Coloring with Advice. CoRR (2014)
Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen
Online bin covering: Expectations vs. guarantees. Theor. Comput. Sci. 556 (2014)
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen
The Advice Complexity of a Class of Hard Online Problems. CoRR (2014)
Lene M. Favrholdt, Jesper W. Mikkelsen
Online Dual Edge Coloring of Paths and Trees. WAOA (2014)
Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen
Online Multi-Coloring with Advice. WAOA (2014)
Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen
Online Bin Covering: Expectations vs. Guarantees. CoRR (2013)
Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen
Online Bin Covering: Expectations vs. Guarantees. COCOA (2013)
Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen
Online multi-coloring on the path revisited. Acta Informatica 50 (5-6) (2013)
Joan Boyar, Lene M. Favrholdt
A new variable-sized bin packing problem. J. Sched. 15 (3) (2012)
Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt
Comparing online algorithms for bin packing problems. J. Sched. 15 (1) (2012)
Leah Epstein, Lene M. Favrholdt, Asaf Levin
Online variable-sized bin packing with conflicts. Discret. Optim. 8 (2) (2011)
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) (2010)
Joan Boyar, Lene M. Favrholdt
Scheduling Jobs on Grid Processors. Algorithmica 57 (4) (2010)
Martin R. Ehmsen, Lene M. Favrholdt, Jens S. Kohrt, Rodica Mihai
Comparing First-Fit and Next-Fit for Online Edge Coloring. ISAAC (2008)
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
The relative worst-order ratio applied to paging. J. Comput. Syst. Sci. 73 (5) (2007)
Joan Boyar, Lene M. Favrholdt
The relative worst order ratio for online algorithms. ACM Trans. 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) (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) (2006)
Joan Boyar, Lene M. Favrholdt
Scheduling Jobs on Grid Processors. SWAT (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. FCT (2005)
Leah Epstein, Lene M. Favrholdt
Optimal non-preemptive semi-online scheduling on two related machines. J. Algorithms 57 (1) (2005)
Susanne Albers, Lene M. Favrholdt, Oliver Giel
On paging with locality of reference. J. Comput. Syst. Sci. 70 (2) (2005)
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
The relative worst order ratio applied to paging. SODA (2005)
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen
Extending the accommodating function. Acta Informatica 40 (1) (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. Sched. 6 (2) (2003)
Leah Epstein, Lene M. Favrholdt
On-Line Maximizing the Number of Items Packed in Variable-Sized Bins. Acta Cybern. 16 (1) (2003)
Joan Boyar, Lene M. Favrholdt
The Relative Worst Order Ratio for On-Line Algorithms. CIAC (2003)
Lene M. Favrholdt, Morten N. Nielsen
On-Line Edge-Coloring with a Fixed Number of Colors. Algorithmica 35 (2) (2003)
Leah Epstein, Lene M. Favrholdt
Optimal preemptive semi-online scheduling to minimize makespan on two related machines. Oper. Res. Lett. 30 (4) (2002)
Leah Epstein, Lene M. Favrholdt
Optimal Non-preemptive Semi-online Scheduling on Two Related Machines. MFCS (2002)
Susanne Albers, Lene M. Favrholdt, Oliver Giel
On paging with locality of reference. STOC (2002)
Leah Epstein, Lene M. Favrholdt
On-Line Maximizing the Number of Items Packed in Variable-Sized Bins. COCOON (2002)
Yossi Azar, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen, Leah Epstein
Fair versus Unrestricted Bin Packing. Algorithmica 34 (2) (2002)
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen
Extending the Accommodating Function. COCOON (2002)
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) (2001)
Lene M. Favrholdt, Morten N. Nielsen
On-Line Edge-Coloring with a Fixed Number of Colors. FSTTCS (2000)
Yossi Azar, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen
Fair versus Unrestricted Bin Packing. SWAT (2000)