Lene M. Favrholdt

Marek Eliás

Lene Monrad Favrholdt

Proceedings of the International Conference on Machine Learning, 2023

2022

Relative Worst-order Analysis: A Survey.

[BibT_eX]

[DOI]

ACM Comput. Surv., 2022

Relaxing the Irrevocability Requirement for Online Graph Algorithms.

[BibT_eX]

[DOI]

Algorithmica, 2022

Online Unit Profit Knapsack with Untrusted Predictions.

[BibT_eX]

[DOI]

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

2021

Online Bin Covering with Advice.

[BibT_eX]

[DOI]

Algorithmica, 2021

2019

Online Dominating Set.

[BibT_eX]

[DOI]

Algorithmica, 2019

2018

Online-bounded analysis.

[BibT_eX]

[DOI]

J. Sched., 2018

Weighted Online Problems with Advice.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2018

Batch Coloring of Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2018

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

[BibT_eX]

[DOI]

Jesper W. Mikkelsen

Acta Informatica, 2018

2017

The Advice Complexity of a Class of Hard Online Problems.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2017

Online Algorithms with Advice: A Survey.

[BibT_eX]

[DOI]

ACM Comput. Surv., 2017

2015

Online multi-coloring with advice.

[BibT_eX]

[DOI]

Marie G. Christ

Theor. Comput. Sci., 2015

Advice Complexity for a Class of Online Problems.

[BibT_eX]

[DOI]

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

2014

Online bin covering: Expectations vs. guarantees.

[BibT_eX]

[DOI]

Marie G. Christ

Theor. Comput. Sci., 2014

Online Max-Edge-Coloring of Paths and Trees.

[BibT_eX]

[DOI]

Jesper W. Mikkelsen

CoRR, 2014

Online Dual Edge Coloring of Paths and Trees.

[BibT_eX]

[DOI]

Jesper W. Mikkelsen

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

2013

Online multi-coloring on the path revisited.

[BibT_eX]

[DOI]

Marie G. Christ

Acta Informatica, 2013

2012

Comparing online algorithms for bin packing problems.

[BibT_eX]

[DOI]

Jens S. Kohrt

J. Sched., 2012

A new variable-sized bin packing problem.

[BibT_eX]

[DOI]

J. Sched., 2012

2011

Online variable-sized bin packing with conflicts.

[BibT_eX]

[DOI]

Asaf Levin

Discret. Optim., 2011

2010

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Scheduling Jobs on Grid Processors.

[BibT_eX]

[DOI]

Algorithmica, 2010

2007

The relative worst order ratio for online algorithms.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2007

The relative worst-order ratio applied to paging.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2007

2006

The maximum resource bin packing problem.

[BibT_eX]

[DOI]

Morten Monrad Pedersen

Sanne Wøhlk

Theor. Comput. Sci., 2006

Separating online scheduling algorithms with the relative worst order ratio.

[BibT_eX]

[DOI]

Jens S. Kohrt

J. Comb. Optim., 2006

2005

On paging with locality of reference.

[BibT_eX]

[DOI]

Susanne Albers

Oliver Giel

J. Comput. Syst. Sci., 2005

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

[BibT_eX]

[DOI]

J. Algorithms, 2005

2003

Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem.

[BibT_eX]

[DOI]

J. Sched., 2003

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

[BibT_eX]

[DOI]

Morten N. Nielsen

Algorithmica, 2003

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

[BibT_eX]

[DOI]

Acta Cybern., 2003

Extending the accommodating function.

[BibT_eX]

[DOI]

Acta Informatica, 2003

The Relative Worst Order Ratio for On-Line Algorithms.

[BibT_eX]

[DOI]

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

2002

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

[BibT_eX]

[DOI]