scientific article; zbMATH DE number 7378370

DOI10.4230/LIPIcs.MFCS.2018.53MaRDI QIDQ5005155

Saket Saurabh, Daniel Lokshtanov, Pallavi Jain, Akanksha Agrawal, Lawqueen Kanesh

Publication date: 4 August 2021

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

feedback vertex setFPT algorithmW[1-hardness]conflict-free

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (3)

Parameterized complexity of conflict-free matchings and paths ⋮ Unnamed Item ⋮ Parameterized complexity of conflict-free set cover

Cites Work

• Unnamed Item
• On parameterized independent feedback vertex set
• Finding odd cycle transversals.
• Interval scheduling and colorful independent sets
• Improved algorithms for feedback vertex set problems
• On the parameterized complexity of multiple-interval graph problems
• On the number of edges of quadrilateral-free graphs
• Faster deterministic \textsc{Feedback Vertex Set}
• Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review
• A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion
• FPT Algorithms for Domination in Biclique-Free Graphs
• Dual Connectedness of Edge-Bicolored Graphs and Beyond
• FPT Algorithms for Connected Feedback Vertex Set
• Simultaneous Feedback Vertex Set: A Parameterized Perspective
• Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set
• Parameterized Algorithms
• Conflict free version of covering problems on graphs: classical and parameterized

This page was built for publication: