Pavel Veselý

According to our database, Pavel Veselý authored at least 33 papers between 2013 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Streaming Algorithms for Geometric Steiner Forest.

Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý

ACM Trans. Algorithms, October, 2024

Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop.

Antonios Antoniadis, Matthias Englert, Nicolaos Matsakis, Pavel Veselý

ACM Trans. Algorithms, October, 2024

Fully-Scalable MPC Algorithms for Clustering in High Dimension.

Artur Czumaj, Guichen Gao, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023

Structural Properties of Search Trees with 2-way Comparisons.

Sunny Atalig, Marek Chrobak, Erfan Mousavian, Jiri Sgall, Pavel Veselý

CoRR, 2023

Approximation Guarantees for Shortest Superstrings: Simpler and Better.

Matthias Englert, Nicolaos Matsakis, Pavel Veselý

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

2022

Relative Error Streaming Quantiles.

Graham Cormode, Zohar S. Karnin, Edo Liberty, Justin Thaler, Pavel Veselý

SIGMOD Rec., 2022

A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines.

Pavel Veselý, Marek Chrobak, Lukasz Jez, Jirí Sgall

SIAM J. Comput., 2022

Streaming Facility Location in High Dimension via New Geometric Hashing.

Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý, Mingwei Yang

CoRR, 2022

Improved approximation guarantees for shortest superstrings using cycle classification by overlap to length ratios.

Matthias Englert, Nicolaos Matsakis, Pavel Veselý

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Streaming Facility Location in High Dimension via Geometric Hashing.

Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý, Mingwei Yang

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021

New results on multi-level aggregation.

Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukás Folwarczný, Lukasz Jez, Jirí Sgall, Kim Thang Nguyen, Pavel Veselý

Theor. Comput. Sci., 2021

Packet Scheduling: Plans, Monotonicity, and the Golden Ratio.

Pavel Veselý

SIGACT News, 2021

Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices.

Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomás Toufar, Pavel Veselý

SIAM J. Discret. Math., 2021

Streaming Algorithms for Bin Packing and Vector Scheduling.

Graham Cormode, Pavel Veselý

Theory Comput. Syst., 2021

Theory meets Practice: worst case behavior of quantile algorithms.

Graham Cormode, Abhinav Mishra, Joseph Ross, Pavel Veselý

CoRR, 2021

On packet scheduling with adversarial jamming and speedup.

Martin Böhm, Lukasz Jez, Jirí Sgall, Pavel Veselý

Ann. Oper. Res., 2021

Improved Analysis of Online Balanced Clustering.

Marcin Bienkowski, Martin Böhm, Martin Koutecký, Thomas Rothvoß, Jirí Sgall, Pavel Veselý

Proceedings of the Approximation and Online Algorithms - 19th International Workshop, 2021

Theory meets Practice at the Median: A Worst Case Comparison of Relative Error Quantile Algorithms.

Graham Cormode, Abhinav Mishra, Joseph Ross, Pavel Veselý

Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

2020

Online Algorithms for Multilevel Aggregation.

Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukás Folwarczný, Lukasz Jez, Jirí Sgall, Kim Thang Nguyen, Pavel Veselý

Oper. Res., 2020

A Tight Lower Bound for Comparison-Based Quantile Summaries.

Graham Cormode, Pavel Veselý

Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2020

2019

Online packet scheduling with bounded delay and lookahead.

Martin Böhm, Marek Chrobak, Lukasz Jez, Fei Li, Jirí Sgall, Pavel Veselý

Theor. Comput. Sci., 2019

A ϕ-Competitive Algorithm for Scheduling Packets with Deadlines.

Pavel Veselý, Marek Chrobak, Lukasz Jez, Jirí Sgall

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018

Logarithmic price of buffer downscaling on line metrics.

Marcin Bienkowski, Martin Böhm, Lukasz Jez, Pawel Laskos-Grabowski, Jan Marcinkowski, Jirí Sgall, Aleksandra Spyra, Pavel Veselý

Theor. Comput. Sci., 2018

Online Chromatic Number is PSPACE-Complete.

Martin Böhm, Pavel Veselý

Theory Comput. Syst., 2018

Colored Bin Packing: Online Algorithms and Lower Bounds.

Martin Böhm, György Dósa, Leah Epstein, Jirí Sgall, Pavel Veselý

Algorithmica, 2018

2017

Online bin stretching with three bins.

Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý

J. Sched., 2017

Erratum to: A two-phase algorithm for bin stretching with stretching factor 1.5.

Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý

J. Comb. Optim., 2017

A two-phase algorithm for bin stretching with stretching factor 1.5.

Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý

J. Comb. Optim., 2017

2016

The Best Two-Phase Algorithm for Bin Stretching.

Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý

CoRR, 2016

Online Algorithms for Multi-Level Aggregation.

Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukás Folwarczný, Lukasz Jez, Jiri Sgall, Kim Thang Nguyen, Pavel Veselý

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2014

Online Colored Bin Packing.

Martin Böhm, Jirí Sgall, Pavel Veselý

Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014

Better Algorithms for Online Bin Stretching.

Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý

Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014

2013

WALTZ: A Strong Tzaar-Playing Program.

Tomás Valla, Pavel Veselý

Proceedings of the Computer Games - Workshop on Computer Games, 2013