 | 2011 |
|---|
| 13 |       | Tomás Ebenlendr,
Jiri Sgall:
A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption.
WAOA 2011: 102-108 |
| 12 | | Tomás Ebenlendr,
Jiri Sgall:
Semi-Online Preemptive Scheduling: One Algorithm for All Variants.
Theory Comput. Syst. 48(3): 577-613 (2011) |
| 2009 |
|---|
| 11 | | Tomás Ebenlendr:
Semi-online Preemptive Scheduling: Study of Special Cases.
PPAM (2) 2009: 11-20 |
| 10 | | Ondrej Zajícek,
Jiri Sgall,
Tomás Ebenlendr:
Online Scheduling of Parallel Jobs on Hypercubes: Maximizing the Throughput.
PPAM (2) 2009: 52-61 |
| 9 | | Tomás Ebenlendr,
Jiri Sgall:
Semi-Online Preemptive Scheduling: One Algorithm for All Variants.
STACS 2009: 349-360 |
| 8 | | Tomás Ebenlendr,
Wojciech Jawor,
Jiri Sgall:
Preemptive Online Scheduling: Optimal Algorithms for All Speeds.
Algorithmica 53(4): 504-522 (2009) |
| 7 | | Tomás Ebenlendr,
Jiri Sgall:
Optimal and online preemptive scheduling on uniformly related machines.
J. Scheduling 12(5): 517-527 (2009) |
| 2008 |
|---|
| 6 | | Tomás Ebenlendr,
Marek Krcál,
Jiri Sgall:
Graph balancing: a special case of scheduling unrelated parallel machines.
SODA 2008: 483-490 |
| 5 | | Tomás Ebenlendr,
Jiri Sgall:
A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines.
WAOA 2008: 43-52 |
| 2007 |
|---|
| 4 | | Jihuan Ding,
Tomás Ebenlendr,
Jiri Sgall,
Guochuan Zhang:
Online Scheduling of Equal-Length Jobs on Parallel Machines.
ESA 2007: 427-438 |
| 2006 |
|---|
| 3 | | Tomás Ebenlendr,
Wojciech Jawor,
Jiri Sgall:
Preemptive Online Scheduling: Optimal Algorithms for All Speeds.
ESA 2006: 327-339 |
| 2005 |
|---|
| 2 | | Tomás Ebenlendr,
John Noga,
Jiri Sgall,
Gerhard J. Woeginger:
A Note on Semi-online Machine Covering.
WAOA 2005: 110-118 |
| 2004 |
|---|
| 1 | | Tomás Ebenlendr,
Jiri Sgall:
Optimal and Online Preemptive Scheduling on Uniformly Related Machines.
STACS 2004: 199-210 |
Data released under the ODC-BY 1.0 license — See also our legal information page