Deconstructing parameterized hardness of Fair Vertex Deletion problems
From MaRDI portal
Recommendations
Cited in
(7)- Local linear set on graphs with bounded twin cover number
- Parameterized complexity of fair feedback vertex set problem
- Multivariate complexity analyses for algorithmic challenges in fairness and sustainability
- Parameterized Complexity of Fair Feedback Vertex Set Problem
- The structural complexity landscape of finding balance-fair shortest paths
- Fixed-parameter algorithms for fair hitting set problems
- Parameterized complexity of fair vertex evaluation problems
This page was built for publication: Deconstructing parameterized hardness of Fair Vertex Deletion problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2300050)