Classes
- Approximation and Online Algorithms +1NDMI018 | Faculty of Mathematics and Physics
- Randomized Algorithms +1NDMI025 | Faculty of Mathematics and Physics
- Introduction to Approximation and Randomized AlgorithmsNDMI084 | 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
- Lower bounds for online makespan minimization on a small number of related machines2013 | 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
- Optimal and online preemtive scheduling on uniformly related machines2004 | Faculty of Mathematics and Physics
- Approximation schemes for scheduling on uniformly related and identical parallel machines2004 | Faculty of Mathematics and Physics
- Multiprocessor jobs, preemptive schedules, and one-competitive online algorithms2023 | Faculty of Mathematics and Physics
- Approximation Algorithms and Lower Bounds for Graph Burning2023 | Faculty of Mathematics and Physics
- Graph burning and non-uniform $k$-centers for small treewidth2022 | Faculty of Mathematics and Physics
- A phi-COMPETITIVE ALGORITHM FOR SCHEDULING PACKETS WITH DEADLINES2022 | Faculty of Mathematics and Physics
Loading network view...
