The following pages link to Pavel Dvořák (Q322362):
Displaying 20 items.
- On the computational complexity and strategies of online Ramsey theory (Q322363) (← links)
- Parameterized complexity of length-bounded cuts and multicuts (Q1799212) (← links)
- Automorphisms of the cube \(n^d\) (Q2222938) (← links)
- The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints (Q2238737) (← links)
- On induced online Ramsey number of paths, cycles, and trees (Q2330552) (← links)
- Bears with hats and independence polynomials (Q2672444) (← links)
- Automorphisms of the Cube $$n^d$$ (Q2817882) (← links)
- Parametrized Complexity of Length-Bounded Cuts and Multi-cuts (Q2948489) (← links)
- (Q3304124) (← links)
- Lower Bounds for Elimination via Weak Regularity (Q4636619) (← links)
- Target Set Selection in Dense Graph Classes (Q5062113) (← links)
- (Q5091008) (← links)
- Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices (Q5857009) (← links)
- Parameterized inapproximability of independent set in \(H\)-free graphs (Q5918589) (← links)
- Parameterized inapproximability of independent set in \(H\)-free graphs (Q5925689) (← links)
- Data Structures Lower Bounds and Popular Conjectures (Q6075928) (← links)
- Bounds on Functionality and Symmetric Difference -- Two Intriguing Graph Parameters (Q6427376) (← links)
- Bears with hats and independence polynomials (Q6599792) (← links)
- List locally surjective homomorphisms in hereditary graph classes (Q6602450) (← links)
- Improved weighted matching in the sliding window model (Q6615105) (← links)
