The following pages link to Jiří Sgall (Q170016):
Displaying 26 items.
- Optimal online scheduling of parallel jobs with dependencies (Q5248535) (← links)
- STACS 2004 (Q5309699) (← links)
- STACS 2004 (Q5309700) (← links)
- STACS 2004 (Q5309739) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313049) (← links)
- The optimal absolute ratio for online bin packing (Q5363009) (← links)
- Better Approximation Bounds for the Joint Replenishment Problem (Q5383963) (← links)
- Semi-Online Preemptive Scheduling: One Algorithm for All Variants. (Q5389990) (← links)
- Online Scheduling of Equal‐Length Jobs: Randomization and Restarts Help (Q5432368) (← links)
- Preemptive Online Scheduling: Optimal Algorithms for All Speeds (Q5449539) (← links)
- Coloring graphs from lists with bounded size of their union (Q5462386) (← links)
- Algorithms – ESA 2004 (Q5464579) (← links)
- Automata, Languages and Programming (Q5466476) (← links)
- Algorithms – ESA 2005 (Q5475868) (← links)
- (Q5750855) (← links)
- On packet scheduling with adversarial jamming and speedup (Q5896878) (← links)
- Algorithms - ESA 2003 (Q5897268) (← links)
- Approximation and Online Algorithms (Q5898467) (← links)
- On packet scheduling with adversarial jamming and speedup (Q5915656) (← links)
- Semi-online scheduling with decreasing job sizes (Q5929138) (← links)
- Ancient and new algorithms for load balancing in the \(\ell_p\) norm (Q5930157) (← links)
- Randomized on-line scheduling on two uniform machines (Q5937432) (← links)
- Solution of David Gale's lion and man problem (Q5941299) (← links)
- On the computational power of DNA (Q5961619) (← links)
- Multiprocessor jobs, preemptive schedules, and one-competitive online algorithms (Q6556180) (← links)
- Approximation algorithms and lower bounds for graph burning (Q6663018) (← links)
