Pavel Veselý

Publication Activity (10 Years)

Years Active: 1989-2022
Publications (10 Years): 45

Top Topics

Online Algorithms

Geometric Hashing

Top Venues

Theor. Comput. Sci.

J. Comb. Optim.

Publications

Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý, Mingwei Yang
Streaming Facility Location in High Dimension via New Geometric Hashing. CoRR (2022)
Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý
Streaming Algorithms for Geometric Steiner Forest. ICALP (2022)
Matthias Englert, Nicolaos Matsakis, Pavel Veselý
Improved approximation guarantees for shortest superstrings using cycle classification by overlap to length ratios. STOC (2022)
Pavel Veselý, Marek Chrobak, Lukasz Jez, Jirí Sgall
A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines. SIAM J. Comput. 51 (5) (2022)
Graham Cormode, Zohar Karnin, Edo Liberty, Justin Thaler, Pavel Veselý
Relative Error Streaming Quantiles. SIGMOD Rec. 51 (1) (2022)
Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukas Folwarczny, Lukasz Jez, Jirí Sgall, Kim Thang Nguyen, Pavel Veselý
New results on multi-level aggregation. Theor. Comput. Sci. 861 (2021)
Matthias Englert, Nicolaos Matsakis, Pavel Veselý
Improved Approximation Guarantees for Shortest Superstrings using Cycle Classification by Overlap to Length Ratios. CoRR (2021)
Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomás Toufar, Pavel Veselý
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. SIAM J. Discret. Math. 35 (1) (2021)
Graham Cormode, Abhinav Mishra, Joseph Ross, Pavel Veselý
Theory meets Practice at the Median: A Worst Case Comparison of Relative Error Quantile Algorithms. KDD (2021)
Antonios Antoniadis, Matthias Englert, Nicolaos Matsakis, Pavel Veselý
Breaking the Barrier Of 2 for the Competitiveness of Longest Queue Drop. ICALP (2021)
Marcin Bienkowski, Martin Böhm, Martin Koutecký, Thomas Rothvoß, Jirí Sgall, Pavel Veselý
Improved Analysis of Online Balanced Clustering. WAOA (2021)
Pavel Veselý
Packet Scheduling: Plans, Monotonicity, and the Golden Ratio. SIGACT News 52 (2) (2021)
Martin Böhm, Lukasz Jez, Jirí Sgall, Pavel Veselý
On packet scheduling with adversarial jamming and speedup. Ann. Oper. Res. 298 (1) (2021)
Graham Cormode, Pavel Veselý
Streaming Algorithms for Bin Packing and Vector Scheduling. Theory Comput. Syst. 65 (6) (2021)
Marcin Bienkowski, Martin Böhm, Martin Koutecký, Thomas Rothvoß, Jirí Sgall, Pavel Veselý
Improved Analysis of Online Balanced Clustering. CoRR (2021)
Graham Cormode, Abhinav Mishra, Joseph Ross, Pavel Veselý
Theory meets Practice: worst case behavior of quantile algorithms. CoRR (2021)
Graham Cormode, Zohar S. Karnin, Edo Liberty, Justin Thaler, Pavel Veselý
Relative Error Streaming Quantiles. PODS (2021)
Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý
Streaming Algorithms for Geometric Steiner Forest. CoRR (2020)
Graham Cormode, Zohar S. Karnin, Edo Liberty, Justin Thaler, Pavel Veselý
Relative Error Streaming Quantiles. CoRR (2020)
Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukas Folwarczny, Lukasz Jez, Jirí Sgall, Kim Thang Nguyen, Pavel Veselý
Online Algorithms for Multilevel Aggregation. Oper. Res. 68 (1) (2020)
Graham Cormode, Pavel Veselý
A Tight Lower Bound for Comparison-Based Quantile Summaries. PODS (2020)
Antonios Antoniadis, Matthias Englert, Nicolaos Matsakis, Pavel Veselý
Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop. CoRR (2020)
Martin Böhm, Marek Chrobak, Lukasz Jez, Fei Li, Jirí Sgall, Pavel Veselý
Online packet scheduling with bounded delay and lookahead. Theor. Comput. Sci. 776 (2019)
Graham Cormode, Pavel Veselý
Streaming Algorithms for Bin Packing and Vector Scheduling. WAOA (2019)
Graham Cormode, Pavel Veselý
Tight Lower Bound for Comparison-Based Quantile Summaries. CoRR (2019)
Graham Cormode, Pavel Veselý
Streaming Algorithms for Bin Packing and Vector Scheduling. CoRR (2019)
Pavel Veselý, Marek Chrobak, Lukasz Jez, Jirí Sgall
A ϕ-Competitive Algorithm for Scheduling Packets with Deadlines. SODA (2019)
Pavel Veselý, Marek Chrobak, Lukasz Jez, Jirí Sgall
A φ-Competitive Algorithm for Scheduling Packets with Deadlines. CoRR (2018)
Martin Böhm, Pavel Veselý
Online Chromatic Number is PSPACE-Complete. Theory Comput. Syst. 62 (6) (2018)
Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomas Toufar, Pavel Veselý
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. STACS (2018)
Martin Böhm, György Dósa, Leah Epstein, Jirí Sgall, Pavel Veselý
Colored Bin Packing: Online Algorithms and Lower Bounds. Algorithmica 80 (1) (2018)
Marcin Bienkowski, Martin Böhm, Lukasz Jez, Pawel Laskos-Grabowski, Jan Marcinkowski, Jirí Sgall, Aleksandra Spyra, Pavel Veselý
Logarithmic price of buffer downscaling on line metrics. Theor. Comput. Sci. 707 (2018)
Martin Böhm, Lukasz Jez, Jirí Sgall, Pavel Veselý
On Packet Scheduling with Adversarial Jamming and Speedup. CoRR (2017)
Martin Böhm, Lukasz Jez, Jirí Sgall, Pavel Veselý
On Packet Scheduling with Adversarial Jamming and Speedup. WAOA (2017)
Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý
Online bin stretching with three bins. J. Sched. 20 (6) (2017)
Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý
Erratum to: A two-phase algorithm for bin stretching with stretching factor 1.5. J. Comb. Optim. 34 (3) (2017)
Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomás Toufar, Pavel Veselý
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. CoRR (2017)
Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý
A two-phase algorithm for bin stretching with stretching factor 1.5. J. Comb. Optim. 34 (3) (2017)
Martin Böhm, Marek Chrobak, Lukasz Jez, Fei Li, Jirí Sgall, Pavel Veselý
Online Packet Scheduling with Bounded Delay and Lookahead. ISAAC (2016)
Martin Böhm, Pavel Veselý
Online Chromatic Number is PSPACE-Complete. CoRR (2016)
Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukas Folwarczny, Lukasz Jez, Jiri Sgall, Kim Thang Nguyen, Pavel Veselý
Online Algorithms for Multi-Level Aggregation. ESA (2016)
Marcin Bienkowski, Martin Böhm, Lukasz Jez, Pawel Laskos-Grabowski, Jan Marcinkowski, Jirí Sgall, Aleksandra Spyra, Pavel Veselý
Logarithmic price of buffer downscaling on line metrics. CoRR (2016)
Martin Böhm, Pavel Veselý
Online Chromatic Number is PSPACE-Complete. IWOCA (2016)
Martin Böhm, Marek Chrobak, Lukasz Jez, Fei Li, Jirí Sgall, Pavel Veselý
Online Packet Scheduling with Bounded Delay and Lookahead. CoRR (2016)
Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý
The Best Two-Phase Algorithm for Bin Stretching. CoRR (2016)
Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukas Folwarczny, Lukasz Jez, Jirí Sgall, Kim Thang Nguyen, Pavel Veselý
Online Algorithms for Multi-Level Aggregation. CoRR (2015)
Martin Böhm, Jirí Sgall, Pavel Veselý
Online Colored Bin Packing. CoRR (2014)
Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý
Better Algorithms for Online Bin Stretching. CoRR (2014)
Martin Böhm, Jirí Sgall, Pavel Veselý
Online Colored Bin Packing. WAOA (2014)
Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý
Better Algorithms for Online Bin Stretching. WAOA (2014)
Tomás Valla, Pavel Veselý
WALTZ: A Strong Tzaar-Playing Program. CGW@IJCAI (2013)
Daniel Zicha, Pavel Veselý
: Development of a Specialized Control Strategy. AIME (1989)