Finding odd cycle transversals.
From MaRDI portal
Recommendations
Cites work
Cited in
(only showing first 100 items - show all)- Another disjoint compression algorithm for odd cycle transversal
- On parameterized independent feedback vertex set
- Parameterized complexity of finding regular induced subgraphs
- Separator-based data reduction for signed graph balancing
- Confronting intractability via parameters
- On the complexity of singly connected vertex deletion
- Backdoors to satisfaction
- On feedback vertex set: new measure and new structures
- Almost 2-SAT is fixed-parameter tractable
- Faster deterministic \textsc{Feedback Vertex Set}
- An improved parameterized algorithm for the independent feedback vertex set problem
- Augmenting tractable fragments of abstract argumentation
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs
- Parameterized complexity of vertex deletion into perfect graph classes
- Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization
- Slightly superexponential parameterized problems
- Reducing rank of the adjacency matrix by graph modification
- Fixed-parameter algorithms in analysis of heuristics for extracting networks in linear programs
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
- Feedback vertex sets in tournaments
- Erdős-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing
- A note on the parameterized complexity of unordered maximum tree orientation
- Iterative compression and exact algorithms
- Efficient algorithms for counting parameterized list \(H\)-colorings
- Constant ratio fixed-parameter approximation of the edge multicut problem
- Parameterized complexity of independent set in H-free graphs
- The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number
- On the parameterized vertex cover problem for graphs with perfect matching
- FPT algorithms for path-transversal and cycle-transversal problems
- Fixed-Parameter Algorithms for Cluster Vertex Deletion
- Clique Cover and Graph Separation
- Tournaments and Semicomplete Digraphs
- On the Complexity of Singly Connected Vertex Deletion
- A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem
- Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems
- Approximate min-max relations for odd cycles in planar graphs
- Edge bipartization faster than \(2^k\)
- Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover
- A fixed-parameter algorithm for the vertex cover \(P_3\) problem
- An FPT algorithm for the vertex cover \(P_4\) problem
- A fast branching algorithm for cluster vertex deletion
- Faster graph bipartization
- scientific article; zbMATH DE number 7650095 (Why is no real title available?)
- Simpler parameterized algorithm for OCT
- Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion
- Obtaining a planar graph by vertex deletion
- Reoptimization of parameterized problems
- Parameterized coloring problems on chordal graphs
- Approximability of clique transversal in perfect graphs
- Parameterized complexity of finding connected induced subgraphs
- Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs
- Conflict free version of covering problems on graphs: classical and parameterized
- Sharp separation and applications to exact and parameterized algorithms
- Designing FPT algorithms for cut problems using randomized contractions
- Chordal deletion is fixed-parameter tractable
- Optimizing adiabatic quantum program compilation using a graph-theoretic framework
- Iterative Compression for Exactly Solving NP-Hard Minimization Problems
- Compression via matroids: a randomized polynomial kernel for odd cycle transversal
- A basic parameterized complexity primer
- Parity linkage and the Erdős-Pósa property of odd cycles through prescribed vertices in highly connected graphs
- Studies in Computational Aspects of Voting
- Important separators and parameterized algorithms
- Fixed-parameter algorithms for cluster vertex deletion
- On polynomial kernels for structural parameterizations of odd cycle transversal
- Improved kernel results for some FPT problems based on simple observations
- The complexity of König subgraph problems and above-guarantee vertex cover
- Measuring indifference: unit interval vertex deletion
- Parameterizing above or below guaranteed values
- What's next? Future directions in parameterized complexity
- Clique cycle-transversals in distance-hereditary graphs
- Improved algorithms for feedback vertex set problems
- Chordal editing is fixed-parameter tractable
- Planar graph bipartization in linear time
- Paths to trees and cacti
- A constant-factor approximation for weighted bond cover
- Fast FPT-approximation of branchwidth
- Parameterized complexity of vertex deletion into perfect graph classes
- Streaming deletion problems parameterized by vertex cover
- Parameterized complexity dichotomy for \((r, \ell)\)-\textsc{Vertex Deletion}
- Maximum bipartite subgraphs of geometric intersection graphs
- Small vertex cover helps in fixed-parameter tractability of graph deletion problems over data streams
- Odd multiway cut in directed acyclic graphs
- On the Parameterized Complexity of Clique Elimination Distance
- On the parameterized complexity of deletion to \(\mathcal{H}\)-free strong components
- Exact and parameterized algorithms for the independent cutset problem
- Linear kernels for separating a graph into components of bounded size
- On the parallel parameterized complexity of MaxSAT variants
- Parameterized vertex deletion problems for hereditary graph classes with a block property
- Parameterized complexity of independent set in \(H\)-free graphs
- Graph Bipartization Problem with Applications to Via Minimization in VLSI Design
- Chordless Cycle Packing Is Fixed-Parameter Tractable
- FPT algorithms to compute the elimination distance to bipartite graphs and more
- Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems closed under induced subgraphs
- Bivariate complexity analysis of \textsc{Almost Forest Deletion}
- scientific article; zbMATH DE number 7559446 (Why is no real title available?)
- A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
- Finding branch-decompositions of matroids, hypergraphs, and more
- Wheel-Free Deletion Is W[2]-Hard
- Iterative Compression and Exact Algorithms
- Fixed-parameter tractability for subset feedback set problems with parity constraints
This page was built for publication: Finding odd cycle transversals.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703225)
