Lene Monrad Favrholdt

Available identifiers

zbMath Open favrholdt.lene-monradMaRDI QIDQ1566381

List of research outcomes

Publication	Date of Publication	Type
Online minimum spanning trees with weight predictions	2024-01-16	Paper
Online interval scheduling with predictions	2024-01-16	Paper
Relative Worst-Order Analysis: A Survey	2023-06-30	Paper
Relaxing the irrevocability requirement for online graph algorithms	2022-06-28	Paper
Online bin covering with advice	2021-04-08	Paper
Online bin covering with advice	2020-01-16	Paper
Online dominating set	2019-05-07	Paper
Batch coloring of graphs	2019-01-11	Paper
Online-bounded analysis	2018-11-07	Paper
Weighted online problems with advice	2018-08-03	Paper
Online edge coloring of paths and trees with a fixed number of colors	2018-02-28	Paper
The advice complexity of a class of hard online problems	2018-02-01	Paper
Online Dominating Set	2017-10-17	Paper
Relaxing the irrevocability requirement for online graph algorithms	2017-09-22	Paper
Batch Coloring of Graphs	2017-04-04	Paper
https://portal.mardi4nfdi.de/entity/Q2954988	2017-01-24	Paper
Weighted Online Problems with Advice	2016-09-29	Paper
Online Bounded Analysis	2016-07-25	Paper
Online bin covering: expectations vs. guarantees	2016-06-27	Paper
Online Multi-Coloring with Advice	2015-11-20	Paper
Online Dual Edge Coloring of Paths and Trees	2015-11-20	Paper
The relative worst order ratio for online algorithms	2015-09-02	Paper
Online multi-coloring with advice	2015-07-24	Paper
https://portal.mardi4nfdi.de/entity/Q2921733	2014-10-13	Paper
Comparing online algorithms for bin packing problems	2014-02-05	Paper
A new variable-sized bin packing problem	2014-02-05	Paper
Online Bin Covering: Expectations vs. Guarantees	2013-12-10	Paper
Online multi-coloring on the path revisited	2013-11-11	Paper
Online variable-sized bin packing with conflicts	2012-06-20	Paper
https://portal.mardi4nfdi.de/entity/Q3118960	2012-03-06	Paper
On paging with locality of reference	2010-08-05	Paper
Scheduling jobs on grid processors	2010-05-28	Paper
Comparing first-fit and next-fit for online edge coloring	2010-04-15	Paper
Comparing First-Fit and Next-Fit for Online Edge Coloring	2009-01-29	Paper
Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem	2007-12-20	Paper
Separating online scheduling algorithms with the relative worst order ratio	2007-10-12	Paper
Scheduling Jobs on Grid Processors	2007-09-07	Paper
The relative worst-order ratio applied to paging	2007-05-30	Paper
The maximum resource bin packing problem	2006-10-20	Paper
Fundamentals of Computation Theory	2006-10-20	Paper
Optimal non-preemptive semi-online scheduling on two related machines	2005-11-16	Paper
On paging with locality of reference	2005-05-12	Paper
Extending the accommodating function	2004-09-22	Paper
https://portal.mardi4nfdi.de/entity/Q4808625	2004-08-12	Paper
https://portal.mardi4nfdi.de/entity/Q4808668	2004-08-12	Paper
https://portal.mardi4nfdi.de/entity/Q4472437	2004-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q4439453	2003-12-14	Paper
https://portal.mardi4nfdi.de/entity/Q4437497	2003-12-02	Paper
https://portal.mardi4nfdi.de/entity/Q4708574	2003-06-18	Paper
On-line edge-coloring with a fixed number of colors	2003-06-02	Paper
Optimal preemptive semi-online scheduling to minimize makespan on two related machines	2003-04-03	Paper
https://portal.mardi4nfdi.de/entity/Q4547549	2002-10-21	Paper
Fair versus unrestricted bin packing	2002-09-25	Paper
https://portal.mardi4nfdi.de/entity/Q2721979	2001-07-11	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Lene Monrad Favrholdt