Deconstructing parameterized hardness of Fair Vertex Deletion problems

DOI10.1007/978-3-030-26176-4_27MaRDI QIDQ2300050zbMATH OpenOpenAlexFDO

Authors Ashwin Jacob, Venkatesh Raman, Vibha Sahlot

Publication date 24 February 2020

Full work available at URL https://doi.org/10.1007/978-3-030-26176-4_27

zbMATH Keywords

kernelizationparameterized complexityVertex Deletion problemsW-hardness

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Recommendations

• Parameterized complexity of fair feedback vertex set problem
• Parameterized complexity of fair vertex evaluation problems
• Simultaneous feedback vertex set: a parameterized perspective

Cited in

(8)

• Local linear set on graphs with bounded twin cover number
• Parameterized complexity of fair feedback vertex set problem
• The structural complexity landscape of finding balance-fair shortest paths
• Parameterized Complexity of Fair Feedback Vertex Set Problem
• Parameterized complexity of fair vertex evaluation problems
• Multivariate complexity analyses for algorithmic challenges in fairness and sustainability
• Fixed-parameter algorithms for fair hitting set problems
• On sparse hitting sets: from fair vertex cover to highway dimension

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)