| 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 | 44* | 2020 |
| Relative Error Streaming Quantiles G Cormode, Z Karnin, E Liberty, J Thaler, P Veselý Journal of the ACM 70 (5), 1-48, 2023 | 39 | 2023 |
| 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 | 24 | 2020 |
| Online colored bin packing M Böhm, J Sgall, P Veselý International Workshop on Approximation and Online Algorithms, 35-46, 2014 | 24 | 2014 |
| 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 | 20 | 2022 |
| 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 Veselý Leibniz International Proceedings in Informatics, LIPIcs 96, 26, 2018 | 19 | 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, 810-828, 2017 | 18* | 2017 |
| 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 -Competitive Algorithm for Scheduling Packets with Deadlines P Veselý, M Chrobak, Ł Jeż, J Sgall SIAM Journal on Computing 51 (5), 1626-1691, 2022 | 17 | 2022 |
| 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 | 15 | 2019 |
| 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 | 13 | 2018 |
| 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 | 12 | 2021 |
| 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 | 11 | 2021 |
| 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 | 11 | 2021 |
| Online bin stretching with three bins M Böhm, J Sgall, R van Stee, P Veselý Journal of Scheduling 20, 601-621, 2017 | 11 | 2017 |
| Masked superstrings as a unified framework for textual k-mer set representations O Sladký, P Veselý, K Břinda bioRxiv, 2023.02. 01.526717, 2023 | 10 | 2023 |
| 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 | 8 | 2022 |
| 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 | 8 | 2021 |
| Streaming algorithms for geometric Steiner forest A Czumaj, SHC Jiang, R Krauthgamer, P Veselý 49th International Colloquium on Automata, Languages, and Programming (ICALP …, 2022 | 7 | 2022 |
| Streaming algorithms for bin packing and vector scheduling G Cormode, P Veselý Theory of Computing Systems 65, 916-942, 2021 | 7 | 2021 |
Jiri SgallComputer Science Institute of Charles Universityiuuk.mff.cuni.cz의 이메일 확인됨
