Lene M. Favrholdt

77 papers A* 2A 1B 10C 3Misc 3Journal 51Unranked 7
YearRankTypeTitle / Venue / Authors
2026 J jnl
Forwarding Packets Greedily.
CoRR
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Kevin Schewior, Rob van Stee
2026 J jnl
Online interval scheduling with predictions.
J. Comput. Syst. Sci.
Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen
2025 — conf
Complexity Classes for Online Problems with and Without Predictions.
IJTCS-FAW
Magnus Berg, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
2024 J jnl
Complexity Classes for Online Problems with and without Predictions.
CoRR
Magnus Berg, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
2024 J jnl
Online Unit Profit Knapsack with Predictions.
Algorithmica
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
2023 B conf
Online Interval Scheduling with Predictions.
WADS
Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen
2023 J jnl
Online Interval Scheduling with Predictions.
CoRR
Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen
2023 B conf
Online Minimum Spanning Trees with Weight Predictions.
WADS
Magnus Berg, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
2023 J jnl
Online Minimum Spanning Trees with Weight Predictions.
CoRR
Magnus Berg, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
2022 — conf
Online Unit Profit Knapsack with Untrusted Predictions.
SWAT
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
2022 J jnl
Online Unit Profit Knapsack with Untrusted Predictions.
CoRR
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
2022 J jnl
Paging with Succinct Predictions.
CoRR
Antonios Antoniadis, Joan Boyar, Marek Eliás, Lene M. Favrholdt, Ruben Hoeksma, Kim S. Larsen, Adam Polak, Bertrand Simon
2022 J jnl
Relative Worst-order Analysis: A Survey.
ACM Comput. Surv.
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
2022 J jnl
Relaxing the Irrevocability Requirement for Online Graph Algorithms.
Algorithmica
Joan Boyar, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen
2021 J jnl
Online Bin Covering with Advice.
Algorithmica
Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen
2019 B conf
Online Bin Covering with Advice.
WADS
Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen
2019 J jnl
Online Bin Covering with Advice.
CoRR
Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen
2019 J jnl
Online Dominating Set.
Algorithmica
Joan Boyar, Stephan J. Eidenbenz, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen
2018 J jnl
Batch Coloring of Graphs.
Algorithmica
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
2018 J jnl
Online edge coloring of paths and trees with a fixed number of colors.
Acta Informatica
Lene M. Favrholdt, Jesper W. Mikkelsen
2018 J jnl
Online-bounded analysis.
J. Sched.
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
2018 — conf
Relative Worst-Order Analysis: A Survey.
Adventures Between Lower Bounds and Higher Altitudes
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
2018 J jnl
Relative Worst-Order Analysis: A Survey.
CoRR
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
2018 J jnl
Weighted Online Problems with Advice.
Theory Comput. Syst.
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen
2017 J jnl
Online Algorithms with Advice: A Survey.
ACM Comput. Surv.
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Kim S. Larsen, Jesper W. Mikkelsen
2017 B conf
Relaxing the Irrevocability Requirement for Online Graph Algorithms.
WADS
Joan Boyar, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen
2017 J jnl
Relaxing the Irrevocability Requirement for Online Graph Algorithms.
CoRR
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Michal Kotrbcík
2017 J jnl
The Advice Complexity of a Class of Hard Online Problems.
Theory Comput. Syst.
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen
2016 B conf
Batch Coloring of Graphs.
WAOA
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
2016 J jnl
Batch Coloring of Graphs.
CoRR
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
2016 J jnl
Online Algorithms with Advice: A Survey.
SIGACT News
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Kim S. Larsen, Jesper W. Mikkelsen
2016 Misc conf
Online Bounded Analysis.
CSR
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
2016 J jnl
Online Bounded Analysis.
CoRR
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
2016 — conf
Online Dominating Set.
SWAT
Joan Boyar, Stephan J. Eidenbenz, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen
2016 J jnl
Online Dominating Set.
CoRR
Joan Boyar, Stephan J. Eidenbenz, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen
2016 C conf
Weighted Online Problems with Advice.
IWOCA
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen
2016 J jnl
Weighted Online Problems with Advice.
CoRR
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen
2015 A conf
Advice Complexity for a Class of Online Problems.
STACS
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen
2015 J jnl
Online multi-coloring with advice.
Theor. Comput. Sci.
Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen
2014 B conf
Online Dual Edge Coloring of Paths and Trees.
WAOA
Lene M. Favrholdt, Jesper W. Mikkelsen
2014 J jnl
Online Max-Edge-Coloring of Paths and Trees.
CoRR
Lene M. Favrholdt, Jesper W. Mikkelsen
2014 B conf
Online Multi-Coloring with Advice.
WAOA
Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen
2014 J jnl
Online Multi-Coloring with Advice.
CoRR
Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen
2014 J jnl
Online bin covering: Expectations vs. guarantees.
Theor. Comput. Sci.
Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen
2014 J jnl
The Advice Complexity of a Class of Hard Online Problems.
CoRR
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen
2013 C conf
Online Bin Covering: Expectations vs. Guarantees.
COCOA
Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen
2013 J jnl
Online Bin Covering: Expectations vs. Guarantees.
CoRR
Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen
2013 J jnl
Online multi-coloring on the path revisited.
Acta Informatica
Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen
2012 J jnl
A new variable-sized bin packing problem.
J. Sched.
Joan Boyar, Lene M. Favrholdt
2012 J jnl
Comparing online algorithms for bin packing problems.
J. Sched.
Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt
2011 J jnl
Online variable-sized bin packing with conflicts.
Discret. Optim.
Leah Epstein, Lene M. Favrholdt, Asaf Levin
2010 J jnl
Comparing First-Fit and Next-Fit for online edge coloring.
Theor. Comput. Sci.
Martin R. Ehmsen, Lene M. Favrholdt, Jens S. Kohrt, Rodica Mihai
2010 J jnl
Scheduling Jobs on Grid Processors.
Algorithmica
Joan Boyar, Lene M. Favrholdt
2008 B conf
Comparing First-Fit and Next-Fit for Online Edge Coloring.
ISAAC
Martin R. Ehmsen, Lene M. Favrholdt, Jens S. Kohrt, Rodica Mihai
2007 J jnl
The relative worst order ratio for online algorithms.
ACM Trans. Algorithms
Joan Boyar, Lene M. Favrholdt
2007 J jnl
The relative worst-order ratio applied to paging.
J. Comput. Syst. Sci.
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
2006 — conf
Scheduling Jobs on Grid Processors.
SWAT
Joan Boyar, Lene M. Favrholdt
2006 J jnl
Separating online scheduling algorithms with the relative worst order ratio.
J. Comb. Optim.
Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt
2006 J jnl
The maximum resource bin packing problem.
Theor. Comput. Sci.
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt, Kim S. Larsen, Morten Monrad Pedersen, Sanne Wøhlk
2005 J jnl
On paging with locality of reference.
J. Comput. Syst. Sci.
Susanne Albers, Lene M. Favrholdt, Oliver Giel
2005 J jnl
Optimal non-preemptive semi-online scheduling on two related machines.
J. Algorithms
Leah Epstein, Lene M. Favrholdt
2005 B conf
The Maximum Resource Bin Packing Problem.
FCT
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt, Kim S. Larsen, Morten Monrad Pedersen, Sanne Wøhlk
2005 A* conf
The relative worst order ratio applied to paging.
SODA
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
2003 J jnl
Extending the accommodating function.
Acta Informatica
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen
2003 J jnl
On-Line Edge-Coloring with a Fixed Number of Colors.
Algorithmica
Lene M. Favrholdt, Morten N. Nielsen
2003 J jnl
On-Line Maximizing the Number of Items Packed in Variable-Sized Bins.
Acta Cybern.
Leah Epstein, Lene M. Favrholdt
2003 C conf
The Relative Worst Order Ratio for On-Line Algorithms.
CIAC
Joan Boyar, Lene M. Favrholdt
2003 J jnl
Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem.
J. Sched.
Eric Bach, Joan Boyar, Leah Epstein, Lene M. Favrholdt, Tao Jiang, Kim S. Larsen, Guo-Hui Lin, Rob van Stee
2002 Misc conf
Extending the Accommodating Function.
COCOON
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen
2002 J jnl
Fair versus Unrestricted Bin Packing.
Algorithmica
Yossi Azar, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen, Leah Epstein
2002 A* conf
On paging with locality of reference.
STOC
Susanne Albers, Lene M. Favrholdt, Oliver Giel
2002 Misc conf
On-Line Maximizing the Number of Items Packed in Variable-Sized Bins.
COCOON
Leah Epstein, Lene M. Favrholdt
2002 B conf
Optimal Non-preemptive Semi-online Scheduling on Two Related Machines.
MFCS
Leah Epstein, Lene M. Favrholdt
2002 J jnl
Optimal preemptive semi-online scheduling to minimize makespan on two related machines.
Oper. Res. Lett.
Leah Epstein, Lene M. Favrholdt
2001 J jnl
The Competitive Ratio for On-Line Dual Bin Packing with Restricted Input Sequences.
Nord. J. Comput.
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen
2000 — conf
Fair versus Unrestricted Bin Packing.
SWAT
Yossi Azar, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen
2000 — conf
On-Line Edge-Coloring with a Fixed Number of Colors.
FSTTCS
Lene M. Favrholdt, Morten N. Nielsen