scientific article; zbMATH DE number 7376037

DOI10.4230/LIPIcs.ICALP.2018.110zbMath1499.68284MaRDI QIDQ5002795

Saket Saurabh, Meirav Zehavi, Daniel Lokshtanov, M. S. Ramanujan, Roohani Sharma

Publication date: 28 July 2021

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

zbMATH Keywords

polynomial kerneldirected feedback vertex settreewidth modulator

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parameterized complexity, tractability and kernelization (68Q27)

Cites Work

• Unnamed Item
• Unnamed Item
• A kernelization algorithm for \(d\)-hitting set
• Kernels for deletion to classes of acyclic digraphs
• Polynomial kernels for deletion to classes of acyclic digraphs
• Fixed-parameter tractability results for feedback set problems in tournaments
• On the hardness of losing width
• A fixed-parameter algorithm for the directed feedback vertex set problem
• Fixed-Parameter Tractability and Completeness I: Basic Results

This page was built for publication: