The following pages link to (Q4281497):
Displayed 43 items.
- On group feedback vertex set parameterized by the size of the cutset (Q262251) (← links)
- Book review of: Rolf Niedermeier, Invitation to fixed-parameter algorithms (Q458454) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Graphs with few \(P_4\)'s under the convexity of paths of order three (Q491593) (← links)
- On feedback vertex set: new measure and new structures (Q494933) (← links)
- Dominating set is fixed parameter tractable in claw-free graphs (Q650938) (← links)
- Fixed-parameter tractability and completeness II: On completeness for W[1] (Q673779) (← links)
- Advice classes of parametrized tractability (Q676315) (← links)
- On parameterized independent feedback vertex set (Q690464) (← links)
- Compactors for parameterized counting problems (Q826317) (← links)
- Parameterized power domination complexity (Q844180) (← links)
- On the hardness of labeled correlation clustering problem: a parameterized complexity view (Q896155) (← links)
- Efficient algorithms for counting parameterized list \(H\)-colorings (Q931733) (← links)
- Improved algorithms for feedback vertex set problems (Q955350) (← links)
- Parameterized circuit complexity and the \(W\) hierarchy (Q1127315) (← links)
- The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs (Q1575712) (← links)
- Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues (Q1892937) (← links)
- \(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling (Q1919171) (← links)
- Improved analysis of highest-degree branching for feedback vertex set (Q2041981) (← links)
- On the parameterized complexity of the expected coverage problem (Q2135628) (← links)
- From the \(W\)-hierarchy to XNLP. Classes of fixed parameter intractability (Q2154075) (← links)
- Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers (Q2317862) (← links)
- A polynomial kernel for block graph deletion (Q2408204) (← links)
- Sparse parameterized problems (Q2564046) (← links)
- Bounded fixed-parameter tractability and \(\log^{2}n\) nondeterministic bits (Q2581756) (← links)
- The Birth and Early Years of Parameterized Complexity (Q2908529) (← links)
- A Basic Parameterized Complexity Primer (Q2908536) (← links)
- A Parameterized Halting Problem (Q2908544) (← links)
- Reachability in Graph Transformation Systems and Slice Languages (Q2947215) (← links)
- Subset Feedback Vertex Set Is Fixed-Parameter Tractable (Q3012825) (← links)
- A Quartic Kernel for Pathwidth-One Vertex Deletion (Q3057625) (← links)
- (Q5005177) (← links)
- Exploring the Kernelization Borders for Hitting Cycles (Q5009476) (← links)
- On the Complexity of Singly Connected Vertex Deletion (Q5041193) (← links)
- On the Parameterized Complexity of the Expected Coverage Problem (Q5042243) (← links)
- A Retrospective on (Meta) Kernelization (Q5042460) (← links)
- Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues (Q5044398) (← links)
- (Q5092396) (← links)
- (Q5140722) (← links)
- The Parameterized Complexity of Graph Cyclability (Q5891809) (← links)
- An improved FPT algorithm for independent feedback vertex set (Q5918287) (← links)
- Improved FPT Algorithms for Deletion to Forest-Like Structures. (Q6065438) (← links)
- Domino treewidth (Q6184351) (← links)