Lene M. Favrholdt

According to our database, Lene M. Favrholdt authored at least 42 papers between 2000 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Online Unit Profit Knapsack with Predictions.

Joan Boyar, Lene M. Favrholdt, Kim S. Larsen

Algorithmica, September, 2024

Complexity Classes for Online Problems with and without Predictions.

Magnus Berg, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen

CoRR, 2024

2023

Online Interval Scheduling with Predictions.

Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Online Minimum Spanning Trees with Weight Predictions.

Magnus Berg, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Paging with Succinct Predictions.

Antonios Antoniadis, Joan Boyar, Marek Eliás, Lene Monrad Favrholdt, Ruben Hoeksma, Kim S. Larsen, Adam Polak, Bertrand Simon

Proceedings of the International Conference on Machine Learning, 2023

2022

Relative Worst-order Analysis: A Survey.

Joan Boyar, Lene M. Favrholdt, Kim S. Larsen

ACM Comput. Surv., 2022

Relaxing the Irrevocability Requirement for Online Graph Algorithms.

Joan Boyar, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen

Algorithmica, 2022

Online Unit Profit Knapsack with Untrusted Predictions.

Joan Boyar, Lene M. Favrholdt, Kim S. Larsen

Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

2021

Online Bin Covering with Advice.

Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen

Algorithmica, 2021

2019

Online Dominating Set.

Joan Boyar, Stephan J. Eidenbenz, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen

Algorithmica, 2019

2018

Online-bounded analysis.

Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin

J. Sched., 2018

Weighted Online Problems with Advice.

Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen

Theory Comput. Syst., 2018

Batch Coloring of Graphs.

Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin

Algorithmica, 2018

Online edge coloring of paths and trees with a fixed number of colors.

Lene M. Favrholdt, Jesper W. Mikkelsen

Acta Informatica, 2018

2017

The Advice Complexity of a Class of Hard Online Problems.

Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen

Theory Comput. Syst., 2017

2016

Online Algorithms with Advice: A Survey.

Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Kim S. Larsen, Jesper W. Mikkelsen

SIGACT News, 2016

2015

Online multi-coloring with advice.

Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen

Theor. Comput. Sci., 2015

Advice Complexity for a Class of Online Problems.

Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

2014

Online bin covering: Expectations vs. guarantees.

Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen

Theor. Comput. Sci., 2014

Online Max-Edge-Coloring of Paths and Trees.

Lene M. Favrholdt, Jesper W. Mikkelsen

CoRR, 2014

Online Dual Edge Coloring of Paths and Trees.

Lene M. Favrholdt, Jesper W. Mikkelsen

Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014

2013

Online multi-coloring on the path revisited.

Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen

Acta Informatica, 2013

2012

Comparing online algorithms for bin packing problems.

Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt

J. Sched., 2012

A new variable-sized bin packing problem.

Joan Boyar, Lene M. Favrholdt

J. Sched., 2012

2011

Online variable-sized bin packing with conflicts.

Leah Epstein, Lene M. Favrholdt, Asaf Levin

Discret. Optim., 2011

2010

Comparing First-Fit and Next-Fit for online edge coloring.

Martin R. Ehmsen, Lene M. Favrholdt, Jens S. Kohrt, Rodica Mihai

Theor. Comput. Sci., 2010

Scheduling Jobs on Grid Processors.

Joan Boyar, Lene M. Favrholdt

Algorithmica, 2010

2007

The relative worst order ratio for online algorithms.

Joan Boyar, Lene M. Favrholdt

ACM Trans. Algorithms, 2007

The relative worst-order ratio applied to paging.

Joan Boyar, Lene M. Favrholdt, Kim S. Larsen

J. Comput. Syst. Sci., 2007

2006

The maximum resource bin packing problem.

Joan Boyar, Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt, Kim S. Larsen, Morten Monrad Pedersen, Sanne Wøhlk

Theor. Comput. Sci., 2006

Separating online scheduling algorithms with the relative worst order ratio.

Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt

J. Comb. Optim., 2006

2005

On paging with locality of reference.

Susanne Albers, Lene M. Favrholdt, Oliver Giel

J. Comput. Syst. Sci., 2005

Optimal non-preemptive semi-online scheduling on two related machines.

Leah Epstein, Lene M. Favrholdt

J. Algorithms, 2005

2003

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

J. Sched., 2003

On-Line Edge-Coloring with a Fixed Number of Colors.

Lene M. Favrholdt, Morten N. Nielsen

Algorithmica, 2003

On-Line Maximizing the Number of Items Packed in Variable-Sized Bins.

Leah Epstein, Lene M. Favrholdt

Acta Cybern., 2003

Extending the accommodating function.

Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen

Acta Informatica, 2003

The Relative Worst Order Ratio for On-Line Algorithms.

Joan Boyar, Lene M. Favrholdt

Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

2002

Optimal preemptive semi-online scheduling to minimize makespan on two related machines.

Leah Epstein, Lene M. Favrholdt

Oper. Res. Lett., 2002

Fair versus Unrestricted Bin Packing.

Yossi Azar, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen, Leah Epstein

Algorithmica, 2002

2001

The Competitive Ratio for On-Line Dual Bin Packing with Restricted Input Sequences.

Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen

Nord. J. Comput., 2001

2000

Fair versus Unrestricted Bin Packing.

Yossi Azar, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen

Proceedings of the Algorithm Theory, 2000