The following pages link to Finding odd cycle transversals. (Q703225):
Displaying 50 items.
- On the complexity of singly connected vertex deletion (Q2089067) (← links)
- An improved deterministic parameterized algorithm for cactus vertex deletion (Q2135634) (← links)
- Streaming deletion problems parameterized by vertex cover (Q2140522) (← links)
- Towards constant-factor approximation for chordal/distance-hereditary vertex deletion (Q2149107) (← links)
- Distance from triviality 2.0: hybrid parameterizations (Q2169932) (← links)
- Reoptimization of parameterized problems (Q2170282) (← links)
- List-coloring -- parameterizing from triviality (Q2173305) (← links)
- Iterative compression and exact algorithms (Q2268862) (← links)
- Faster graph bipartization (Q2301359) (← links)
- Fixed-parameter tractability for subset feedback set problems with parity constraints (Q2344735) (← links)
- Linear kernels for separating a graph into components of bounded size (Q2361357) (← links)
- A polynomial kernel for block graph deletion (Q2408204) (← links)
- Parameterized complexity dichotomy for \((r, \ell)\)-\textsc{Vertex Deletion} (Q2408559) (← links)
- Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion (Q2429325) (← links)
- Obtaining a planar graph by vertex deletion (Q2429328) (← links)
- Sharp separation and applications to exact and parameterized algorithms (Q2429363) (← links)
- Another disjoint compression algorithm for odd cycle transversal (Q2445321) (← links)
- A faster FPT algorithm for bipartite contraction (Q2445333) (← links)
- An improved parameterized algorithm for the independent feedback vertex set problem (Q2447761) (← links)
- Planar graph bipartization in linear time (Q2482113) (← links)
- FPT algorithms to compute the elimination distance to bipartite graphs and more (Q2672425) (← links)
- Odd cycle transversal in mixed graphs (Q2672431) (← links)
- Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems closed under induced subgraphs (Q2689443) (← links)
- Fair allocation of indivisible items with conflict graphs (Q2701390) (← links)
- Parity Linkage and the Erdős-Pósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs (Q2827821) (← links)
- On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal (Q2891343) (← links)
- A Basic Parameterized Complexity Primer (Q2908536) (← links)
- Backdoors to Satisfaction (Q2908542) (← links)
- Studies in Computational Aspects of Voting (Q2908543) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
- Clique Cover and Graph Separation (Q2943572) (← links)
- Subset Feedback Vertex Set Is Fixed-Parameter Tractable (Q3012825) (← links)
- Measuring Indifference: Unit Interval Vertex Deletion (Q3057628) (← links)
- Parameterized Complexity of Vertex Deletion into Perfect Graph Classes (Q3088287) (← links)
- Important Separators and Parameterized Algorithms (Q3104759) (← links)
- Tournaments and Semicomplete Digraphs (Q3120434) (← links)
- Parameterized Vertex Deletion Problems for Hereditary Graph Classes with a Block Property (Q3181061) (← links)
- Designing FPT Algorithms for Cut Problems Using Randomized Contractions (Q3187169) (← links)
- Bivariate Complexity Analysis of Almost Forest Deletion (Q3196379) (← links)
- Reducing Rank of the Adjacency Matrix by Graph Modification (Q3196399) (← links)
- Odd Multiway Cut in Directed Acyclic Graphs (Q3300762) (← links)
- Speeding up Exact Algorithms With High Probability (Q3439468) (← links)
- Randomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters (Q3503572) (← links)
- FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs (Q3503584) (← links)
- Wheel-Free Deletion Is W[2]-Hard (Q3503585) (← links)
- Iterative Compression and Exact Algorithms (Q3599139) (← links)
- Iterative Compression for Exactly Solving NP-Hard Minimization Problems (Q3637312) (← links)
- Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs (Q3656864) (← links)
- Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel (Q4637327) (← links)
- Feedback Vertex Sets in Tournaments (Q4908824) (← links)
