WALTZ: A Strong Tzaar-Playing Program. - Tomás Valla; Pavel Veselý 001 (CGW@IJCAI, 2013)

Better Algorithms for Online Bin Stretching. - Martin Böhm 001; Jirí Sgall; Rob van Stee; Pavel Veselý 001 (WAOA, 2014)

Online Colored Bin Packing. - Martin Böhm 001; Jirí Sgall; Pavel Veselý 001 (WAOA, 2014)

Online Algorithms for Multi-Level Aggregation. - Marcin Bienkowski; Martin Böhm 001; Jaroslaw Byrka; Marek Chrobak; Christoph Dürr; Lukás Folwarczný; Lukasz Jez; Jiri Sgall; Kim Thang Nguyen; Pavel Veselý 001 (ESA, 2016)

The Best Two-Phase Algorithm for Bin Stretching. - Martin Böhm 001; Jirí Sgall; Rob van Stee; Pavel Veselý 001 (CoRR, 2016)

A two-phase algorithm for bin stretching with stretching factor 1.5. - Martin Böhm 001; Jirí Sgall; Rob van Stee; Pavel Veselý 001 (J. Comb. Optim., 2017)

Erratum to: A two-phase algorithm for bin stretching with stretching factor 1.5. - Martin Böhm 001; Jirí Sgall; Rob van Stee; Pavel Veselý 001 (J. Comb. Optim., 2017)

Online bin stretching with three bins. - Martin Böhm 001; Jirí Sgall; Rob van Stee; Pavel Veselý 001 (J. Sched., 2017)

Colored Bin Packing: Online Algorithms and Lower Bounds. - Martin Böhm 001; György Dósa; Leah Epstein; Jirí Sgall; Pavel Veselý 001 (Algorithmica, 2018)

Online Chromatic Number is PSPACE-Complete. - Martin Böhm 001; Pavel Veselý 001 (Theory Comput. Syst., 2018)

Logarithmic price of buffer downscaling on line metrics. - Marcin Bienkowski; Martin Böhm 001; Lukasz Jez; Pawel Laskos-Grabowski; Jan Marcinkowski; Jirí Sgall; Aleksandra Spyra; Pavel Veselý 001 (Theor. Comput. Sci., 2018)

A ϕ-Competitive Algorithm for Scheduling Packets with Deadlines. - Pavel Veselý 001; Marek Chrobak; Lukasz Jez; Jirí Sgall (SODA, 2019)

Online packet scheduling with bounded delay and lookahead. - Martin Böhm 001; Marek Chrobak; Lukasz Jez; Fei Li 001; Jirí Sgall; Pavel Veselý 001 (Theor. Comput. Sci., 2019)

A Tight Lower Bound for Comparison-Based Quantile Summaries. - Graham Cormode; Pavel Veselý 001 (PODS, 2020)

Online Algorithms for Multilevel Aggregation. - Marcin Bienkowski; Martin Böhm 001; Jaroslaw Byrka; Marek Chrobak; Christoph Dürr; Lukás Folwarczný; Lukasz Jez; Jirí Sgall; Kim Thang Nguyen; Pavel Veselý 001 (Oper. Res., 2020)

Theory meets Practice at the Median: A Worst Case Comparison of Relative Error Quantile Algorithms. - Graham Cormode; Abhinav Mishra; Joseph Ross; Pavel Veselý 001 (KDD, 2021)

Improved Analysis of Online Balanced Clustering. - Marcin Bienkowski; Martin Böhm 001; Martin Koutecký; Thomas Rothvoß; Jirí Sgall; Pavel Veselý 001 (WAOA, 2021)

On packet scheduling with adversarial jamming and speedup. - Martin Böhm 001; Lukasz Jez; Jirí Sgall; Pavel Veselý 001 (Ann. Oper. Res., 2021)

Theory meets Practice: worst case behavior of quantile algorithms. - Graham Cormode; Abhinav Mishra; Joseph Ross; Pavel Veselý 001 (CoRR, 2021)

Streaming Algorithms for Bin Packing and Vector Scheduling. - Graham Cormode; Pavel Veselý 001 (Theory Comput. Syst., 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ý 001 (SIAM J. Discret. Math., 2021)

Packet Scheduling: Plans, Monotonicity, and the Golden Ratio. - Pavel Veselý 001 (SIGACT News, 2021)

New results on multi-level aggregation. - Marcin Bienkowski; Martin Böhm 001; Jaroslaw Byrka; Marek Chrobak; Christoph Dürr; Lukás Folwarczný; Lukasz Jez; Jirí Sgall; Kim Thang Nguyen; Pavel Veselý 001 (Theor. Comput. Sci., 2021)

Streaming Facility Location in High Dimension via Geometric Hashing. - Artur Czumaj; Shaofeng H.-C. Jiang; Robert Krauthgamer; Pavel Veselý 001; Mingwei Yang 002 (FOCS, 2022)

Improved approximation guarantees for shortest superstrings using cycle classification by overlap to length ratios. - Matthias Englert; Nicolaos Matsakis; Pavel Veselý 001 (STOC, 2022)

Streaming Facility Location in High Dimension via New Geometric Hashing. - Artur Czumaj; Shaofeng H.-C. Jiang; Robert Krauthgamer; Pavel Veselý 001; Mingwei Yang 002 (CoRR, 2022)

A ( boldsymbol{ phi } ) -Competitive Algorithm for Scheduling Packets with Deadlines. - Pavel Veselý 001; Marek Chrobak; Lukasz Jez; Jirí Sgall (SIAM J. Comput., 2022)

Relative Error Streaming Quantiles. - Graham Cormode; Zohar S. Karnin; Edo Liberty; Justin Thaler; Pavel Veselý 001 (SIGMOD Rec., 2022)

Approximation Guarantees for Shortest Superstrings: Simpler and Better. - Matthias Englert; Nicolaos Matsakis; Pavel Veselý 001 (ISAAC, 2023)

Structural Properties of Search Trees with 2-way Comparisons. - Sunny Atalig; Marek Chrobak; Erfan Mousavian; Jiri Sgall; Pavel Veselý 001 (CoRR, 2023)

Fully-Scalable MPC Algorithms for Clustering in High Dimension. - Artur Czumaj; Guichen Gao; Shaofeng H.-C. Jiang; Robert Krauthgamer; Pavel Veselý 001 (ICALP, 2024)

Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop. - Antonios Antoniadis 001; Matthias Englert; Nicolaos Matsakis; Pavel Veselý 001 (ACM Trans. Algorithms, 2024)

Streaming Algorithms for Geometric Steiner Forest. - Artur Czumaj; Shaofeng H.-C. Jiang; Robert Krauthgamer; Pavel Veselý 001 (ACM Trans. Algorithms, 2024)

SplineSketch: Even More Accurate Quantiles with Error Guarantees. - Aleksander Lukasiewicz; Jakub Tetek; Pavel Veselý 001 (CoRR, 2025)

Streaming Diameter of High-Dimensional Points. - Magnús M. Halldórsson; Nicolaos Matsakis; Pavel Veselý 001 (CoRR, 2025)