Items where authors include "Dvořák, P."

Article

Dvořák, P. orcid.org/0000-0002-6838-1538, Feldmann, A.E. orcid.org/0000-0001-6229-5332, Rai, A. et al. (1 more author) (2023) Parameterized inapproximability of independent set in H-free graphs. Algorithmica, 85 (4). pp. 902-928. ISSN 0178-4617

Dvořák, P., Eiben, E., Ganian, R. et al. (2 more authors) (2021) The complexity landscape of decompositional parameters for ILP : programs with few global variables and constraints. Artificial Intelligence, 300. 103561. ISSN 0004-3702

Dvořák, P., Feldmann, A.E. orcid.org/0000-0001-6229-5332, Knop, D. orcid.org/0000-0003-2588-5709 et al. (3 more authors) (2021) Parameterized approximation schemes for Steiner Trees with small number of Steiner vertices. SIAM Journal on Discrete Mathematics, 35 (1). pp. 546-574. ISSN 0895-4801

Proceedings Paper

Dvořák, P., Feldmann, A.E. orcid.org/0000-0001-6229-5332, Rai, A. et al. (1 more author) (2020) Parameterized inapproximability of independent set in H-free graphs. In: Adler, I. and Müller, H., (eds.) Graph-Theoretic Concepts in Computer Science: 46th International Workshop, WG 2020, Leeds, UK, June 24–26, 2020, Revised Selected Papers. 46th International Workshop, WG 2020, 24-26 Jun 2020, Leeds, UK. Lecture Notes in Computer Science, LNCS 12301 . Springer International Publishing , pp. 40-53. ISBN 9783030604394

Chattopadhyay, A., Dvořák, P., Koucký, M. et al. (2 more authors) (2017) Lower bounds for elimination via weak regularity. In: Vollmer, H. and Vallée, B., (eds.) Leibniz International Proceedings in Informatics, LIPIcs. 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), 08-11 Mar 2017, Hannover, Germany. Leibniz International Proceedings in Informatics, 66 . Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik , Dagstuhl, Germany , 21:1-21:14. ISBN 978-3-95977-028-6