Pavel Veselı
Pavel Veselı
Department of Computer Science, University of Warwick, UK
Verified email at warwick.ac.uk - Homepage
Title
Cited by
Cited by
Year
Online colored bin packing
M Böhm, J Sgall, P Veselı
International Workshop on Approximation and Online Algorithms, 35-46, 2014
182014
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
17*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
152015
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
112017
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
7*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
62019
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
62018
Online bin stretching with three bins
M Böhm, J Sgall, R van Stee, P Veselı
Journal of Scheduling 20 (6), 601-621, 2017
52017
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
4*2019
Online chromatic number is PSPACE-complete
M Böhm, P Veselı
Theory of Computing Systems 62 (6), 1366-1391, 2018
42018
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
32018
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
22020
On packet scheduling with adversarial jamming and speedup
M Böhm, Ł Jeż, J Sgall, P Veselı
Annals of Operations Research, 1-36, 2019
22019
Competitiveness of fit algorithms for black and white bin packing
P Veselı
Middle-European Conference on Applied Theoretical Computer Science, 2013
22013
Waltz: a strong tzaar-playing program
T Valla, P Veselı
Workshop on Computer Games, 81-96, 2013
12013
Artificial intelligence in abstract 2-player games
P Veselı
Univerzita Karlova, Matematicko-fyzikální fakulta, 2012
12012
Relative Error Streaming Quantiles
G Cormode, Z Karnin, E Liberty, J Thaler, P Veselı
arXiv preprint arXiv:2004.01668, 2020
2020
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
2020
Streaming Algorithms for Bin Packing and Vector Scheduling
G Cormode, P Veselı
International Workshop on Approximation and Online Algorithms, 72-88, 2019
2019
Online Algorithms for Packet Scheduling
P Veselı
Univerzita Karlova, Matematicko-fyzikální fakulta, 2018
2018
The system can't perform the operation now. Try again later.
Articles 1–20