Pages that link to "Item:Q2904546"
From MaRDI portal
The following pages link to Deterministic Parameterized Connected Vertex Cover (Q2904546):
Displaying 24 items.
- On the parameterized complexity of vertex cover and edge cover with connectivity constraints (Q482281) (← links)
- Parameterized algorithm for eternal vertex cover (Q765521) (← links)
- Enumeration and maximum number of minimal connected vertex covers in graphs (Q1678095) (← links)
- Parameterized approximation via fidelity preserving transformations (Q1686226) (← links)
- On the parameterized complexity of contraction to generalization of trees (Q2000005) (← links)
- Extension and its price for the connected vertex cover problem (Q2072064) (← links)
- Parameterized complexity of multi-node hubs (Q2084737) (← links)
- Twin-width and polynomial kernels (Q2093574) (← links)
- Reoptimization of parameterized problems (Q2170282) (← links)
- Complexity of independency and cliquy trees (Q2283099) (← links)
- Approximation algorithms for connected maximum cut and related problems (Q2304552) (← links)
- Revisiting connected vertex cover: FPT algorithms and lossy kernels (Q2322693) (← links)
- A multivariate framework for weighted FPT algorithms (Q2402359) (← links)
- Contracting graphs to paths and trees (Q2441588) (← links)
- \(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms (Q2677827) (← links)
- Circumventing connectivity for kernelization (Q2692730) (← links)
- Parameterized Power Vertex Cover (Q3181050) (← links)
- A Multivariate Approach for Weighted FPT Algorithms (Q3452855) (← links)
- Connected Vertex Covers in Dense Graphs (Q3541785) (← links)
- Graph Layout Problems Parameterized by Vertex Cover (Q3596727) (← links)
- On the Parameterized Complexity of Contraction to Generalization of Trees. (Q5111860) (← links)
- Computing connected-\(k\)-subgraph cover with connectivity requirement (Q6111948) (← links)
- Matroid-constrained vertex cover (Q6162073) (← links)
- Approximation algorithm and FPT algorithm for connected-\(k\)-subgraph cover on minor-free graphs (Q6620013) (← links)
