Online colored bin packing M Böhm, J Sgall, P Veselý
International Workshop on Approximation and Online Algorithms, 35-46, 2014
16 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
14 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
11 2015 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
6 2019 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
5 * 2017 Online bin stretching with three bins M Böhm, J Sgall, R van Stee, P Veselý
Journal of Scheduling 20 (6), 601-621, 2017
4 2017 Parameterized approximation schemes for Steiner trees with small number of Steiner vertices P Dvořák, AE Feldmann, D Knop, T Masařík, T Toufar, P Veselý
arXiv preprint arXiv:1710.00668, 2017
4 2017 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 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
3 2018 Online chromatic number is PSPACE-complete M Böhm, P Veselý
Theory of Computing Systems 62 (6), 1366-1391, 2018
2 2018 On packet scheduling with adversarial jamming and speedup M Böhm, Ł Jeż, J Sgall, P Veselý
International Workshop on Approximation and Online Algorithms, 190-206, 2017
2 2017 Better Algorithms for Online Bin Stretching. Approximation and Online Algorithms M Böhm, J Sgall, R van Stee, P Veselý
12th International Workshop, WAOA, 2014
2 2014 Competitiveness of fit algorithms for black and white bin packing P Veselý
Middle-European Conference on Applied Theoretical Computer Science, 2013
2 2013 Tight Lower Bound for Comparison-Based Quantile Summaries G Cormode, P Veselý
arXiv preprint arXiv:1905.03838, 2019
1 2019 A ϕ-competitive algorithm for scheduling packets with deadlines P Veselý, M Chrobak, Ł Jeż, J Sgall
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
1 2019 A P Veselý, M Chrobak, Ł Jeż, J Sgall
arXiv preprint arXiv:1807.07177, 2018
1 2018 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 Streaming Algorithms for Bin Packing and Vector Scheduling G Cormode, P Veselý
arXiv preprint arXiv:1905.04897, 2019
2019 Online Algorithms for Packet Scheduling P Veselý
Univerzita Karlova, Matematicko-fyzikální fakulta, 2018
2018 
Jiri SgallComputer Science Institute of Charles UniversityDirección de correo verificada de iuuk.mff.cuni.cz
