Pavel Dvorák

Orcid: 0000-0002-6838-1538

Affiliations:
  • Charles University, Prague, Czech Republic


According to our database1, Pavel Dvorák authored at least 37 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Exponential Separation Between Powers of Regular and General Resolution Over Parities.
Electron. Colloquium Comput. Complex., 2024

2023
Parameterized Inapproximability of Independent Set in H-Free Graphs.
Algorithmica, April, 2023

SEVA 4.0: an update of the Standard European Vector Architecture database for advanced analysis and programming of bacterial phenotypes.
Nucleic Acids Res., January, 2023

Bounds on Functionality and Symmetric Difference - Two Intriguing Graph Parameters.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

Improved Weighted Matching in the Sliding Window Model.
Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

2022
Target Set Selection in Dense Graph Classes.
SIAM J. Discret. Math., 2022

Closing the Gap between Weighted and Unweighted Matching in the Sliding Window Model.
CoRR, 2022

List Locally Surjective Homomorphisms in Hereditary Graph Classes.
Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

Anomaly detection for real-world industrial applications: benchmarking recent self-supervised and pretrained methods.
Proceedings of the 14th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 2022

2021
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices.
SIAM J. Discret. Math., 2021

Automorphisms of the cube nd.
Discret. Math., 2021

The complexity landscape of decompositional parameters for ILP: Programs with few global variables and constraints.
Artif. Intell., 2021

Bears with Hats and Independence Polynomials.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

Barrington Plays Cards: The Complexity of Card-Based Protocols.
Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

Deep learning-based defect detection of metal parts: evaluating current methods in complex conditions.
Proceedings of the 13th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 2021

Data Structures Lower Bounds and Popular Conjectures.
Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020
Lower Bounds for Semi-adaptive Data Structures via Corruption.
Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

2019
On Induced Online Ramsey Number of Paths, Cycles, and Trees.
Proceedings of the Computer Science - Theory and Applications, 2019

2018
Parameterized Complexity of Length-bounded Cuts and Multicuts.
Algorithmica, 2018

2017
Emerging 5G applications over mmWave: Hands-on assessment of WiGig radios.
Proceedings of the 40th International Conference on Telecommunications and Signal Processing, 2017

Solving Integer Linear Programs with a Small Number of Global Variables and Constraints.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Object State Recognition for Automatic AR-Based Maintenance Guidance.
Proceedings of the 2017 IEEE Conference on Computer Vision and Pattern Recognition Workshops, 2017

2016
Lower Bounds for Elimination via Weak Regularity.
Electron. Colloquium Comput. Complex., 2016

Automorphisms of the Cube n<sup>d</sup>.
CoRR, 2016

Anti-Path Cover on Sparse Graph Classes.
Proceedings of the Proceedings 11th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, 2016

Experimental evaluation of technology enablers for cutting edge wearables' applications.
Proceedings of the 8th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 2016

Automorphisms of the Cube n^d.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015
Detekce a segmentace mozkového nádoru v multisekvenčním MRI ; Brain Tumor Detection and Segmentation in Multisequence MRI.
PhD thesis, 2015

On the Computational Complexity and Strategies of Online Ramsey Theory.
Electron. Notes Discret. Math., 2015

Parameterized complexity of length-bounded cuts and multi-cuts.
CoRR, 2015

Tissue segmentation of brain MRI.
Proceedings of the 38th International Conference on Telecommunications and Signal Processing, 2015

Parametrized Complexity of Length-Bounded Cuts and Multi-cuts.
Proceedings of the Theory and Applications of Models of Computation, 2015

Local Structure Prediction with Convolutional Neural Networks for Multimodal Brain Tumor Segmentation.
Proceedings of the Medical Computer Vision: Algorithms for Big Data, 2015

2014
Brain tumor locating in 3D MR volume using symmetry.
Proceedings of the Medical Imaging 2014: Image Processing, 2014

Fully Automatic 3D Glioma Extraction in Multi-contrast MRI.
Proceedings of the Image Analysis and Recognition - 11th International Conference, 2014

2013
Multi-focus thermal image fusion.
Pattern Recognit. Lett., 2013

Automatic detection of brain tumors in MR images.
Proceedings of the 36th International Conference on Telecommunications and Signal Processing, 2013


  Loading...