Classes
- Approximation and Online Algorithms +1NDMI018 | Faculty of Mathematics and Physics
- Selected Topics in AlgorithmsNTIN101 | 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 Algorithms IINTIN111 | Faculty of Mathematics and Physics
Publications
- Online bin packing: Old algorithms and new results2014 | Faculty of Mathematics and Physics
- Better bounds for incremental frequency allocation in bipartite graphs2013 | Faculty of Mathematics and Physics
- Better Bounds for Incremental Frequency Allocation in Bipartite Graphs2011 | Faculty of Mathematics and Physics
- 10th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP)2011 | Faculty of Mathematics and Physics
- A lower bound for cake cutting.2003 | Faculty of Mathematics and Physics
- 10th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP)Publication without faculty affiliation
- 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...