Finding odd cycle transversals.
From MaRDI portal
Recommendations
Cites work
Cited in
(only showing first 100 items - show all)- Parameterizing above or below guaranteed values
- Parameterized complexity of finding regular induced subgraphs
- Almost 2-SAT is fixed-parameter tractable
- Optimizing adiabatic quantum program compilation using a graph-theoretic framework
- A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion
- Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs
- Bivariate complexity analysis of \textsc{Almost Forest Deletion}
- A randomized polynomial kernel for subset feedback vertex set
- New bounds for the signless Laplacian spread
- An improved FPT algorithm for almost forest deletion problem
- Augmenting tractable fragments of abstract argumentation
- Paths to trees and cacti
- Faster deterministic \textsc{Feedback Vertex Set}
- On the complexity of singly connected vertex deletion
- An improved deterministic parameterized algorithm for cactus vertex deletion
- Streaming deletion problems parameterized by vertex cover
- Towards constant-factor approximation for chordal/distance-hereditary vertex deletion
- Distance from triviality 2.0: hybrid parameterizations
- Reoptimization of parameterized problems
- List-coloring -- parameterizing from triviality
- Iterative compression and exact algorithms
- Faster graph bipartization
- Fixed-parameter tractability for subset feedback set problems with parity constraints
- Linear kernels for separating a graph into components of bounded size
- A polynomial kernel for block graph deletion
- Parameterized complexity dichotomy for \((r, \ell)\)-\textsc{Vertex Deletion}
- Approximation and tidying -- a problem kernel for s-plex cluster vertex deletion
- Obtaining a planar graph by vertex deletion
- Sharp separation and applications to exact and parameterized algorithms
- Another disjoint compression algorithm for odd cycle transversal
- An improved parameterized algorithm for the independent feedback vertex set problem
- Planar graph bipartization in linear time
- A fast branching algorithm for cluster vertex deletion
- FPT algorithms to compute the elimination distance to bipartite graphs and more
- Odd cycle transversal in mixed graphs
- Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems closed under induced subgraphs
- Fair allocation of indivisible items with conflict graphs
- Parity linkage and the Erdős-Pósa property of odd cycles through prescribed vertices in highly connected graphs
- On polynomial kernels for structural parameterizations of odd cycle transversal
- A basic parameterized complexity primer
- Backdoors to satisfaction
- Studies in Computational Aspects of Voting
- What's next? Future directions in parameterized complexity
- Clique Cover and Graph Separation
- Clique cycle-transversals in distance-hereditary graphs
- Chordal editing is fixed-parameter tractable
- Measuring indifference: unit interval vertex deletion
- Parameterized complexity of vertex deletion into perfect graph classes
- Important separators and parameterized algorithms
- Tournaments and Semicomplete Digraphs
- Parameterized vertex deletion problems for hereditary graph classes with a block property
- Designing FPT algorithms for cut problems using randomized contractions
- Bivariate complexity analysis of \textsc{Almost Forest Deletion}
- Reducing rank of the adjacency matrix by graph modification
- Odd multiway cut in directed acyclic graphs
- Speeding up Exact Algorithms With High Probability
- Reducing rank of the adjacency matrix by graph modification
- scientific article; zbMATH DE number 4156480 (Why is no real title available?)
- Randomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters
- FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs
- Wheel-Free Deletion Is W[2]-Hard
- Iterative Compression and Exact Algorithms
- Iterative Compression for Exactly Solving NP-Hard Minimization Problems
- Simpler parameterized algorithm for OCT
- Fixed-parameter algorithms in analysis of heuristics for extracting networks in linear programs
- 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
- A note on the parameterized complexity of unordered maximum tree orientation
- FPT algorithms for path-transversal and cycle-transversal problems
- Generalized pseudoforest deletion: algorithms and uniform kernel
- Confronting intractability via parameters
- A fixed-parameter algorithm for the vertex cover P₃ problem
- Feedback vertex sets in tournaments
- On feedback vertex set: new measure and new structures
- Backdoor sets for CSP
- Finding branch-decompositions of matroids, hypergraphs, and more
- Conflict free feedback vertex set: a parameterized dichotomy
- Exploring the kernelization borders for hitting cycles
- Parameterized complexity of independent set in \(H\)-free graphs
- Finding branch-decompositions of matroids, hypergraphs, and more
- On the Complexity of Singly Connected Vertex Deletion
- Improved kernel results for some FPT problems based on simple observations
- scientific article; zbMATH DE number 7559446 (Why is no real title available?)
- An Updated Experimental Evaluation of Graph Bipartization Methods
- scientific article; zbMATH DE number 7278081 (Why is no real title available?)
- Paths to trees and cacti
- Hitting selected (odd) cycles
- The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number
- Fixed-Parameter Algorithms for Cluster Vertex Deletion
- Compression via matroids: a randomized polynomial kernel for odd cycle transversal
- Erdős-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing
- Slightly superexponential parameterized problems
- Chordless Cycle Packing Is Fixed-Parameter Tractable
- scientific article; zbMATH DE number 7650095 (Why is no real title available?)
- A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
- Your rugby mates don't need to know your colleagues: triadic closure with edge colors
- Conflict free version of covering problems on graphs: classical and parameterized
- Streaming deletion problems Parameterized by vertex cover
- scientific article; zbMATH DE number 7765420 (Why is no real title available?)
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)
