Pages that link to "Item:Q2912896"
From MaRDI portal
The following pages link to FPT Algorithms for Domination in Biclique-Free Graphs (Q2912896):
Displaying 15 items.
- Reconfiguration on sparse graphs (Q1747496) (← links)
- On the parameterized complexity of \([1,j]\)-domination problems (Q2283043) (← links)
- FPT algorithms to compute the elimination distance to bipartite graphs and more (Q2672425) (← links)
- Grundy Coloring and friends, half-graphs, bicliques (Q2700380) (← links)
- FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs (Q3503584) (← links)
- (Q5005155) (← links)
- Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems (Q5048305) (← links)
- (Q5090476) (← links)
- On the Parameterized Complexity of [1,j]-Domination Problems (Q5090974) (← links)
- Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q5234662) (← links)
- Exploiting c-Closure in Kernelization Algorithms for Graph Problems (Q5874537) (← links)
- k-Efficient domination: Algorithmic perspective (Q6115759) (← links)
- Impact of diameter and convex ordering for Hamiltonicity and domination (Q6547831) (← links)
- On finding short reconfiguration sequences between independent sets (Q6627042) (← links)
- A closer look at Hamiltonicity and domination through the lens of diameter and convexity (Q6634506) (← links)
