The following pages link to Pavel Veselý (Q726096):
Displaying 23 items.
- Online chromatic number is PSPACE-complete (Q726097) (← links)
- A two-phase algorithm for bin stretching with stretching factor 1.5 (Q1680492) (← links)
- Logarithmic price of buffer downscaling on line metrics (Q1685970) (← links)
- Colored bin packing: online algorithms and lower bounds (Q1702125) (← links)
- Online bin stretching with three bins (Q1702659) (← links)
- New results on multi-level aggregation (Q1998855) (← links)
- Improved analysis of online balanced clustering (Q2085752) (← links)
- Online packet scheduling with bounded delay and lookahead (Q2419122) (← links)
- (Q3304124) (← links)
- Better Algorithms for Online Bin Stretching (Q3453280) (← links)
- Online Colored Bin Packing (Q3453281) (← links)
- (Q4606281) (← links)
- (Q4636503) (← links)
- A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines (Q5048294) (← links)
- Online Algorithms for Multilevel Aggregation (Q5130492) (← links)
- A <i>ϕ</i>-Competitive Algorithm for Scheduling Packets with Deadlines (Q5236190) (← links)
- Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices (Q5857009) (← links)
- On packet scheduling with adversarial jamming and speedup (Q5896878) (← links)
- On packet scheduling with adversarial jamming and speedup (Q5915656) (← links)
- Streaming algorithms for bin packing and vector scheduling (Q5918897) (← links)
- Streaming algorithms for bin packing and vector scheduling (Q5919096) (← links)
- Streaming algorithms for geometric Steiner forest (Q6560836) (← links)
- Genomic datasets used for evalution of k-mer representations and indexes (Q6701350) (← links)
