Pavel Veselý

An approximation of my appearance.
An approximation of my appearance.

A somewhat better approximation.
A somewhat better approximation.
Welcome to my academic homepage! I'm currently studying doctoral program Discrete Models and Algorithms at Computer Science Institute of Charles University in Prague. The institute is a part of Faculty of Mathematics and Physics. My advisor is professor Jiří Sgall and I'm also working a lot with his other Ph.D. student Martin Böhm.

Contact

Teaching / Výuka

LS 17/18

ZS 17/18 (winter semester 17/18)

Teaching in previous years (in Czech only) / Výuka v předchozích letech

Research interests

Projects

Selected work (see also publications below): Recent collaborators (except J. Sgall, M. Böhm and our local FPT group):

Publications

Papers are ordered basically from the newest to the oldest and each has a short summary. See also my ORCID account, Google Scholar account, or dblp search.

Conference papers

  1. Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices.
    with Pavel Dvořák, Andreas Emil Feldmann, Dušan Knop, Tomáš Masařík, and Tomáš Toufar.
    To appear in STACS 2018. ArXiv preprint. View/hide summary.
  2. On Packet Scheduling with Adversarial Jamming and Speedup
    with Martin Böhm, Łukasz Jeż, Jiří Sgall.
    To appear in WAOA 2017. ArXiv preprint. WAOA slides. View/hide summary.
  3. Online Chromatic Number is PSPACE-Complete
    with Martin Böhm.
    In IWOCA 2016, LNCS 9843, pp. 16-28, Springer, 2016.
    Best Student Paper of IWOCA 2016. ArXiv preprint. HALG 2017 poster. View/hide summary.
  4. Online Packet Scheduling with Bounded Delay and Lookahead
    with Martin Böhm, Marek Chrobak, Łukasz Jeż, Fei Li, Jiří Sgall.
    In ISAAC 2016, LIPIcs, p. 21:1--21:13, Schloss Dagstuhl, 2016. LIPIcs link, ArXiv preprint. MAPSP slides. View/hide summary.
  5. Online Algorithms for Multi-Level Aggregation.
    with Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukáš Folwarczný, Łukasz Jeż, Jiří Sgall, Nguyen Kim Thang.
    In ESA 2016, Leibniz International Proceedings in Informatics (LIPIcs), p. 12:1-12:17, Schloss Dagstuhl, 2016. LIPIcs link, ArXiv preprint. View/hide summary.
  6. Better algorithms for online bin stretching
    with Martin Böhm, Jiří Sgall, Rob van Stee.
    In WAOA 2014, LNCS 8952, p. 236-247, Springer, 2015. ArXiv preprint. View/hide summary.
  7. Online colored bin packing
    with Martin Böhm, Jiří Sgall.
    In WAOA 2014, LNCS 8952, p. 35-46, Springer, 2015. ArXiv preprint. View/hide summary.
  8. WALTZ: a strong Tzaar-playing program
    with Tomáš Valla.
    In Computer Games, CCIS 408, p. 81–96, Springer, 2014. View/hide summary.

Journal papers

  1. On Packet Scheduling with Adversarial Jamming and Speedup
    with Martin Böhm, Łukasz Jeż, Jiří Sgall.
    Submitted. ArXiv preprint. WAOA slides. View/hide summary.
  2. Online Packet Scheduling with Bounded Delay and Lookahead
    with Martin Böhm, Marek Chrobak, Łukasz Jeż, Fei Li, Jiří Sgall.
    Submitted. ArXiv preprint. MAPSP slides. View/hide summary.
  3. Online Chromatic Number is PSPACE-Complete
    with Martin Böhm.
    Theory of Computing Systems, 2017, doi:10.1007/s00224-017-9797-2. ArXiv preprint. HALG 2017 poster View/hide summary.
  4. Logarithmic price of buffer downscaling on line metrics
    with Marcin Bienkowski, Martin Bohm, Łukasz Jeż, Paweł Laskoś-Grabowski, Jan Marcinkowski, Jiří Sgall, Aleksandra Spyra.
    Theoretical Computer Science, vol. 707, p. 89-93, Elsevier, 2018, doi:10.1016/j.tcs.2017.10.008. ArXiv preprint. View/hide summary.
  5. Online Algorithms for Multi-Level Aggregation.
    with Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukáš Folwarczný, Łukasz Jeż, Jiří Sgall, Nguyen Kim Thang.
    Submitted. ArXiv preprint. View/hide summary. .
  6. A Two-Phase Algorithm for Bin Stretching with Stretching Factor 1.5
    with Martin Böhm, Jiří Sgall, Rob van Stee.
    Journal of Combinatorial Optimization, vol. 34(3), p. 810-828, Springer, 2017, doi:10.1007/s10878-017-0114-4. ArXiv preprint. View/hide summary.
  7. Online Bin Stretching with Three Bins
    with Martin Böhm, Jiří Sgall, Rob van Stee.
    Journal of Scheduling, vol. 20(6), p. 601-621, Springer, 2017, doi:10.1007/s10951-016-0504-y. ArXiv preprint. View/hide summary.
  8. Colored Bin Packing: Online Algorithms and Lower Bounds
    with Martin Böhm, György Dósa, Leah Epstein, Jiří Sgall.
    Algorithmica, vol. 80(1), p. 155-184, Springer, 2018, doi:10.1007/s00453-016-0248-2. View/hide summary.

Recommended books, articles, videos etc., mosly about personal development

Other stuff (life, the Universe and everything)

See (future) personal page.