Classes
- Approximation and Online Algorithms +1NDMI018 | Faculty of Mathematics and Physics
- Introduction to Approximation and Randomized AlgorithmsNDMI084 | Faculty of Mathematics and Physics
- Randomized Algorithms +1NDMI025 | Faculty of Mathematics and Physics
- Selected Topics in AlgorithmsNTIN101 | Faculty of Mathematics and Physics
- Selected Topics in Algorithms IINTIN111 | Faculty of Mathematics and Physics
Publications
- A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines Without Preemption2015 | Faculty of Mathematics and Physics
- Multiprocessor Jobs, Preemptive Schedules, and One-Competitive Online Algorithms2015 | Faculty of Mathematics and Physics
- Graph Balancing: A Special Case of Scheduling Unrelated Parallel Machines2014 | Faculty of Mathematics and Physics
- Lower bounds for online makespan minimization on a small number of related machines2013 | Faculty of Mathematics and Physics
- Open problems in throughput scheduling2012 | Faculty of Mathematics and Physics
- Online scheduling of jobs with fixed start times on related machines2012 | Faculty of Mathematics and Physics
- A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption2012 | Faculty of Mathematics and Physics
- Semi-Online Preemptive Scheduling: One Algorithm for All Variants2011 | Faculty of Mathematics and Physics
- 10th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP)2011 | Faculty of Mathematics and Physics
- Fairness-Free Periodic Scheduling with Vacations +22005 | Faculty of Mathematics and Physics
Loading network view...