Lene M. Favrholdt

Algorithmica, September, 2024

2023

Online Interval Scheduling with Predictions.

[BibT_eX]

[DOI]

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

Online Minimum Spanning Trees with Weight Predictions.

[BibT_eX]

[DOI]

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

Paging with Succinct Predictions.

[BibT_eX]

[DOI]

Antonios Antoniadis

Marek Eliás

Lene Monrad Favrholdt

Proceedings of the International Conference on Machine Learning, 2023

2022

Online Unit Profit Knapsack with Untrusted Predictions.

[BibT_eX]

[DOI]

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

2019

Online Bin Covering with Advice.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

2018

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

[BibT_eX]

[DOI]

Jesper W. Mikkelsen

Acta Informatica, 2018

Relative Worst-Order Analysis: A Survey.

[BibT_eX]

[DOI]

Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018

2017

The Advice Complexity of a Class of Hard Online Problems.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2017

Relaxing the Irrevocability Requirement for Online Graph Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

2016

Online Algorithms with Advice: A Survey.

[BibT_eX]

[DOI]

SIGACT News, 2016

Batch Coloring of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 14th International Workshop, 2016

Online Dominating Set.

[BibT_eX]

[DOI]

Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

Weighted Online Problems with Advice.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Online Bounded Analysis.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2016

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 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

Online Multi-Coloring with Advice.

[BibT_eX]

[DOI]

Marie G. Christ

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

Online Bin Covering: Expectations vs. Guarantees.

[BibT_eX]

[DOI]

Marie G. Christ

Proceedings of the Combinatorial Optimization and Applications, 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

2008

Comparing First-Fit and Next-Fit for Online Edge Coloring.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007

The relative worst order ratio for online algorithms.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2007

2006

Separating online scheduling algorithms with the relative worst order ratio.

[BibT_eX]

[DOI]

Jens S. Kohrt

J. Comb. Optim., 2006

Scheduling Jobs on Grid Processors.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2006

2005

The relative worst order ratio applied to paging.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

The Maximum Resource Bin Packing Problem.

[BibT_eX]

[DOI]

Morten Monrad Pedersen

Sanne Wøhlk

Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

2003

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

[BibT_eX]

[DOI]

J. Sched., 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]

Oper. Res. Lett., 2002

Fair versus Unrestricted Bin Packing.

[BibT_eX]

[DOI]

Algorithmica, 2002

On paging with locality of reference.

[BibT_eX]

[DOI]

Susanne Albers

Oliver Giel

Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Optimal Non-preemptive Semi-online Scheduling on Two Related Machines.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

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

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

Extending the Accommodating Function.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2001

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

[BibT_eX]

[DOI]

Nord. J. Comput., 2001

2000

Fair versus Unrestricted Bin Packing.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2000

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

[BibT_eX]

[DOI]