Subexponential parameterized odd cycle transversal on planar graphs
From MaRDI portal
Recommendations
Cited in
(27)- Optimizing adiabatic quantum program compilation using a graph-theoretic framework
- Faster graph bipartization
- Linear kernels for outbranching problems in sparse digraphs
- Parameterized complexity dichotomy for \((r, \ell)\)-\textsc{Vertex Deletion}
- On polynomial kernels for structural parameterizations of odd cycle transversal
- Simpler parameterized algorithm for OCT
- Parameterized approximation algorithms for bidirected Steiner network problems
- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths
- Four Shorts Stories on Surprising Algorithmic Uses of Treewidth
- A subexponential parameterized algorithm for directed subset traveling salesman problem on planar graphs
- Almost tight lower bounds for hard cutting problems in embedded graphs
- An Updated Experimental Evaluation of Graph Bipartization Methods
- A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs
- Tight bounds for planar strongly connected Steiner subgraph with fixed number of terminals (and extensions)
- Hitting selected (odd) cycles
- scientific article; zbMATH DE number 6297714 (Why is no real title available?)
- Compression via matroids: a randomized polynomial kernel for odd cycle transversal
- Faster algorithms for cycle hitting problems on disk graphs
- A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs
- Maximum bipartite subgraphs of geometric intersection graphs
- Subexponential parameterized directed Steiner network problems on planar graphs: a complete classification
- Multicut problems in embedded graphs: the dependency of complexity on the demand pattern
- Bipartizing (pseudo-)disk graphs: approximation with a ratio better than 3
- Odd cycle transversal on P₅-free graphs in polynomial time
- True contraction decomposition and almost ETH-tight bipartization for unit-disk graphs
- Finding odd cycle transversals.
- Multicut problems in embedded graphs: the dependency of complexity on the demand pattern
This page was built for publication: Subexponential parameterized odd cycle transversal on planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2957518)
