The following pages link to Sanjukta Roy (Q681850):
Displaying 8 items.
- Stable matching games: manipulation via subgraph isomorphism (Q722540) (← links)
- Parameterized algorithms for stable matching with ties and incomplete lists (Q1708024) (← links)
- Parameterized algorithms and kernels for rainbow matching (Q1739114) (← links)
- Resolute control: forbidding candidates from winning an election is hard (Q2143123) (← links)
- Quadratic vertex kernel for rainbow matching (Q2300725) (← links)
- Balanced stable marriage: how close is close enough? (Q5918373) (← links)
- Further exploiting \(c\)-closure for FPT algorithms and kernels for domination problems (Q6490985) (← links)
- Degreewidth: A New Parameter for Solving Problems on Tournaments (Q6496550) (← links)