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
- Online Colored Bin Packing2015 | Faculty of Mathematics and Physics
- Better bounds for incremental frequency allocation in bipartite graphs2013 | Faculty of Mathematics and Physics
- Coloring graphs from lists with bounded size of their union +12005 | Faculty of Mathematics and Physics
- The complexity of coloring graphs without long induced paths2001 | 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
- Graph Burning and Non-uniform k-Centers for Small Treewidth2022 | Faculty of Mathematics and Physics
- New results on multi-level aggregation2021 | Faculty of Mathematics and Physics
Loading network view...