default search action
Pavel Veselý 0001
Person information
- affiliation: Charles University, Prague, Czech Republic
Other persons with the same name
- Pavel Veselý 0002 — Institute of Molecular Genetics, Czechoslovak Academy of Sciences, Czechoslovakia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j18]Artur Czumaj
, Shaofeng H.-C. Jiang
Streaming Algorithms for Geometric Steiner Forest. ACM Trans. Algorithms 20(4): 28:1-28:38 (2024) - [j17]Antonios Antoniadis
Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop. ACM Trans. Algorithms 20(4): 38:1-38:29 (2024) - [c20]Artur Czumaj, Guichen Gao, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý:
Fully-Scalable MPC Algorithms for Clustering in High Dimension. ICALP 2024: 50:1-50:20 - 2023
- [j16]Graham Cormode
Relative Error Streaming Quantiles. J. ACM 70(5): 30:1-30:48 (2023) - [c19]Matthias Englert, Nicolaos Matsakis, Pavel Veselý:
Approximation Guarantees for Shortest Superstrings: Simpler and Better. ISAAC 2023: 29:1-29:17 - [i21]Artur Czumaj, Guichen Gao, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý:
Fully Scalable MPC Algorithms for Clustering in High Dimension. CoRR abs/2307.07848 (2023) - [i20]Sunny Atalig, Marek Chrobak, Erfan Mousavian, Jiri Sgall
Structural Properties of Search Trees with 2-way Comparisons. CoRR abs/2311.02224 (2023) - 2022
- [j15]Pavel Veselý
A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines. SIAM J. Comput. 51(5): 1626-1691 (2022) - [j14]Graham Cormode
Relative Error Streaming Quantiles. SIGMOD Rec. 51(1): 69-76 (2022) - [c18]Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer
Streaming Facility Location in High Dimension via Geometric Hashing. FOCS 2022: 450-461 - [c17]Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý
Streaming Algorithms for Geometric Steiner Forest. ICALP 2022: 47:1-47:20 - [c16]Matthias Englert, Nicolaos Matsakis, Pavel Veselý
Improved approximation guarantees for shortest superstrings using cycle classification by overlap to length ratios. STOC 2022: 317-330 - [i19]Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý
Streaming Facility Location in High Dimension via New Geometric Hashing. CoRR abs/2204.02095 (2022) - 2021
- [j13]Martin Böhm, Lukasz Jez, Jirí Sgall
On packet scheduling with adversarial jamming and speedup. Ann. Oper. Res. 298(1): 7-42 (2021) - [j12]Graham Cormode
Streaming Algorithms for Bin Packing and Vector Scheduling. Theory Comput. Syst. 65(6): 916-942 (2021) - [j11]Pavel Dvorák
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. SIAM J. Discret. Math. 35(1): 546-574 (2021) - [j10]Pavel Veselý
Packet Scheduling: Plans, Monotonicity, and the Golden Ratio. SIGACT News 52(2): 72-84 (2021) - [j9]Marcin Bienkowski
New results on multi-level aggregation. Theor. Comput. Sci. 861: 133-143 (2021) - [c15]Antonios Antoniadis, Matthias Englert, Nicolaos Matsakis, Pavel Veselý
Breaking the Barrier Of 2 for the Competitiveness of Longest Queue Drop. ICALP 2021: 17:1-17:20 - [c14]Graham Cormode
Theory meets Practice at the Median: A Worst Case Comparison of Relative Error Quantile Algorithms. KDD 2021: 2722-2731 - [c13]Graham Cormode
Relative Error Streaming Quantiles. PODS 2021: 96-108 - [c12]Marcin Bienkowski
Improved Analysis of Online Balanced Clustering. WAOA 2021: 224-233 - [i18]Graham Cormode, Abhinav Mishra, Joseph Ross, Pavel Veselý:
Theory meets Practice: worst case behavior of quantile algorithms. CoRR abs/2102.09299 (2021) - [i17]Marcin Bienkowski, Martin Böhm, Martin Koutecký, Thomas Rothvoß, Jirí Sgall, Pavel Veselý:
Improved Analysis of Online Balanced Clustering. CoRR abs/2107.00145 (2021) - [i16]Matthias Englert, Nicolaos Matsakis, Pavel Veselý:
Improved Approximation Guarantees for Shortest Superstrings using Cycle Classification by Overlap to Length Ratios. CoRR abs/2111.03968 (2021) - 2020
- [j8]Marcin Bienkowski
Online Algorithms for Multilevel Aggregation. Oper. Res. 68(1): 214-232 (2020) - [c11]Graham Cormode
A Tight Lower Bound for Comparison-Based Quantile Summaries. PODS 2020: 81-93 - [i15]Graham Cormode, Zohar S. Karnin, Edo Liberty, Justin Thaler, Pavel Veselý:
Relative Error Streaming Quantiles. CoRR abs/2004.01668 (2020) - [i14]Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý:
Streaming Algorithms for Geometric Steiner Forest. CoRR abs/2011.04324 (2020) - [i13]Antonios Antoniadis, Matthias Englert, Nicolaos Matsakis, Pavel Veselý:
Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop. CoRR abs/2012.03906 (2020)
2010 – 2019
- 2019
- [j7]Martin Böhm, Marek Chrobak, Lukasz Jez, Fei Li
Online packet scheduling with bounded delay and lookahead. Theor. Comput. Sci. 776: 95-113 (2019) - [c10]Pavel Veselý
A ϕ-Competitive Algorithm for Scheduling Packets with Deadlines. SODA 2019: 123-142 - [c9]Graham Cormode
Streaming Algorithms for Bin Packing and Vector Scheduling. WAOA 2019: 72-88 - [i12]Graham Cormode, Pavel Veselý
Tight Lower Bound for Comparison-Based Quantile Summaries. CoRR abs/1905.03838 (2019) - [i11]Graham Cormode, Pavel Veselý:
Streaming Algorithms for Bin Packing and Vector Scheduling. CoRR abs/1905.04897 (2019) - 2018
- [j6]Martin Böhm
Colored Bin Packing: Online Algorithms and Lower Bounds. Algorithmica 80(1): 155-184 (2018) - [j5]Martin Böhm
Online Chromatic Number is PSPACE-Complete. Theory Comput. Syst. 62(6): 1366-1391 (2018) - [j4]Marcin Bienkowski
Logarithmic price of buffer downscaling on line metrics. Theor. Comput. Sci. 707: 89-93 (2018) - [c8]Pavel Dvorák
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. STACS 2018: 26:1-26:15 - [i10]Pavel Veselý, Marek Chrobak, Lukasz Jez, Jirí Sgall:
A φ-Competitive Algorithm for Scheduling Packets with Deadlines. CoRR abs/1807.07177 (2018) - 2017
- [j3]Martin Böhm
A two-phase algorithm for bin stretching with stretching factor 1.5. J. Comb. Optim. 34(3): 810-828 (2017) - [j2]Martin Böhm
Erratum to: A two-phase algorithm for bin stretching with stretching factor 1.5. J. Comb. Optim. 34(3): 829 (2017) - [j1]Martin Böhm
Online bin stretching with three bins. J. Sched. 20(6): 601-621 (2017) - [c7]Martin Böhm, Lukasz Jez, Jirí Sgall
On Packet Scheduling with Adversarial Jamming and Speedup. WAOA 2017: 190-206 - [i9]Martin Böhm, Lukasz Jez, Jirí Sgall, Pavel Veselý:
On Packet Scheduling with Adversarial Jamming and Speedup. CoRR abs/1705.07018 (2017) - [i8]Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. CoRR abs/1710.00668 (2017) - 2016
- [c6]Marcin Bienkowski
Online Algorithms for Multi-Level Aggregation. ESA 2016: 12:1-12:17 - [c5]Martin Böhm
Online Packet Scheduling with Bounded Delay and Lookahead. ISAAC 2016: 21:1-21:13 - [c4]Martin Böhm
Online Chromatic Number is PSPACE-Complete. IWOCA 2016: 16-28 - [i7]Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý:
The Best Two-Phase Algorithm for Bin Stretching. CoRR abs/1601.08111 (2016) - [i6]Martin Böhm, Pavel Veselý:
Online Chromatic Number is PSPACE-Complete. CoRR abs/1604.05940 (2016) - [i5]Martin Böhm, Marek Chrobak, Lukasz Jez, Fei Li, Jirí Sgall, Pavel Veselý:
Online Packet Scheduling with Bounded Delay and Lookahead. CoRR abs/1606.09395 (2016) - [i4]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 abs/1610.04915 (2016) - 2015
- [i3]Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukás Folwarczný, Lukasz Jez, Jirí Sgall, Kim Thang Nguyen, Pavel Veselý:
Online Algorithms for Multi-Level Aggregation. CoRR abs/1507.02378 (2015) - 2014
- [c3]Martin Böhm
Better Algorithms for Online Bin Stretching. WAOA 2014: 23-34 - [c2]Martin Böhm
Online Colored Bin Packing. WAOA 2014: 35-46 - [i2]Martin Böhm, Jirí Sgall, Pavel Veselý:
Online Colored Bin Packing. CoRR abs/1404.5548 (2014) - [i1]Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý:
Better Algorithms for Online Bin Stretching. CoRR abs/1404.5569 (2014) - 2013
- [c1]Tomás Valla
WALTZ: A Strong Tzaar-Playing Program. CGW@IJCAI 2013: 81-96
Coauthor Index
aka: Jiri Sgall
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: