Pavel Dvorák

50 papers A* 1A 8B 6Misc 2Journal 27Unranked 5
YearRankTypeTitle / Venue / Authors
2026 A conf
A Quantum Pigeonhole Principle and Two Semidefinite Relaxations of Communication Complexity.
STACS
Pavel Dvorák, Bruno Loff, Suhail Sherif
2026 — conf
Semi-Robust Communication Complexity of Maximum Matching.
SOSA
Gabriel Cipriani Huete, Adithya Diddapur, Pavel Dvorák, Christian Konrad
2025 — conf
On Extractability of the KZG Family of Polynomial Commitment Schemes.
CRYPTO (6)
Juraj Belohorec, Pavel Dvorák, Charlotte Hoffmann, Pavel Hubácek, Kristýna Masková, Martin Pastyrík
2025 J jnl
On Extractability of the KZG Family of Polynomial Commitment Schemes.
IACR Cryptol. ePrint Arch.
Juraj Belohorec, Pavel Dvorák, Charlotte Hoffmann, Pavel Hubácek, Kristýna Masková, Martin Pastyrík
2025 J jnl
Semi-Robust Communication Complexity of Maximum Matching.
CoRR
Gabriel Cipriani Huete, Adithya Diddapur, Pavel Dvorák, Christian Konrad
2025 A conf
Super-Critical Trade-Offs in Resolution over Parities via Lifting.
CCC
Arkadev Chattopadhyay, Pavel Dvorák
2024 J jnl
A Quantum Pigeonhole Principle and Two Semidefinite Relaxations of Communication Complexity.
CoRR
Pavel Dvorák, Bruno Loff, Suhail Sherif
2024 J jnl
Exponential Separation Between Powers of Regular and General Resolution Over Parities.
CoRR
Sreejata Kishor Bhattacharya, Arkadev Chattopadhyay, Pavel Dvorák
2024 A conf
Exponential Separation Between Powers of Regular and General Resolution over Parities.
CCC
Sreejata Kishor Bhattacharya, Arkadev Chattopadhyay, Pavel Dvorák
2023 J jnl
Bears with Hats and Independence Polynomials.
Discret. Math. Theor. Comput. Sci.
Václav Blazej, Pavel Dvorák, Michal Opler
2023 B conf
Bounds on Functionality and Symmetric Difference - Two Intriguing Graph Parameters.
WG
Pavel Dvorák, Lukás Folwarczný, Michal Opler, Pavel Pudlák, Robert Sámal, Tung Anh Vu
2023 J jnl
Bounds on Functionality and Symmetric Difference - Two Intriguing Graph Parameters.
CoRR
Pavel Dvorák, Lukás Folwarczný, Michal Opler, Pavel Pudlák, Robert Sámal, Tung Anh Vu
2023 A conf
Improved Weighted Matching in the Sliding Window Model.
STACS
Cezar-Mihail Alexandru, Pavel Dvorák, Christian Konrad, Kheeran K. Naidu
2023 J jnl
Parameterized Inapproximability of Independent Set in H-Free Graphs.
Algorithmica
Pavel Dvorák, Andreas Emil Feldmann, Ashutosh Rai, Pawel Rzazewski
2023 J jnl
SEVA 4.0: an update of the Standard European Vector Architecture database for advanced analysis and programming of bacterial phenotypes.
Nucleic Acids Res.
Esteban Martínez-García, Sofía Fraile, Elena Algar, Tomás Aparicio, Elena Velázquez, Belén Calles, Huseyin Tas, Blas Blázquez, Bruno Martín, Clara Prieto, Lucas Sánchez-Sampedro, Morten h H. Nørholm, Daniel c Volke, Nicolas T. Wirth, Pavel Dvorák, Lorea Alejaldre, Lewis Grozinger, Matthew Crowther, Ángel Goñi-Moreno, Pablo I. Nikel, Juan Nogales, Víctor de Lorenzo
2022 J jnl
Closing the Gap between Weighted and Unweighted Matching in the Sliding Window Model.
CoRR
Cezar-Mihail Alexandru, Pavel Dvorák, Christian Konrad, Kheeran K. Naidu
2022 B conf
List Locally Surjective Homomorphisms in Hereditary Graph Classes.
ISAAC
Pavel Dvorák, Tomás Masarík, Jana Novotná, Monika Krawczyk, Pawel Rzazewski, Aneta Zuk
2022 J jnl
List Locally Surjective Homomorphisms in Hereditary Graph Classes.
CoRR
Pavel Dvorák, Monika Krawczyk, Tomás Masarík, Jana Novotná, Pawel Rzazewski, Aneta Zuk
2022 J jnl
Target Set Selection in Dense Graph Classes.
SIAM J. Discret. Math.
Pavel Dvorák, Dusan Knop, Tomás Toufar
2021 J jnl
Automorphisms of the cube nd.
Discret. Math.
Pavel Dvorák, Tomás Valla
2021 A conf
Barrington Plays Cards: The Complexity of Card-Based Protocols.
STACS
Pavel Dvorák, Michal Koucký
2021 B conf
Bears with Hats and Independence Polynomials.
WG
Václav Blazej, Pavel Dvorák, Michal Opler
2021 J jnl
Bears with Hats and Independence Polynomials.
CoRR
Václav Blazej, Pavel Dvorák, Michal Opler
2021 A conf
Data Structures Lower Bounds and Popular Conjectures.
ESA
Pavel Dvorák, Michal Koucký, Karel Král, Veronika Slívová
2021 J jnl
Data Structures Lower Bounds and Popular Conjectures.
CoRR
Pavel Dvorák, Michal Koucký, Karel Král, Veronika Slívová
2021 J jnl
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices.
SIAM J. Discret. Math.
Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomás Toufar, Pavel Veselý
2021 J jnl
The complexity landscape of decompositional parameters for ILP: Programs with few global variables and constraints.
Artif. Intell.
Pavel Dvorák, Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak
2020 J jnl
Barrington Plays Cards: The Complexity of Card-based Protocols.
CoRR
Pavel Dvorák, Michal Koucký
2020 — conf
Lower Bounds for Semi-adaptive Data Structures via Corruption.
FSTTCS
Pavel Dvorák, Bruno Loff
2020 J jnl
Lower Bounds for Semi-adaptive Data Structures via Corruption.
CoRR
Pavel Dvorák, Bruno Loff
2020 B conf
Parameterized Inapproximability of Independent Set in H-Free Graphs.
WG
Pavel Dvorák, Andreas Emil Feldmann, Ashutosh Rai, Pawel Rzazewski
2020 J jnl
Parameterized Inapproximability of Independent Set in H-Free Graphs.
CoRR
Pavel Dvorák, Andreas Emil Feldmann, Ashutosh Rai, Pawel Rzazewski
2019 Misc conf
On Induced Online Ramsey Number of Paths, Cycles, and Trees.
CSR
Václav Blazej, Pavel Dvorák, Tomás Valla
2019 J jnl
On Induced Online Ramsey Number of Paths, Cycles, and Trees.
CoRR
Václav Blazej, Pavel Dvorák, Tomás Valla
2018 A conf
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices.
STACS
Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomas Toufar, Pavel Veselý
2018 J jnl
Parameterized Complexity of Length-bounded Cuts and Multicuts.
Algorithmica
Pavel Dvorák, Dusan Knop
2018 B conf
Target Set Selection in Dense Graph Classes.
ISAAC
Pavel Dvorák, Dusan Knop, Tomás Toufar
2017 A conf
Lower Bounds for Elimination via Weak Regularity.
STACS
Arkadev Chattopadhyay, Pavel Dvorák, Michal Koucký, Bruno Loff, Sagnik Mukhopadhyay
2017 J jnl
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices.
CoRR
Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomás Toufar, Pavel Veselý
2017 A* conf
Solving Integer Linear Programs with a Small Number of Global Variables and Constraints.
IJCAI
Pavel Dvorák, Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak
2017 J jnl
Solving Integer Linear Programs with a Small Number of Global Variables and Constraints.
CoRR
Pavel Dvorák, Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak
2016 — conf
Anti-Path Cover on Sparse Graph Classes.
MEMICS
Pavel Dvorák, Dusan Knop, Tomás Masarík
2016 J jnl
Automorphisms of the Cube n
CoRR
Pavel Dvorák, Tomás Valla
2016 Misc conf
Automorphisms of the Cube n^d.
COCOON
Pavel Dvorák, Tomás Valla
2016 J jnl
Lower Bounds for Elimination via Weak Regularity.
Electron. Colloquium Comput. Complex.
Arkadev Chattopadhyay, Pavel Dvorák, Michal Koucký, Bruno Loff, Sagnik Mukhopadhyay
2016 J jnl
Target Set Selection in Dense Graph Classes.
CoRR
Pavel Dvorák, Dusan Knop, Tomás Toufar
2015 — —
Detekce a segmentace mozkového nádoru v multisekvenčním MRI ; Brain Tumor Detection and Segmentation in Multisequence MRI.
Pavel Dvorák
2015 — conf
Local Structure Prediction with Convolutional Neural Networks for Multimodal Brain Tumor Segmentation.
MCV@MICCAI
Pavel Dvorák, Bjoern H. Menze
2015 J jnl
On the Computational Complexity and Strategies of Online Ramsey Theory.
Electron. Notes Discret. Math.
Pavel Dvorák, Tomás Valla
2014 B conf
Brain tumor locating in 3D MR volume using symmetry.
Image Processing
Pavel Dvorák, Karel Bartusek