Pages that link to "Item:Q1740694"
From MaRDI portal
The following pages link to FPT algorithms for domination in sparse graphs and beyond (Q1740694):
Displaying 13 items.
- Sparse dominance queries for many points in optimal time and space (Q293151) (← links)
- Dominating set is fixed parameter tractable in claw-free graphs (Q650938) (← links)
- Constant-factor approximation of the domination number in sparse graphs (Q1943391) (← links)
- Twin-width and polynomial kernels (Q2093574) (← links)
- FPT algorithms to compute the elimination distance to bipartite graphs and more (Q2672425) (← links)
- Spy game: FPT-algorithm, hardness and graph products (Q2672629) (← links)
- Domination problems in nowhere-dense classes of graphs (Q2920123) (← links)
- FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs (Q3503584) (← links)
- Harary polynomials (Q5056203) (← links)
- Operator-free sparse domination (Q5066135) (← links)
- (Q5150524) (← links)
- An FPT Algorithm for Minimum Additive Spanner Problem. (Q5874282) (← links)
- Max-SAT with cardinality constraint parameterized by the number of clauses (Q6547959) (← links)