Lene M. Favrholdt

According to our database1, Lene M. Favrholdt
  • authored at least 53 papers between 2000 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
The Advice Complexity of a Class of Hard Online Problems.
Theory Comput. Syst., 2017

Online Algorithms with Advice: A Survey.
ACM Comput. Surv., 2017

Relaxing the Irrevocability Requirement for Online Graph Algorithms.
CoRR, 2017

Relaxing the Irrevocability Requirement for Online Graph Algorithms.
Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

2016
Online Algorithms with Advice: A Survey.
SIGACT News, 2016

Weighted Online Problems with Advice.
CoRR, 2016

Batch Coloring of Graphs.
CoRR, 2016

Online Bounded Analysis.
CoRR, 2016

Online Dominating Set.
CoRR, 2016

Batch Coloring of Graphs.
Proceedings of the Approximation and Online Algorithms - 14th International Workshop, 2016

Online Dominating Set.
Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

Weighted Online Problems with Advice.
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Online Bounded Analysis.
Proceedings of the Computer Science - Theory and Applications, 2016

2015
Online multi-coloring with advice.
Theor. Comput. Sci., 2015

Advice Complexity for a Class of Online Problems.
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

2014
Online bin covering: Expectations vs. guarantees.
Theor. Comput. Sci., 2014

Online Max-Edge-Coloring of Paths and Trees.
CoRR, 2014

Online Multi-Coloring with Advice.
CoRR, 2014

The Advice Complexity of a Class of Hard Online Problems.
CoRR, 2014

Online Dual Edge Coloring of Paths and Trees.
Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014

Online Multi-Coloring with Advice.
Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014

2013
Online Bin Covering: Expectations vs. Guarantees.
CoRR, 2013

Online multi-coloring on the path revisited.
Acta Inf., 2013

Online Bin Covering: Expectations vs. Guarantees.
Proceedings of the Combinatorial Optimization and Applications, 2013

2012
Comparing online algorithms for bin packing problems.
J. Scheduling, 2012

A new variable-sized bin packing problem.
J. Scheduling, 2012

2011
Online variable-sized bin packing with conflicts.
Discrete Optimization, 2011

2010
Comparing First-Fit and Next-Fit for online edge coloring.
Theor. Comput. Sci., 2010

Scheduling Jobs on Grid Processors.
Algorithmica, 2010

2008
Comparing First-Fit and Next-Fit for Online Edge Coloring.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007
The relative worst order ratio for online algorithms.
ACM Trans. Algorithms, 2007

The relative worst-order ratio applied to paging.
J. Comput. Syst. Sci., 2007

2006
The maximum resource bin packing problem.
Theor. Comput. Sci., 2006

Separating online scheduling algorithms with the relative worst order ratio.
J. Comb. Optim., 2006

Scheduling Jobs on Grid Processors.
Proceedings of the Algorithm Theory, 2006

2005
On paging with locality of reference.
J. Comput. Syst. Sci., 2005

Optimal non-preemptive semi-online scheduling on two related machines.
J. Algorithms, 2005

The relative worst order ratio applied to paging.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

The Maximum Resource Bin Packing Problem.
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.
J. Scheduling, 2003

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

On-Line Maximizing the Number of Items Packed in Variable-Sized Bins.
Acta Cybern., 2003

Extending the accommodating function.
Acta Inf., 2003

The Relative Worst Order Ratio for On-Line Algorithms.
Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

2002
Optimal preemptive semi-online scheduling to minimize makespan on two related machines.
Oper. Res. Lett., 2002

Fair versus Unrestricted Bin Packing.
Algorithmica, 2002

On paging with locality of reference.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Optimal Non-preemptive Semi-online Scheduling on Two Related Machines.
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

On-Line Maximizing the Number of Items Packed in Variable-Sized Bins.
Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

Extending the Accommodating Function.
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.
Nord. J. Comput., 2001

2000
Fair versus Unrestricted Bin Packing.
Proceedings of the Algorithm Theory, 2000

On-Line Edge-Coloring with a Fixed Number of Colors.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 2000


  Loading...