Parameterized Complexity and Approximability of Directed Odd Cycle Transversal
From MaRDI portal
Cited in
(34)- To close is easier than to open: dual parameterization to \(k\)-median
- Odd cycle transversal in mixed graphs
- Odd multiway cut in directed acyclic graphs
- Multi-budgeted directed cuts
- Hitting weighted even cycles in planar graphs
- scientific article; zbMATH DE number 7559446 (Why is no real title available?)
- Tight bounds for planar strongly connected Steiner subgraph with fixed number of terminals (and extensions)
- scientific article; zbMATH DE number 6297714 (Why is no real title available?)
- Parameterized algorithms for generalizations of directed feedback vertex set
- Parameterized inapproximability of independent set in \(H\)-free graphs
- Parameterized inapproximability of the minimum distance problem over all fields and the shortest vector problem in all _p norms
- On the parameterized intractability of determinant maximization
- Search-space reduction via essential vertices
- Parameterized inapproximability of the minimum distance problem over all fields and the shortest vector problem in all \(\ell_{p}\) norms
- On the parameterized complexity of deletion to \(\mathcal{H}\)-free strong components
- Complexity theory. Abstracts from the workshop held June 2--7, 2024
- Parameterized inapproximability for Steiner orientation by gap amplification
- Hitting long directed cycles is fixed-parameter tractable
- Flow-augmentation. I: Directed graphs
- Baby PIH: Parameterized inapproximability of min CSP
- Applications of random algebraic constructions to hardness of approximation
- Parameterized inapproximability hypothesis under ETH
- On equivalence of parameterized inapproximability of k-median, k-max-coverage, and 2-CSP
- FPT approximation using treewidth: capacitated vertex cover, target set selection and vector dominating set
- On the parameterized complexity of symmetric directed multicut
- Search-space reduction via essential vertices
- Pliability and approximating Max-CSPs
- On equivalence of parameterized inapproximability of \(k\)-median, \(k\)-max-coverage, and 2-CSP
- Constant approximating disjoint paths on acyclic digraphs is W[1]-hard
- Can you link up with treewidth?
- On average baby PIH and its applications
- Multicut problems in embedded graphs: the dependency of complexity on the demand pattern
- Parameterized approximability for modular linear equations
- Can you link up with treewidth?
This page was built for publication: Parameterized Complexity and Approximability of Directed Odd Cycle Transversal
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146923)
