Pages that link to "Item:Q2464318"

The following pages link to Parameterized complexity of Vertex Cover variants (Q2464318):

Displaying 34 items.

• Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs (Q260267) (← links)
• Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem (Q444386) (← links)
• Incremental problems in the parameterized complexity setting (Q519883) (← links)
• Vertex cover problem parameterized above and below tight bounds (Q633768) (← links)
• Implicit branching and parameterized partial cover problems (Q657922) (← links)
• Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover (Q714786) (← links)
• Efficient algorithms for network localization using cores of underlying graphs (Q742409) (← links)
• Parameterized algorithm for eternal vertex cover (Q765521) (← links)
• Connected vertex covers in dense graphs (Q974753) (← links)
• Parameterized measure \& conquer for problems with no small kernels (Q1759684) (← links)
• Subexponential algorithms for partial cover problems (Q1944141) (← links)
• Partial vertex cover on graphs of bounded degeneracy (Q2097233) (← links)
• Combinatorial voter control in elections (Q2346381) (← links)
• Parameterized algorithms for graph partitioning problems (Q2408556) (← links)
• On the \(k\)-edge-incident subgraph problem and its variants (Q2446891) (← links)
• An improved parameterized algorithm for the independent feedback vertex set problem (Q2447761) (← links)
• Exact algorithms for problems related to the densest \(k\)-set problem (Q2448865) (← links)
• Computing densest \(k\)-subgraph with structural parameters (Q2680362) (← links)
• Maximizing coverage while ensuring fairness: a tale of conflicting objectives (Q2701386) (← links)
• Parameterized exact and approximation algorithms for maximum<i>k</i>-set cover and related satisfiability problems (Q2956881) (← links)
• Improved Approximations for Hard Optimization Problems via Problem Instance Classification (Q3003467) (← links)
• Enumerate and Measure: Improving Parameter Budget Management (Q3058690) (← links)
• Parameterized Power Vertex Cover (Q3181050) (← links)
• Capacitated Domination and Covering: A Parameterized Perspective (Q3503580) (← links)
• Connected Vertex Covers in Dense Graphs (Q3541785) (← links)
• Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
• Genomic Scaffold Filling: A Progress Report (Q4632164) (← links)
• Algorithmic Applications of Tree-Cut Width (Q5048301) (← links)
• Parameterized Complexity for Domination Problems on Degenerate Graphs (Q5302055) (← links)
• Parameterized algorithms for finding highly connected solution (Q5918560) (← links)
• Parameterized algorithms for finding highly connected solution (Q5970787) (← links)
• Further Exploiting <i>c</i>-Closure for FPT Algorithms and Kernels for Domination Problems (Q6071818) (← links)
• Disentangling the computational complexity of network untangling (Q6151149) (← links)
• FPT approximation and subexponential algorithms for covering few or many edges (Q6195348) (← links)