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
- Online Colored Bin Packing2015 | Faculty of Mathematics and Physics
- Better Algorithms for Online Bin Stretching2015 | Faculty of Mathematics and Physics
- Better approximation bounds for the joint replenishment problem2014 | Faculty of Mathematics and Physics
- Online bin packing: Old algorithms and new results2014 | Faculty of Mathematics and Physics
- Lower bounds for online makespan minimization on a small number of related machines2013 | Faculty of Mathematics and Physics
- Better bounds for incremental frequency allocation in bipartite graphs2013 | Faculty of Mathematics and Physics
- First Fit bin packing: A tight analysis2013 | Faculty of Mathematics and Physics
- Online Control Message Aggregation in Chain Networks2013 | Faculty of Mathematics and Physics
Loading network view...