default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPavel Dvorák
Person information
- affiliation: Charles University, Prague, Czech Republic
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c27]Sreejata Kishor Bhattacharya, Arkadev Chattopadhyay, Pavel Dvorák:
Exponential Separation Between Powers of Regular and General Resolution over Parities. CCC 2024: 23:1-23:32- [i20]Sreejata Kishor Bhattacharya, Arkadev Chattopadhyay, Pavel Dvorák:
Exponential Separation Between Powers of Regular and General Resolution Over Parities. CoRR abs/2402.04364 (2024) - [i19]Pavel Dvorák, Bruno Loff, Suhail Sherif:
A Quantum Pigeonhole Principle and Two Semidefinite Relaxations of Communication Complexity. CoRR abs/2409.04592 (2024) - [i18]Sreejata Kishor Bhattacharya, Arkadev Chattopadhyay, Pavel Dvorak:
Exponential Separation Between Powers of Regular and General Resolution Over Parities. Electron. Colloquium Comput. Complex. TR24 (2024) - [i17]Arkadev Chattopadhyay, Pavel Dvorak:
Super-critical Trade-offs in Resolution over Parities Via Lifting. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [j9]Pavel Dvorák
, Andreas Emil Feldmann, Ashutosh Rai, Pawel Rzazewski:
Parameterized Inapproximability of Independent Set in H-Free Graphs. Algorithmica 85(4): 902-928 (2023) - [j8]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:
SEVA 4.0: an update of the Standard European Vector Architecture database for advanced analysis and programming of bacterial phenotypes. Nucleic Acids Res. 51(D1): 1558-1567 (2023) - [c26]Cezar-Mihail Alexandru, Pavel Dvorák, Christian Konrad, Kheeran K. Naidu:
Improved Weighted Matching in the Sliding Window Model. STACS 2023: 6:1-6:21 - [c25]Pavel Dvorák, Lukás Folwarczný, Michal Opler, Pavel Pudlák, Robert Sámal, Tung Anh Vu:
Bounds on Functionality and Symmetric Difference - Two Intriguing Graph Parameters. WG 2023: 305-318 - [i16]Pavel Dvorák, Lukás Folwarczný, Michal Opler, Pavel Pudlák, Robert Sámal, Tung Anh Vu:
Bounds on Functionality and Symmetric Difference - Two Intriguing Graph Parameters. CoRR abs/2302.11862 (2023) - 2022
- [j7]Pavel Dvorák, Dusan Knop, Tomás Toufar:
Target Set Selection in Dense Graph Classes. SIAM J. Discret. Math. 36(1): 536-572 (2022) - [c24]Stepan Jezek, Martin Jonak, Radim Burget, Pavel Dvorak, Milos Skotak:
Anomaly detection for real-world industrial applications: benchmarking recent self-supervised and pretrained methods. ICUMT 2022: 64-69 - [c23]Pavel Dvorák, Tomás Masarík, Jana Novotná, Monika Krawczyk, Pawel Rzazewski, Aneta Zuk:
List Locally Surjective Homomorphisms in Hereditary Graph Classes. ISAAC 2022: 30:1-30:15 - [i15]Pavel Dvorák, Monika Krawczyk, Tomás Masarík, Jana Novotná, Pawel Rzazewski, Aneta Zuk:
List Locally Surjective Homomorphisms in Hereditary Graph Classes. CoRR abs/2202.12438 (2022) - [i14]Radek Benes, Pavel Dvorak, Marcos Faúndez-Zanuy, Virginia Espinosa-Duro, Jirí Mekyska:
Multi-focus thermal image fusion. CoRR abs/2203.08513 (2022) - [i13]Cezar-Mihail Alexandru, Pavel Dvorák, Christian Konrad, Kheeran K. Naidu:
Closing the Gap between Weighted and Unweighted Matching in the Sliding Window Model. CoRR abs/2204.04717 (2022) - 2021
- [j6]Pavel Dvorák, Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak:
The complexity landscape of decompositional parameters for ILP: Programs with few global variables and constraints. Artif. Intell. 300: 103561 (2021) - [j5]Pavel Dvorák, Tomás Valla:
Automorphisms of the cube nd. Discret. Math. 344(3): 112234 (2021) - [j4]Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomás Toufar, Pavel Veselý:
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. SIAM J. Discret. Math. 35(1): 546-574 (2021) - [c22]Pavel Dvorák, Michal Koucký, Karel Král, Veronika Slívová:
Data Structures Lower Bounds and Popular Conjectures. ESA 2021: 39:1-39:15 - [c21]Stepan Jezek, Martin Jonak, Radim Burget, Pavel Dvorak, Milos Skotak:
Deep learning-based defect detection of metal parts: evaluating current methods in complex conditions. ICUMT 2021: 66-71 - [c20]Pavel Dvorák, Michal Koucký:
Barrington Plays Cards: The Complexity of Card-Based Protocols. STACS 2021: 26:1-26:17 - [c19]Václav Blazej, Pavel Dvorák, Michal Opler:
Bears with Hats and Independence Polynomials. WG 2021: 283-295 - [i12]Pavel Dvorák, Michal Koucký, Karel Král, Veronika Slívová:
Data Structures Lower Bounds and Popular Conjectures. CoRR abs/2102.09294 (2021) - [i11]Václav Blazej, Pavel Dvorák, Michal Opler:
Bears with Hats and Independence Polynomials. CoRR abs/2103.07401 (2021) - 2020
- [c18]Pavel Dvorák, Bruno Loff:
Lower Bounds for Semi-adaptive Data Structures via Corruption. FSTTCS 2020: 20:1-20:15 - [c17]Pavel Dvorák, Andreas Emil Feldmann, Ashutosh Rai, Pawel Rzazewski:
Parameterized Inapproximability of Independent Set in H-Free Graphs. WG 2020: 40-53 - [i10]Pavel Dvorák, Bruno Loff:
Lower Bounds for Semi-adaptive Data Structures via Corruption. CoRR abs/2005.02238 (2020) - [i9]Pavel Dvorák, Andreas Emil Feldmann, Ashutosh Rai, Pawel Rzazewski:
Parameterized Inapproximability of Independent Set in H-Free Graphs. CoRR abs/2006.10444 (2020) - [i8]Pavel Dvorák, Michal Koucký:
Barrington Plays Cards: The Complexity of Card-based Protocols. CoRR abs/2010.08445 (2020)
2010 – 2019
- 2019
- [c16]Václav Blazej, Pavel Dvorák, Tomás Valla:
On Induced Online Ramsey Number of Paths, Cycles, and Trees. CSR 2019: 60-69 - [i7]Václav Blazej, Pavel Dvorák, Tomás Valla:
On Induced Online Ramsey Number of Paths, Cycles, and Trees. CoRR abs/1901.03671 (2019) - 2018
- [j3]Pavel Dvorák, Dusan Knop:
Parameterized Complexity of Length-bounded Cuts and Multicuts. Algorithmica 80(12): 3597-3617 (2018) - [c15]Pavel Dvorák, Dusan Knop, Tomás Toufar:
Target Set Selection in Dense Graph Classes. ISAAC 2018: 18:1-18:13 - [c14]Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomas Toufar, Pavel Veselý:
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. STACS 2018: 26:1-26:15 - 2017
- [c13]Pavel Dvorak, Radovan Josth, Elisabetta Delponte:
Object State Recognition for Automatic AR-Based Maintenance Guidance. CVPR Workshops 2017: 1244-1250 - [c12]Pavel Dvorák, Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak:
Solving Integer Linear Programs with a Small Number of Global Variables and Constraints. IJCAI 2017: 607-613 - [c11]Arkadev Chattopadhyay, Pavel Dvorák, Michal Koucký, Bruno Loff, Sagnik Mukhopadhyay:
Lower Bounds for Elimination via Weak Regularity. STACS 2017: 21:1-21:14 - [c10]Krystof Zeman, Martin Stusek, Jirí Pokorný, Pavel Masek, Jiri Hosek, Sergey Andreev, Pavel Dvorak, Radovan Josth:
Emerging 5G applications over mmWave: Hands-on assessment of WiGig radios. TSP 2017: 86-90 - [i6]Pavel Dvorák, Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak:
Solving Integer Linear Programs with a Small Number of Global Variables and Constraints. CoRR abs/1706.06084 (2017) - [i5]Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomás Toufar, Pavel Veselý:
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. CoRR abs/1710.00668 (2017) - 2016
- [c9]Pavel Dvorák, Tomás Valla:
Automorphisms of the Cube n^d. COCOON 2016: 405-416 - [c8]Krystof Zeman, Pavel Masek, Jiri Hosek, Pavel Dvorak, Radovan Josth, Tomas Jankech:
Experimental evaluation of technology enablers for cutting edge wearables' applications. ICUMT 2016: 89-93 - [c7]Pavel Dvorák, Dusan Knop, Tomás Masarík:
Anti-Path Cover on Sparse Graph Classes. MEMICS 2016: 82-86 - [i4]Pavel Dvorák, Tomás Valla:
Automorphisms of the Cube nd. CoRR abs/1610.05498 (2016) - [i3]Pavel Dvorák, Dusan Knop, Tomás Toufar:
Target Set Selection in Dense Graph Classes. CoRR abs/1610.07530 (2016) - [i2]Arkadev Chattopadhyay, Pavel Dvorák, Michal Koucký, Bruno Loff, Sagnik Mukhopadhyay:
Lower Bounds for Elimination via Weak Regularity. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [b1]Pavel Dvorák:
Detekce a segmentace mozkového nádoru v multisekvenčním MRI ; Brain Tumor Detection and Segmentation in Multisequence MRI. Brno University of Technology, Czech Republic, 2015 - [j2]Pavel Dvorák, Tomás Valla:
On the Computational Complexity and Strategies of Online Ramsey Theory. Electron. Notes Discret. Math. 49: 729-736 (2015) - [c6]Pavel Dvorák, Bjoern H. Menze:
Local Structure Prediction with Convolutional Neural Networks for Multimodal Brain Tumor Segmentation. MCV@MICCAI 2015: 59-71 - [c5]Pavel Dvorak, Dusan Knop:
Parametrized Complexity of Length-Bounded Cuts and Multi-cuts. TAMC 2015: 441-452 - [c4]Pavel Dvorak, Karel Bartusek, Jan Mikulka:
Tissue segmentation of brain MRI. TSP 2015: 735-738 - [i1]Dusan Knop, Pavel Dvorak:
Parameterized complexity of length-bounded cuts and multi-cuts. CoRR abs/1511.02801 (2015) - 2014
- [c3]Pavel Dvorak, Karel Bartusek:
Fully Automatic 3D Glioma Extraction in Multi-contrast MRI. ICIAR (2) 2014: 239-246 - [c2]Pavel Dvorák, Karel Bartusek:
Brain tumor locating in 3D MR volume using symmetry. Image Processing 2014: 903432 - 2013
- [j1]Radek Benes, Pavel Dvorak, Marcos Faúndez-Zanuy, Virginia Espinosa-Duro, Jirí Mekyska:
Multi-focus thermal image fusion. Pattern Recognit. Lett. 34(5): 536-544 (2013) - [c1]Pavel Dvorak, Walter G. Kropatsch, Karel Bartusek:
Automatic detection of brain tumors in MR images. TSP 2013: 577-580
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-28 21:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
