Tomás Ebenlendr

15 papers A* 1A 4B 3Journal 5Unranked 2
YearRankTypeTitle / Venue / Authors
2015 J jnl
A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines Without Preemption.
Theory Comput. Syst.
Tomás Ebenlendr, Jirí Sgall
2014 J jnl
Graph Balancing: A Special Case of Scheduling Unrelated Parallel Machines.
Algorithmica
Tomás Ebenlendr, Marek Krcál, Jirí Sgall
2011 B conf
A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption.
WAOA
Tomás Ebenlendr, Jirí Sgall
2011 J jnl
Semi-Online Preemptive Scheduling: One Algorithm for All Variants.
Theory Comput. Syst.
Tomás Ebenlendr, Jirí Sgall
2009 — conf
Online Scheduling of Parallel Jobs on Hypercubes: Maximizing the Throughput.
PPAM (2)
Ondrej Zajícek, Jirí Sgall, Tomás Ebenlendr
2009 J jnl
Optimal and online preemptive scheduling on uniformly related machines.
J. Sched.
Tomás Ebenlendr, Jirí Sgall
2009 J jnl
Preemptive Online Scheduling: Optimal Algorithms for All Speeds.
Algorithmica
Tomás Ebenlendr, Wojciech Jawor, Jirí Sgall
2009 A conf
Semi-Online Preemptive Scheduling: One Algorithm for All Variants.
STACS
Tomás Ebenlendr, Jirí Sgall
2009 — conf
Semi-online Preemptive Scheduling: Study of Special Cases.
PPAM (2)
Tomás Ebenlendr
2008 B conf
A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines.
WAOA
Tomás Ebenlendr, Jirí Sgall
2008 A* conf
Graph balancing: a special case of scheduling unrelated parallel machines.
SODA
Tomás Ebenlendr, Marek Krcál, Jirí Sgall
2007 A conf
Online Scheduling of Equal-Length Jobs on Parallel Machines.
ESA
Jihuan Ding, Tomás Ebenlendr, Jirí Sgall, Guochuan Zhang
2006 A conf
Preemptive Online Scheduling: Optimal Algorithms for All Speeds.
ESA
Tomás Ebenlendr, Wojciech Jawor, Jirí Sgall
2005 B conf
A Note on Semi-online Machine Covering.
WAOA
Tomás Ebenlendr, John Noga, Jirí Sgall, Gerhard J. Woeginger
2004 A conf
Optimal and Online Preemptive Scheduling on Uniformly Related Machines.
STACS
Tomás Ebenlendr, Jirí Sgall