scientific article; zbMATH DE number 7650395

DOI10.4230/LIPICS.ITCS.2020.47MaRDI QIDQ5875748zbMATH OpenFDO

Authors William Lochet, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Roohani Sharma, Meirav Zehavi

Publication date 3 February 2023

Full work available at URL https://doi.org/10.4230/LIPICS.ITCS.2020.47

zbMATH Keywords

bounded independence numberdirected edge odd cycle transversaldirected feedback arc setfault tolerant subgraphskernelizationsparsification

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(8)

• Kernelization of Arc Disjoint Cycle Packing in \alpha -Bounded Digraphs
• Kernelization of arc disjoint cycle packing in -bounded digraphs
• Fault-tolerant total domination via submodular function approximation
• Quick-sort style approximation algorithms for generalizations of feedback vertex set in tournaments
• Decremental sensitivity oracles for covering and packing minors
• Towards transitive-free digraphs
• Wannabe bounded treewidth graphs admit a polynomial kernel for directed feedback vertex set
• Reachability in temporal graphs under perturbation

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875748)