Follow
Pavel Veselı
Pavel Veselı
Computer Science Institute of Charles University, Prague, Czech Republic
Verified email at iuuk.mff.cuni.cz - Homepage
Title
Cited by
Cited by
Year
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
36*2020
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
252021
Online colored bin packing
M Böhm, J Sgall, P Veselı
International Workshop on Approximation and Online Algorithms, 35-46, 2014
242014
Relative Error Streaming Quantiles
G Cormode, Z Karnin, E Liberty, J Thaler, P Veselı
Journal of the ACM 70 (5), 1-48, 2023
202023
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
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, 810-828, 2017
17*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
162020
A -Competitive Algorithm for Scheduling Packets with Deadlines
P Veselı, M Chrobak, £ Je¿, J Sgall
SIAM Journal on Computing 51 (5), 1626-1691, 2022
132022
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
122019
Colored bin packing: Online algorithms and lower bounds
M Böhm, G Dósa, L Epstein, J Sgall, P Veselı
Algorithmica 80, 155-184, 2018
122018
Online bin stretching with three bins
M Böhm, J Sgall, R van Stee, P Veselı
Journal of Scheduling 20, 601-621, 2017
92017
Streaming facility location in high dimension via geometric hashing
A Czumaj, SHC Jiang, R Krauthgamer, P Veselı, M Yang
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
7*2022
Theory meets practice at the median: A worst case comparison of relative error quantile algorithms
G Cormode, A Mishra, J Ross, P Veselı
Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data …, 2021
62021
Streaming algorithms for bin packing and vector scheduling
G Cormode, P Veselı
Theory of Computing Systems 65, 916-942, 2021
62021
Improved analysis of online balanced clustering
M Bienkowski, M Böhm, M Kouteckı, T Rothvoß, J Sgall, P Veselı
International Workshop on Approximation and Online Algorithms, 224-233, 2021
52021
Streaming algorithms for geometric Steiner forest
A Czumaj, SHC Jiang, R Krauthgamer, P Veselı
arXiv preprint arXiv:2011.04324, 2020
52020
Online chromatic number is PSPACE-complete
M Böhm, P Veselı
Theory of Computing Systems 62, 1366-1391, 2018
52018
Improved approximation guarantees for shortest superstrings using cycle classification by overlap to length ratios
M Englert, N Matsakis, P Veselı
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
42022
On packet scheduling with adversarial jamming and speedup
M Böhm, £ Je¿, J Sgall, P Veselı
Annals of Operations Research 298, 7-42, 2021
42021
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
42018
The system can't perform the operation now. Try again later.
Articles 1–20