The following pages link to Lawqueen Kanesh (Q1625164):
Displaying 21 items.
- Hitting and covering partially (Q1791047) (← links)
- Paths to trees and cacti (Q1998842) (← links)
- On the complexity of singly connected vertex deletion (Q2089067) (← links)
- A polynomial kernel for bipartite permutation vertex deletion (Q2093571) (← links)
- Parameterized complexity of conflict-free matchings and paths (Q2182094) (← links)
- Parameterized complexity of fair feedback vertex set problem (Q2663038) (← links)
- Odd cycle transversal in mixed graphs (Q2672431) (← links)
- Circumventing connectivity for kernelization (Q2692730) (← links)
- (Q5005155) (← links)
- Exploring the Kernelization Borders for Hitting Cycles (Q5009476) (← links)
- On the Complexity of Singly Connected Vertex Deletion (Q5041193) (← links)
- Parameterized Complexity of Fair Feedback Vertex Set Problem (Q5042245) (← links)
- A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs (Q5071096) (← links)
- (Q5092396) (← links)
- Paths to Trees and Cacti (Q5283353) (← links)
- Exact and Approximate Digraph Bandwidth (Q5875651) (← links)
- Conflict free version of covering problems on graphs: classical and parameterized (Q5915577) (← links)
- Conflict free version of covering problems on graphs: classical and parameterized (Q5918906) (← links)
- Further Exploiting <i>c</i>-Closure for FPT Algorithms and Kernels for Domination Problems (Q6071818) (← links)
- (Q6192491) (← links)
- Further exploiting \(c\)-closure for FPT algorithms and kernels for domination problems (Q6490985) (← links)
