| Publication | Date of Publication | Type |
|---|
Online unit profit knapsack with predictions
Algorithmica | 2024-10-07 | Paper |
| Online unit profit knapsack with untrusted predictions | 2024-05-27 | Paper |
Online minimum spanning trees with weight predictions
Lecture Notes in Computer Science | 2024-01-16 | Paper |
Online interval scheduling with predictions
Lecture Notes in Computer Science | 2024-01-16 | Paper |
Relative Worst-Order Analysis: A Survey
Adventures Between Lower Bounds and Higher Altitudes | 2023-06-30 | Paper |
Relaxing the irrevocability requirement for online graph algorithms
Algorithmica | 2022-06-28 | Paper |
Online bin covering with advice
Algorithmica | 2021-04-08 | Paper |
Online bin covering with advice
Lecture Notes in Computer Science | 2020-01-16 | Paper |
Online dominating set
Algorithmica | 2019-05-07 | Paper |
Batch coloring of graphs
Algorithmica | 2019-01-11 | Paper |
Online-bounded analysis
Journal of Scheduling | 2018-11-07 | Paper |
Weighted online problems with advice
Theory of Computing Systems | 2018-08-03 | Paper |
Online edge coloring of paths and trees with a fixed number of colors
Acta Informatica | 2018-02-28 | Paper |
The advice complexity of a class of hard online problems
Theory of Computing Systems | 2018-02-01 | Paper |
Online Dominating Set
(available as arXiv preprint) | 2017-10-17 | Paper |
Relaxing the irrevocability requirement for online graph algorithms
Lecture Notes in Computer Science | 2017-09-22 | Paper |
Batch Coloring of Graphs
Approximation and Online Algorithms | 2017-04-04 | Paper |
Batch Coloring of Graphs
Approximation and Online Algorithms | 2017-04-04 | Paper |
Advice complexity for a class of online problems
(available as arXiv preprint) | 2017-01-24 | Paper |
Weighted Online Problems with Advice
Lecture Notes in Computer Science | 2016-09-29 | Paper |
Online bounded analysis
Computer Science – Theory and Applications | 2016-07-25 | Paper |
Online bin covering: expectations vs. guarantees
Theoretical Computer Science | 2016-06-27 | Paper |
Online Dual Edge Coloring of Paths and Trees
Approximation and Online Algorithms | 2015-11-20 | Paper |
Online Multi-Coloring with Advice
Approximation and Online Algorithms | 2015-11-20 | Paper |
The relative worst order ratio for online algorithms
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Online multi-coloring with advice
Theoretical Computer Science | 2015-07-24 | Paper |
| The relative worst order ratio applied to paging | 2014-10-13 | Paper |
Comparing online algorithms for bin packing problems
Journal of Scheduling | 2014-02-05 | Paper |
A new variable-sized bin packing problem
Journal of Scheduling | 2014-02-05 | Paper |
Online Bin Covering: Expectations vs. Guarantees
Combinatorial Optimization and Applications | 2013-12-10 | Paper |
Online multi-coloring on the path revisited
Acta Informatica | 2013-11-11 | Paper |
Online variable-sized bin packing with conflicts
Discrete Optimization | 2012-06-20 | Paper |
| Graph edge coloring. Vizing's theorem and Goldberg's conjecture | 2012-03-06 | Paper |
On paging with locality of reference
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
Scheduling jobs on grid processors
Algorithmica | 2010-05-28 | Paper |
Comparing first-fit and next-fit for online edge coloring
Theoretical Computer Science | 2010-04-15 | Paper |
Comparing First-Fit and Next-Fit for Online Edge Coloring
Algorithms and Computation | 2009-01-29 | Paper |
Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem
Journal of Scheduling | 2007-12-20 | Paper |
Separating online scheduling algorithms with the relative worst order ratio
Journal of Combinatorial Optimization | 2007-10-12 | Paper |
Scheduling Jobs on Grid Processors
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
The relative worst-order ratio applied to paging
Journal of Computer and System Sciences | 2007-05-30 | Paper |
The maximum resource bin packing problem
Theoretical Computer Science | 2006-10-20 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Optimal non-preemptive semi-online scheduling on two related machines
Journal of Algorithms | 2005-11-16 | Paper |
On paging with locality of reference
Journal of Computer and System Sciences | 2005-05-12 | Paper |
Extending the accommodating function
Acta Informatica | 2004-09-22 | Paper |
| scientific article; zbMATH DE number 2089963 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2090002 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2080195 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2016849 (Why is no real title available?) | 2003-12-14 | Paper |
| scientific article; zbMATH DE number 2011845 (Why is no real title available?) | 2003-12-02 | Paper |
| scientific article; zbMATH DE number 1929942 (Why is no real title available?) | 2003-06-18 | Paper |
On-line edge-coloring with a fixed number of colors
Algorithmica | 2003-06-02 | Paper |
Optimal preemptive semi-online scheduling to minimize makespan on two related machines
Operations Research Letters | 2003-04-03 | Paper |
| scientific article; zbMATH DE number 1786227 (Why is no real title available?) | 2002-10-21 | Paper |
Fair versus unrestricted bin packing
Algorithmica | 2002-09-25 | Paper |
| scientific article; zbMATH DE number 1617259 (Why is no real title available?) | 2001-07-11 | Paper |
