Research

Papers

• J. Belohorec, P. Dvořák, C. Hoffmann, P. Hubáček, K. Mašková and M. Pastyřík - On Extractability of the KZG Family of Polynomial Commitment Schemes
• P. Dvořák, B. Loff, S. Sherif - A Quantum Pigeonhole Principle and Two Semidefinite Relaxations of Communication Complexity
• A. Chattopadhyay, P. Dvořák - Super-critical Trade-offs in Resolution over Parities Via Lifting
• S. K. Bhattacharya, A. Chattopadhyay, P. Dvořák - Exponential Separation Between Powers of Regular and General Resolution Over Parities
  - 39th Computational Complexity Conference, CCC 2024
• P. Dvořák, L. Folwarczný, M. Opler, P. Pudlák, R. Šámal, T. Vu - Bounds on Functionality and Symmetric Difference - Two Intriguing Graph Parameters
  - The 49th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2023
• C.-M. Alexandru, P. Dvořák, C. Konrad, K. Naidu - Improved Weighted Matching in the Sliding Window Model
  - 40th Symposium on Theoretical Aspects of Computer Science, STACS 2023
• P. Dvořák, M. Krawczyk, T. Masařík, J. Novotná, P. Rzążewski, A. Żuk - List Locally Surjective Homomorphisms in Hereditary Graph Classes
  - The 33rd International Symposium on Algorithms and Computation, ISAAC 2022
• P. Dvořák, M. Koucký, K. Král, V. Slívová - Data Structures Lower Bounds and Popular Conjectures
  - The 29th Annual European Symposium on Algorithms, ESA 2021
• V. Blažej, P. Dvořák, M. Opler - Bears with Hats and Independence Polynomials
  - The 47th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2021
• P. Dvořák, M. Koucký - Barrington Plays Cards: The Complexity of Card-based Protocols
  - 38th Symposium on Theoretical Aspects of Computer Science, STACS 2021
• P. Dvořák, B. Loff - Lower Bounds for Semi-adaptive Data Structures via Corruption
  - The 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2020
• P. Dvořák, A. E. Feldmann, A. Rai, P. Rzążewski - Parameterized Inapproximability of Independent Set in H-Free Graphs
  - The 46th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2020
  - Algorithmica, 2022
• V. Blažej, P. Dvořá, T. Valla - On Induced Online Ramsey Number of Paths, Cycles, and Trees
  - The 14th International Computer Science Symposium in Russia, CSR 2019
• P. Dvořák, D. Knop, T. Toufar - Target Set Selection in Dense Graph Classes
  - The 29th International Symposium on Algorithms and Computation, ISAAC 2018
  - SIAM Journal on Discrete Mathematics, 2022
• P. Dvořák, A. E. Feldmann, D. Knop, T. Masařík, T. Toufar, P. Veselý - Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices
  - 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018
  - SIAM Journal on Discrete Mathematics, 2021
• P. Dvořák, E. Eiben, R. Ganian, D. Knop, S. Ordyniak - Solving Integer Linear Programs with a Small Number of Global Variables and Constraints
  - Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017
  - Artificial Intelligence, 2021 (under name The complexity landscape of decompositional parameters for ILP: Programs with few global variables and constraints)
• A. Chattopadhyay, P. Dvořák, M. Koucký, B. Loff, S. Mukhopadhyay - Lower Bounds for Elimination via Weak Regularity
  - 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017
• P. Dvořák, D. Knop, T. Masařík - Anti-Path Cover on Sparse Graph Classes
  - 11th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, MEMICS 2016
• P. Dvořák, T. Valla - Automorphisms of the Cube n^d
  - The 22nd International Computing and Combinatorics Conference, COCOON 2016
  - Discrete Mathematics, 2021
• P. Dvořák, T. Valla - On the Computational Complexity and Strategies of Online Ramsey Theory
  - The Eight European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2015
• P. Dvořák, D. Knop - Parameterized complexity of length-bounded cuts and multi-cuts
  - 12th Annual Conference on Theory and Applications of Models of Computation, TAMC 2015
  - Algorithmica, 2018

Theses

• Doctoral thesis
• Master thesis - summary of results about online Ramsey theory from 2014, which I wrote when I stared work on my master thesis.
• Bachelor thesis - containing lot of mistakes, paper with all corrections.