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
- Online Colored Bin Packing2015 | Faculty of Mathematics and Physics
- Better Algorithms for Online Bin Stretching2015 | Faculty of Mathematics and Physics
- Graph Balancing: A Special Case of Scheduling Unrelated Parallel Machines2014 | Faculty of Mathematics and Physics
- Better approximation bounds for the joint replenishment problem2014 | Faculty of Mathematics and Physics
- Optimal analysis of Best Fit bin packing2014 | Faculty of Mathematics and Physics
- Better bounds for incremental frequency allocation in bipartite graphs2013 | Faculty of Mathematics and Physics
- Online scheduling of jobs with fixed start times on related machines2012 | Faculty of Mathematics and Physics
- Semi-Online Preemptive Scheduling: One Algorithm for All Variants2011 | Faculty of Mathematics and Physics
- Two-bounded-space bin packing revisited2011 | Faculty of Mathematics and Physics
- Optimal and online preemtive scheduling on uniformly related machines2004 | Faculty of Mathematics and Physics
Loading network view...