| Online colored bin packing M Böhm, J Sgall, P Veselı International Workshop on Approximation and Online Algorithms, 35-46, 2014 | 21 | 2014 |
| Better algorithms for online bin stretching M Böhm, J Sgall, R van Stee, P Veselı International Workshop on Approximation and Online Algorithms, 23-34, 2014 | 18* | 2014 |
| Online algorithms for multi-level aggregation M Bienkowski, M Böhm, J Byrka, M Chrobak, C Dürr, L Folwarcznı, Ł Jeż, ... arXiv preprint arXiv:1507.02378, 2015 | 17 | 2015 |
| Parameterized approximation schemes for steiner trees with small number of steiner vertices P Dvorák, AE Feldmann, D Knop, T Masarík, T Toufar, P Vesely SIAM Journal on Discrete Mathematics 35 (1), 546-574, 2021 | 13 | 2021 |
| Colored bin packing: Online algorithms and lower bounds M Böhm, G Dósa, L Epstein, J Sgall, P Veselı Algorithmica 80 (1), 155-184, 2018 | 8 | 2018 |
| A two-phase algorithm for bin stretching with stretching factor 1.5 M Böhm, J Sgall, R Van Stee, P Veselı Journal of Combinatorial Optimization 34 (3), 810-828, 2017 | 8* | 2017 |
| Online packet scheduling with bounded delay and lookahead M Böhm, M Chrobak, Ł Jeż, F Li, J Sgall, P Veselı Theoretical Computer Science 776, 95-113, 2019 | 7 | 2019 |
| A -Competitive Algorithm for Scheduling Packets with Deadlines P Veselı, M Chrobak, Ł Jeż, J Sgall arXiv preprint arXiv:1807.07177, 2018 | 6* | 2018 |
| Online bin stretching with three bins M Böhm, J Sgall, R van Stee, P Veselı Journal of Scheduling 20 (6), 601-621, 2017 | 6 | 2017 |
| A tight lower bound for comparison-based quantile summaries G Cormode, P Veselı Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2020 | 4 | 2020 |
| Logarithmic price of buffer downscaling on line metrics M Bienkowski, M Böhm, Ł Jeż, P Laskoś-Grabowski, J Marcinkowski, ... Theoretical Computer Science 707, 89-93, 2018 | 3 | 2018 |
| On packet scheduling with adversarial jamming and speedup M Böhm, Ł Jeż, J Sgall, P Veselı Annals of Operations Research, 1-36, 2019 | 2 | 2019 |
| Online chromatic number is PSPACE-complete M Böhm, P Veselı Theory of Computing Systems 62 (6), 1366-1391, 2018 | 2 | 2018 |
| Competitiveness of fit algorithms for black and white bin packing P Veselı Middle-European Conference on Applied Theoretical Computer Science, 2013 | 2 | 2013 |
| Online algorithms for multilevel aggregation M Bienkowski, M Böhm, J Byrka, M Chrobak, C Dürr, L Folwarcznı, Ł Jeż, ... Operations Research 68 (1), 214-232, 2020 | 1 | 2020 |
| Waltz: a strong tzaar-playing program T Valla, P Veselı Workshop on Computer Games, 81-96, 2013 | 1 | 2013 |
| Artificial intelligence in abstract 2-player games P Veselı Univerzita Karlova, Matematicko-fyzikální fakulta, 2012 | 1 | 2012 |
| New results on multi-level aggregation M Bienkowski, M Böhm, J Byrka, M Chrobak, C Dürr, L Folwarcznı, Ł Jeż, ... Theoretical Computer Science 861, 133-143, 2021 | | 2021 |
| Theory meets Practice: worst case behavior of quantile algorithms G Cormode, A Mishra, J Ross, P Veselı arXiv preprint arXiv:2102.09299, 2021 | | 2021 |
| Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop A Antoniadis, M Englert, N Matsakis, P Veselı arXiv preprint arXiv:2012.03906, 2020 | | 2020 |
Jiri SgallComputer Science Institute of Charles UniversityVerified email at iuuk.mff.cuni.cz
