The following pages link to Lene Monrad Favrholdt (Q1566381):
Displaying 50 items.
- (Q300235) (redirect page) (← links)
- Online bin covering: expectations vs. guarantees (Q300236) (← links)
- Online multi-coloring on the path revisited (Q378204) (← links)
- Online variable-sized bin packing with conflicts (Q429693) (← links)
- Fair versus unrestricted bin packing (Q699764) (← links)
- Weighted online problems with advice (Q726104) (← links)
- The relative worst-order ratio applied to paging (Q881599) (← links)
- Comparing first-fit and next-fit for online edge coloring (Q964390) (← links)
- Scheduling jobs on grid processors (Q973018) (← links)
- On-line edge-coloring with a fixed number of colors (Q1566383) (← links)
- Online-bounded analysis (Q1617274) (← links)
- The advice complexity of a class of hard online problems (Q1693995) (← links)
- Online edge coloring of paths and trees with a fixed number of colors (Q1702302) (← links)
- Online dominating set (Q1741855) (← links)
- Batch coloring of graphs (Q1755745) (← links)
- Optimal preemptive semi-online scheduling to minimize makespan on two related machines (Q1866010) (← links)
- Extending the accommodating function (Q1879376) (← links)
- Online multi-coloring with advice (Q2355706) (← links)
- Separating online scheduling algorithms with the relative worst order ratio (Q2385472) (← links)
- Comparing online algorithms for bin packing problems (Q2434261) (← links)
- A new variable-sized bin packing problem (Q2434283) (← links)
- Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem (Q2464382) (← links)
- The maximum resource bin packing problem (Q2508970) (← links)
- (Q2721979) (← links)
- Weighted Online Problems with Advice (Q2819501) (← links)
- Online Bin Covering: Expectations vs. Guarantees (Q2867122) (← links)
- (Q2921733) (← links)
- The relative worst order ratio for online algorithms (Q2944559) (← links)
- (Q2954988) (← links)
- Batch Coloring of Graphs (Q2971156) (← links)
- (Q3118960) (← links)
- Online Multi-Coloring with Advice (Q3453285) (← links)
- Online Dual Edge Coloring of Paths and Trees (Q3453294) (← links)
- Comparing First-Fit and Next-Fit for Online Edge Coloring (Q3596709) (← links)
- (Q4437497) (← links)
- (Q4439453) (← links)
- (Q4472437) (← links)
- (Q4547549) (← links)
- (Q4708574) (← links)
- (Q4808625) (← links)
- (Q4808668) (← links)
- Online Dominating Set (Q5369523) (← links)
- Fundamentals of Computation Theory (Q5492945) (← links)
- Optimal non-preemptive semi-online scheduling on two related machines (Q5704856) (← links)
- Online Bounded Analysis (Q5740182) (← links)
- Scheduling Jobs on Grid Processors (Q5757886) (← links)
- On paging with locality of reference (Q5901047) (← links)
- On paging with locality of reference (Q5916194) (← links)
- Relaxing the irrevocability requirement for online graph algorithms (Q5918715) (← links)
- Online bin covering with advice (Q5919311) (← links)
