Pavel Dvořák

From MaRDI portal
(Redirected from Person:322362)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Improved weighted matching in the sliding window model2024-10-08Paper
List locally surjective homomorphisms in hereditary graph classes2024-09-11Paper
Bears with hats and independence polynomials
Discrete Mathematics and Theoretical Computer Science. DMTCS
2024-09-06Paper
Data Structures Lower Bounds and Popular Conjectures
(available as arXiv preprint)
2023-09-20Paper
Parameterized inapproximability of independent set in \(H\)-free graphs
Algorithmica
2023-04-11Paper
Bounds on Functionality and Symmetric Difference -- Two Intriguing Graph Parameters2023-02-23Paper
Parameterized inapproximability of independent set in \(H\)-free graphs
Graph-Theoretic Concepts in Computer Science
2022-12-21Paper
scientific article; zbMATH DE number 7561372 (Why is no real title available?)2022-07-21Paper
Bears with hats and independence polynomials
(available as arXiv preprint)
2022-06-08Paper
Target Set Selection in Dense Graph Classes
SIAM Journal on Discrete Mathematics
2022-03-15Paper
The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints
Artificial Intelligence
2021-11-02Paper
Parameterized approximation schemes for Steiner trees with small number of Steiner vertices
SIAM Journal on Discrete Mathematics
2021-03-30Paper
Automorphisms of the cube \(n^d\)
Discrete Mathematics
2021-01-27Paper
Parameterized approximation schemes for Steiner trees with small number of Steiner vertices
(available as arXiv preprint)
2020-08-05Paper
On induced online Ramsey number of paths, cycles, and trees
(available as arXiv preprint)
2019-10-22Paper
On Induced Online Ramsey Number of Paths, Cycles, and Trees
arXiv preprint
2019-01-11Paper
Parameterized complexity of length-bounded cuts and multicuts
Algorithmica
2018-10-18Paper
Lower bounds for elimination via weak regularity2018-04-19Paper
On the computational complexity and strategies of online Ramsey theory2016-10-14Paper
Automorphisms of the cube \(n^d\)
Lecture Notes in Computer Science
2016-09-02Paper
Parametrized complexity of length-bounded cuts and multi-cuts
Lecture Notes in Computer Science
2015-09-30Paper


Research outcomes over time


This page was built for person: Pavel Dvořák