Pages that link to "Item:Q958211"

The following pages link to Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles (Q958211):

Displaying 50 items.

• The kernelization complexity of connected domination in graphs with (no) small cycles (Q476436) (← links)
• Improved kernel results for some FPT problems based on simple observations (Q507431) (← links)
• On the small cycle transversal of planar graphs (Q551170) (← links)
• Guard games on graphs: keep the intruder out! (Q650877) (← links)
• Parameterized algorithm for eternal vertex cover (Q765521) (← links)
• The parameterized complexity of the induced matching problem (Q1028465) (← links)
• Multivariate complexity analysis of geometric \textsc{Red Blue Set Cover} (Q1679222) (← links)
• The complexity of dominating set in geometric intersection graphs (Q1737591) (← links)
• FPT algorithms for domination in sparse graphs and beyond (Q1740694) (← links)
• Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs (Q1755775) (← links)
• Approximation in (Poly-) logarithmic space (Q2037114) (← links)
• Algorithmic aspects of 2-secure domination in graphs (Q2045038) (← links)
• Revising Johnson's table for the 21st century (Q2091799) (← links)
• Twin-width and polynomial kernels (Q2093574) (← links)
• Parameterized algorithms for Steiner tree and dominating set: bounding the leafage by the vertex leafage (Q2154102) (← links)
• Parameterized complexity of minimum membership dominating set (Q2154108) (← links)
• Induced star partition of graphs (Q2161236) (← links)
• On the tractability of optimization problems on \(H\)-graphs (Q2196605) (← links)
• Pursuing a fast robber on a graph (Q2268876) (← links)
• On the parameterized complexity of \([1,j]\)-domination problems (Q2283043) (← links)
• On the complexity of various parameterizations of common induced subgraph isomorphism (Q2405897) (← links)
• Parameterized and exact algorithms for class domination coloring (Q2659082) (← links)
• Vertex Cover, Dominating Set and My Encounters with Parameterized Complexity and Mike Fellows (Q2908533) (← links)
• Parameterized and Exact Algorithms for Class Domination Coloring (Q2971145) (← links)
• On the Small Cycle Transversal of Planar Graphs (Q3057617) (← links)
• Smaller Kernels for Several FPT Problems Based on Simple Observations (Q3452562) (← links)
• Capacitated Domination and Covering: A Parameterized Perspective (Q3503580) (← links)
• Kernelization of Two Path Searching Problems on Split Graphs (Q4632190) (← links)
• Algorithmic complexity of secure connected domination in graphs (Q4956219) (← links)
• (Q5002730) (← links)
• (Q5009589) (← links)
• Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems (Q5048305) (← links)
• Approximation in (Poly-) Logarithmic Space (Q5089177) (← links)
• On the Parameterized Complexity of [1,j]-Domination Problems (Q5090974) (← links)
• Finding Cliques in Social Networks: A New Distribution-Free Model (Q5112249) (← links)
• Perfect domination and small cycles (Q5367522) (← links)
• Parameterized Algorithms for Generalized Domination (Q5505650) (← links)
• Exploiting c-Closure in Kernelization Algorithms for Graph Problems (Q5874537) (← links)
• Parameterized complexity of conflict-free set cover (Q5918356) (← links)
• Parameterized complexity of geometric covering problems having conflicts (Q5919304) (← links)
• (Q6065417) (← links)
• Further Exploiting <i>c</i>-Closure for FPT Algorithms and Kernels for Domination Problems (Q6071818) (← links)
• Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond (Q6083603) (← links)
• Parameterized complexity of minimum membership dominating set (Q6090540) (← links)
• Essentially tight kernels for (weakly) closed graphs (Q6103524) (← links)
• Computing dense and sparse subgraphs of weakly closed graphs (Q6107896) (← links)
• On convexity in split graphs: complexity of Steiner tree and domination (Q6123388) (← links)
• Star covers and star partitions of double-split graphs (Q6124494) (← links)
• Grouped domination parameterized by vertex cover, twin cover, and beyond (Q6131196) (← links)
• On star partition of split graphs (Q6547833) (← links)