The following pages link to Nidhi Purohit (Q777266):
Displaying 11 items.
- Efficient algorithms for a graph partitioning problem (Q777267) (← links)
- Parameterized complexity of categorical clustering with size constraints (Q832880) (← links)
- Metric dimension parameterized by treewidth (Q2041987) (← links)
- On the complexity of singly connected vertex deletion (Q2089067) (← links)
- Lossy kernelization of same-size clustering (Q2097218) (← links)
- Dynamics of Sirs Model with Single Time Delay (Q4686764) (← links)
- On the Complexity of Singly Connected Vertex Deletion (Q5041193) (← links)
- (Q5875537) (← links)
- Parameterized complexity of categorical clustering with size constraints (Q6098152) (← links)
- How to find a good explanation for clustering? (Q6136087) (← links)
- Lossy kernelization of same-size clustering (Q6174654) (← links)
