Pages that link to "Item:Q1270821"
From MaRDI portal
The following pages link to A unified approximation algorithm for node-deletion problems (Q1270821):
Displaying 40 items.
- Approximation algorithms for minimum (weight) connected \(k\)-path vertex cover (Q266943) (← links)
- On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion (Q491619) (← links)
- PTAS for minimum \(k\)-path vertex cover in ball graph (Q503602) (← links)
- Combination of parallel machine scheduling and vertex cover (Q690471) (← links)
- Rank reduction of oriented graphs by vertex and edge deletions (Q722520) (← links)
- Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization (Q722549) (← links)
- Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties (Q955347) (← links)
- A new approach for approximating node deletion problems (Q1029021) (← links)
- Moderately exponential time algorithms for the maximum bounded-degree-1 set problem (Q1627852) (← links)
- PTAS for \(\mathcal{H}\)-free node deletion problems in disk graphs (Q1706122) (← links)
- Approximation algorithm for minimum connected 3-path vertex cover (Q2004079) (← links)
- Approximation algorithms for minimum weight connected 3-path vertex cover (Q2008557) (← links)
- A polynomial kernel for bipartite permutation vertex deletion (Q2093571) (← links)
- Approximation algorithm for (connected) bounded-degree deletion problem on unit disk graphs (Q2193275) (← links)
- Approximation algorithm for minimum weight connected-\(k\)-subgraph cover (Q2197543) (← links)
- Kernels for packing and covering problems (Q2272393) (← links)
- Algorithm for online 3-path vertex cover (Q2300630) (← links)
- Computational complexity of minimum \(P_4\) vertex cover problem for regular and \(K_{1, 4}\)-free graphs (Q2341756) (← links)
- Faster parameterized algorithms for deletion to split graphs (Q2350905) (← links)
- Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization (Q2437764) (← links)
- Approximation algorithm for the minimum weight connected \(k\)-subgraph cover problem (Q2447765) (← links)
- Further parameterized algorithms for the \(\mathcal{F}\)-free edge deletion problem (Q2676471) (← links)
- Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs (Q3082947) (← links)
- Vertex Cover Structural Parameterization Revisited (Q3181056) (← links)
- Approximating Node-Deletion Problems for Matroidal Properties (Q4240133) (← links)
- A primal-dual approach to approximation of node-deletion problems for matroidal properties (Q4572003) (← links)
- A unified local ratio approximation of node-deletion problems (Q4595485) (← links)
- (Q5075776) (← links)
- (Q5225203) (← links)
- Approximating Partially Bounded Degree Deletion on Directed Graphs (Q5240368) (← links)
- Approximating Bounded Degree Deletion via Matroid Matching (Q5283370) (← links)
- Node-and edge-deletion NP-complete problems (Q5402565) (← links)
- Combining the Delete Relaxation with Critical-Path Heuristics: A Direct Characterization (Q5739833) (← links)
- Quadratic vertex kernel for split vertex deletion (Q5896158) (← links)
- Conflict free version of covering problems on graphs: classical and parameterized (Q5918906) (← links)
- Graph orientation with splits (Q5918973) (← links)
- Approximating power node-deletion problems (Q6057334) (← links)
- Polynomial Kernel for Interval Vertex Deletion (Q6075746) (← links)
- Parameterized complexity of the \(\mathcal{T}_{h+1} \)-free edge deletion problem (Q6546594) (← links)
- Approximating power node-deletion problems (Q6593676) (← links)
