◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Pavel Veselý

Charles University

13 papers hereh-index 10238 citations28 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author1
  • last author12

Across the 13 of 13 papers where every author was matched, so the position is known.

fields
  • cs.DS12
  • cs.CC1
affiliations
  • Charles University
Homepage
same name
  • Pavel Veselý — 1 paper, h 1

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20142023
most citedA Tight Lower Bound for Comparison-Based Quantile Summaries

19 citations · 38 across the 6 of their papers we have counts for

collaborators
Showing 2014 · cs.DSShow all

2 papers · 2 filters

cs.DS2014

Online Bin Stretching with Three Bins

Martin Böhm, Jiří Sgall, Rob van Stee +1

Online Bin Stretching is a semi-online variant of bin packing in which the algorithm has to use the same number of bins as an optimal packing, but is allowed to slightly overpack t…

cs.DS2014★ 1 cited

Online Colored Bin Packing

Martin Böhm, Jiří Sgall, Pavel Veselý

In the Colored Bin Packing problem a sequence of items of sizes up to 1 arrives to be packed into bins of unit capacity. Each item has one of c≥2 colors and an additional c…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.