The following pages link to Finding odd cycle transversals. (Q703225):
Displaying 50 items.
- A fast branching algorithm for cluster vertex deletion (Q255285) (← links)
- On group feedback vertex set parameterized by the size of the cutset (Q262251) (← links)
- Clique cycle-transversals in distance-hereditary graphs (Q299045) (← links)
- Chordal editing is fixed-parameter tractable (Q300460) (← links)
- Reducing rank of the adjacency matrix by graph modification (Q344771) (← links)
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q391650) (← links)
- Parameterized complexity of vertex deletion into perfect graph classes (Q392038) (← links)
- Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization (Q393084) (← links)
- A note on the parameterized complexity of unordered maximum tree orientation (Q427909) (← links)
- FPT algorithms for path-transversal and cycle-transversal problems (Q456698) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- A fixed-parameter algorithm for the vertex cover \(P_3\) problem (Q477591) (← links)
- On feedback vertex set: new measure and new structures (Q494933) (← links)
- Improved kernel results for some FPT problems based on simple observations (Q507431) (← links)
- List H-coloring a graph by removing few vertices (Q527415) (← links)
- Separator-based data reduction for signed graph balancing (Q613659) (← links)
- The complexity of König subgraph problems and above-guarantee vertex cover (Q652520) (← links)
- Edge bipartization faster than \(2^k\) (Q666655) (← links)
- A linear-time algorithm for computing the intersection of all odd cycles in a graph (Q674917) (← links)
- On parameterized independent feedback vertex set (Q690464) (← links)
- Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems (Q719315) (← links)
- Approximability of clique transversal in perfect graphs (Q724231) (← links)
- A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem (Q743120) (← links)
- Parameterized complexity of independent set in H-free graphs (Q786045) (← links)
- Parameterized coloring problems on chordal graphs (Q820152) (← links)
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization (Q856420) (← links)
- Approximate min-max relations for odd cycles in planar graphs (Q877199) (← links)
- On the parameterized vertex cover problem for graphs with perfect matching (Q893740) (← links)
- Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover (Q897878) (← links)
- Parameterized complexity of finding connected induced subgraphs (Q897959) (← links)
- An FPT algorithm for the vertex cover \(P_4\) problem (Q906446) (← links)
- Efficient algorithms for counting parameterized list \(H\)-colorings (Q931733) (← links)
- Improved algorithms for feedback vertex set problems (Q955350) (← links)
- Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs (Q972334) (← links)
- Chordal deletion is fixed-parameter tractable (Q973007) (← links)
- Fixed-parameter algorithms for cluster vertex deletion (Q987386) (← links)
- Constant ratio fixed-parameter approximation of the edge multicut problem (Q990949) (← links)
- Parameterizing above or below guaranteed values (Q1004602) (← links)
- Parameterized complexity of finding regular induced subgraphs (Q1026227) (← links)
- Almost 2-SAT is fixed-parameter tractable (Q1034100) (← links)
- Optimizing adiabatic quantum program compilation using a graph-theoretic framework (Q1654155) (← links)
- A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion (Q1672007) (← links)
- Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs (Q1678166) (← links)
- Bivariate complexity analysis of \textsc{Almost Forest Deletion} (Q1686068) (← links)
- A randomized polynomial kernel for subset feedback vertex set (Q1702849) (← links)
- New bounds for the signless Laplacian spread (Q1736235) (← links)
- An improved FPT algorithm for almost forest deletion problem (Q1751414) (← links)
- Augmenting tractable fragments of abstract argumentation (Q1761284) (← links)
- Paths to trees and cacti (Q1998842) (← links)
- Faster deterministic \textsc{Feedback Vertex Set} (Q2015151) (← links)
