The following pages link to ON DISJOINT CYCLES (Q4304619):
Displayed 28 items.
- On group feedback vertex set parameterized by the size of the cutset (Q262251) (← links)
- Fast partitioning \(l\)-apex graphs with applications to approximating maximum induced-subgraph problems (Q287003) (← links)
- Vertex-disjoint directed and undirected cycles in general digraphs (Q402588) (← links)
- On feedback vertex set: new measure and new structures (Q494933) (← links)
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization (Q856420) (← links)
- Parameterized complexity of finding connected induced subgraphs (Q897959) (← links)
- Improved algorithms for feedback vertex set problems (Q955350) (← links)
- Parameterized graph cleaning problems (Q967382) (← links)
- A cubic kernel for feedback vertex set and loop cutset (Q968273) (← links)
- Satisfactory graph partition, variants, and generalizations (Q976309) (← links)
- Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3 (Q1018104) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- On interval routing schemes and treewidth (Q1383155) (← links)
- The decycling number of outerplanar graphs (Q1956257) (← links)
- Faster deterministic \textsc{Feedback Vertex Set} (Q2015151) (← links)
- Obtaining a planar graph by vertex deletion (Q2429328) (← links)
- Contracting graphs to paths and trees (Q2441588) (← links)
- An improved parameterized algorithm for the independent feedback vertex set problem (Q2447761) (← links)
- The satisfactory partition problem (Q2495904) (← links)
- Arc-Disjoint Directed and Undirected Cycles in Digraphs (Q2833257) (← links)
- Backdoors to Satisfaction (Q2908542) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
- Subset Feedback Vertex Set Is Fixed-Parameter Tractable (Q3012825) (← links)
- A Quartic Kernel for Pathwidth-One Vertex Deletion (Q3057625) (← links)
- A Linear Kernel for Planar Feedback Vertex Set (Q3503587) (← links)
- Iterative Compression for Exactly Solving NP-Hard Minimization Problems (Q3637312) (← links)
- Parameterized Graph Cleaning Problems (Q5302063) (← links)
- Inapproximability of $H$-Transversal/Packing (Q5348212) (← links)