The following pages link to Diptapriyo Majumdar (Q722548):
Displaying 23 items.
- Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization (Q722549) (← links)
- Structural parameterizations of dominating set variants (Q1625157) (← links)
- On the approximate compressibility of connected vertex cover (Q2006945) (← links)
- Faster FPT algorithms for deletion to pairs of graph classes (Q2140510) (← links)
- Revisiting connected vertex cover: FPT algorithms and lossy kernels (Q2322693) (← links)
- Polynomial kernels for vertex cover parameterized by small degree modulators (Q2322700) (← links)
- Tractability of König edge deletion problems (Q2333799) (← links)
- \(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms (Q2677827) (← links)
- Constrained hitting set problem with intervals (Q2695330) (← links)
- Exact and Parameterized Algorithms for (k, i)-Coloring (Q2971658) (← links)
- Kernelization of Cycle Packing with Relaxed Disjointness Constraints (Q3174716) (← links)
- (Q4598162) (← links)
- FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters (Q4632216) (← links)
- Structural Parameterizations of Feedback Vertex Set (Q4634404) (← links)
- (Q5363786) (← links)
- Parameterized Pre-Coloring Extension and List Coloring Problems (Q5857010) (← links)
- (Q5874290) (← links)
- Parameterized complexity of conflict-free set cover (Q5918356) (← links)
- Parameterized complexity of conflict-free set cover (Q5919684) (← links)
- (Q6089665) (← links)
- Deletion to scattered graph classes. II: Improved FPT algorithms for deletion to pairs of graph classes (Q6098156) (← links)
- Deletion to scattered graph classes. I: Case of finite number of graph classes (Q6133645) (← links)
- Constrained hitting set problem with intervals: hardness, FPT and approximation algorithms (Q6201335) (← links)
