Pavel Veselý

Cited by

	All	Since 2018
Citations	264	224
h-index	10	9
i10-index	10	9

20142015201620172018201920202021202220234 10 6 16 24 13 18 38 57 64

Public access

View all

14 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Jiri SgallComputer Science Institute of Charles UniversityVerified email at iuuk.mff.cuni.cz
Martin BöhmAssistant professor, University of Wrocław, PolandVerified email at cs.uni.wroc.pl
Łukasz JeżAssistant Professor of Computer Science, University of WrocławVerified email at cs.uni.wroc.pl
Marek ChrobakUniversity of California at RiversideVerified email at cs.ucr.edu
Graham CormodeMeta AI, University of WarwickVerified email at warwick.ac.uk
Marcin BienkowskiUniversity of WroclawVerified email at cs.uni.wroc.pl
Rob van SteeDepartment of Mathematics, University of Siegen, GermanyVerified email at uni-siegen.de
Artur CzumajProfessor of Computer Science, University of Warwick, UKVerified email at warwick.ac.uk
Robert KrauthgamerWeizmann Institute of ScienceVerified email at weizmann.ac.il
Justin ThalerGeorgetown UniversityVerified email at georgetown.edu
Zohar KarninamazonVerified email at amazon.com
Edo Libertypinecone.ioVerified email at edoliberty.com
Dusan KnopCzech Technical University in PragueVerified email at fit.cvut.cz
Tomáš MasaříkUniversity of WarsawVerified email at mimuw.edu.pl
Matthias EnglertUniversity of WarwickVerified email at warwick.ac.uk
György DósaUniversity of Pannonia, Mathematical DepartmentVerified email at almos.uni-pannon.hu
Antonios AntoniadisAssistant Professor, DMMP group, University of TwenteVerified email at utwente.nl
Andreas Emil FeldmannCharles University in PragueVerified email at kam.mff.cuni.cz

Pavel Veselý

Computer Science Institute of Charles University, Prague, Czech Republic

Verified email at iuuk.mff.cuni.cz - Homepage

Theoretical Computer Science Streaming Algorithms Online Algorithms Approximation Algorithms


Title Sort by citations Sort by year Sort by 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	25	2021
Online colored bin packing M Böhm, J Sgall, P Veselý International Workshop on Approximation and Online Algorithms, 35-46, 2014	24	2014
Relative Error Streaming Quantiles G Cormode, Z Karnin, E Liberty, J Thaler, P Veselý Journal of the ACM 70 (5), 1-48, 2023	20	2023
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	16	2020
A -Competitive Algorithm for Scheduling Packets with Deadlines P Veselý, M Chrobak, Ł Jeż, J Sgall SIAM Journal on Computing 51 (5), 1626-1691, 2022	13	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	12	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	12	2018
Online bin stretching with three bins M Böhm, J Sgall, R van Stee, P Veselý Journal of Scheduling 20, 601-621, 2017	9	2017
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	6	2021
Streaming algorithms for bin packing and vector scheduling G Cormode, P Veselý Theory of Computing Systems 65, 916-942, 2021	6	2021
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	5	2021
Streaming algorithms for geometric Steiner forest A Czumaj, SHC Jiang, R Krauthgamer, P Veselý arXiv preprint arXiv:2011.04324, 2020	5	2020
Online chromatic number is PSPACE-complete M Böhm, P Veselý Theory of Computing Systems 62, 1366-1391, 2018	5	2018
Masked superstrings as a unified framework for textual 𝑘-mer set representations O Sladký, P Veselý, K Břinda bioRxiv, 2023.02. 01.526717, 2023	4	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	4	2022
On packet scheduling with adversarial jamming and speedup M Böhm, Ł Jeż, J Sgall, P Veselý Annals of Operations Research 298, 7-42, 2021	4	2021

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors