Pages that link to "Item:Q2930308"
From MaRDI portal
The following pages link to A 4 <i>k</i> <sup>2</sup> kernel for feedback vertex set (Q2930308):
Displaying 50 items.
- On group feedback vertex set parameterized by the size of the cutset (Q262251) (← links)
- A \(13k\)-kernel for planar feedback vertex set via region decomposition (Q306250) (← links)
- Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments (Q329279) (← links)
- On a generalization of Nemhauser and Trotter's local optimization theorem (Q340561) (← links)
- A polynomial kernel for \textsc{Feedback Arc Set} on bipartite tournaments (Q385516) (← links)
- Parameterized complexity of vertex deletion into perfect graph classes (Q392038) (← links)
- Polynomial kernels for proper interval completion and related problems (Q393083) (← links)
- Lower bounds on kernelization (Q456702) (← links)
- Parameterized complexity of three edge contraction problems with degree constraints (Q471188) (← links)
- Enumerating minimal subset feedback vertex sets (Q472481) (← links)
- On the parameterized complexity of reconfiguration problems (Q527426) (← links)
- On making a distinguished vertex of minimum degree by vertex deletion (Q528861) (← links)
- Kernel bounds for disjoint cycles and disjoint paths (Q638521) (← links)
- Kernels for feedback arc set in tournaments (Q657916) (← links)
- On parameterized independent feedback vertex set (Q690464) (← links)
- Kernelization hardness of connectivity problems in \(d\)-degenerate graphs (Q713308) (← links)
- Dynamic parameterized problems (Q722546) (← links)
- Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization (Q722549) (← links)
- Compactors for parameterized counting problems (Q826317) (← links)
- On the parameterized complexity of maximum degree contraction problem (Q832521) (← links)
- A \((3+\epsilon)k\)-vertex kernel for edge-disjoint triangle packing (Q1628680) (← links)
- Kernels for deletion to classes of acyclic digraphs (Q1678165) (← links)
- Bivariate complexity analysis of \textsc{Almost Forest Deletion} (Q1686068) (← links)
- A randomized polynomial kernel for subset feedback vertex set (Q1702849) (← links)
- Polynomial kernels for deletion to classes of acyclic digraphs (Q1751231) (← links)
- The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs (Q1756342) (← links)
- An improved FPT algorithm and a quadratic kernel for pathwidth one vertex deletion (Q1759683) (← links)
- Towards optimal kernel for connected vertex cover in planar graphs (Q1949125) (← links)
- On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems (Q1949740) (← links)
- Faster deterministic \textsc{Feedback Vertex Set} (Q2015151) (← links)
- On the complexity of singly connected vertex deletion (Q2089067) (← links)
- Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size (Q2093579) (← links)
- Output sensitive fault tolerant maximum matching (Q2097219) (← links)
- Polynomial kernels for hitting forbidden minors under structural parameterizations (Q2202024) (← links)
- Polynomial kernels for vertex cover parameterized by small degree modulators (Q2322700) (← links)
- Finding, hitting and packing cycles in subexponential time on unit disk graphs (Q2334507) (← links)
- A completeness theory for polynomial (Turing) kernelization (Q2343083) (← links)
- On sparsification for computing treewidth (Q2343087) (← links)
- Fixed-parameter tractability for subset feedback set problems with parity constraints (Q2344735) (← links)
- On the kernelization of ranking \(r\)-CSPs: linear vertex-kernels for generalizations of feedback arc set and betweenness in tournaments (Q2345613) (← links)
- Linear kernels for separating a graph into components of bounded size (Q2361357) (← links)
- A polynomial kernel for block graph deletion (Q2408204) (← links)
- Meta-kernelization using well-structured modulators (Q2413976) (← links)
- Contracting graphs to paths and trees (Q2441588) (← links)
- On the kernelization of split graph problems (Q2636501) (← links)
- Simultaneous feedback edge set: a parameterized perspective (Q2659779) (← links)
- A Turing kernelization dichotomy for structural parameterizations of \(\mathcal{F} \)-minor-free deletion (Q2662677) (← links)
- Towards a polynomial kernel for directed feedback vertex set (Q2663705) (← links)
- Preprocessing to reduce the search space: antler structures for feedback vertex set (Q2672419) (← links)
- Circumventing connectivity for kernelization (Q2692730) (← links)
