The following pages link to (Q4027320):
Displaying 50 items.
- An algorithmic metatheorem for directed treewidth (Q266806) (← links)
- (Total) vector domination for graphs with bounded branchwidth (Q290105) (← links)
- New analysis and computational study for the planar connected dominating set problem (Q328712) (← links)
- Parameterized complexity of generalized domination problems (Q415279) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Graphs with few \(P_4\)'s under the convexity of paths of order three (Q491593) (← links)
- Fixed-parameter tractability and completeness II: On completeness for W[1] (Q673779) (← links)
- Advice classes of parametrized tractability (Q676315) (← links)
- Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy (Q690460) (← links)
- On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality (Q703542) (← links)
- Improved upper bounds for vertex cover (Q708228) (← links)
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization (Q856420) (← links)
- On generalizations of the shadow independent set problem (Q878644) (← links)
- On the parameterized complexity of dynamic problems (Q896122) (← links)
- Efficient algorithms for counting parameterized list \(H\)-colorings (Q931733) (← links)
- A cubic kernel for feedback vertex set and loop cutset (Q968273) (← links)
- On the parameterized complexity of multiple-interval graph problems (Q1001898) (← links)
- On \(k\)-connectivity problems with sharpened triangle inequality (Q1002105) (← links)
- Computational study on planar dominating set problem (Q1040587) (← links)
- Fixed-parameter tractability of graph modification problems for hereditary properties (Q1352005) (← links)
- Fixed-parameter complexity in AI and nonmonotonic reasoning (Q1603733) (← links)
- The many facets of upper domination (Q1704853) (← links)
- Subexponential fixed-parameter algorithms for partial vector domination (Q1751177) (← links)
- Solving large FPT problems on coarse-grained parallel machines (Q1877701) (← links)
- Improving a fixed parameter tractability time bound for the shadow problem (Q1877708) (← links)
- Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues (Q1892937) (← links)
- Exact algorithms for edge domination (Q1945174) (← links)
- Special issues on The satisfiability problem (pp. 1--244) including papers from the 1st workshop on satisfiability, Certosa di Pontignano, Italy, April 29--May 3, 1996 and Boolean functions (pp. 245--479) (Q1961443) (← links)
- The complexity of irredundant sets parameterized by size (Q1971218) (← links)
- Faster deterministic \textsc{Feedback Vertex Set} (Q2015151) (← links)
- On the complexity of the smallest grammar problem over fixed alphabets (Q2035481) (← links)
- Parameterized algorithms and complexity for the traveling purchaser problem and its variants (Q2084609) (← links)
- On the complexity of singly connected vertex deletion (Q2089067) (← links)
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241) (← links)
- Exact crossing number parameterized by vertex cover (Q2206863) (← links)
- Parameterized low-rank binary matrix approximation (Q2218414) (← links)
- Inclusion/exclusion meets measure and conquer (Q2249747) (← links)
- Obtaining a planar graph by vertex deletion (Q2429328) (← links)
- An improved parameterized algorithm for the independent feedback vertex set problem (Q2447761) (← links)
- The parameterized complexity of maximality and minimality problems (Q2470035) (← links)
- Sparse parameterized problems (Q2564046) (← links)
- Parameterized counting problems (Q2576944) (← links)
- Bounded fixed-parameter tractability and \(\log^{2}n\) nondeterministic bits (Q2581756) (← links)
- On the Complexity Landscape of the Domination Chain (Q2795935) (← links)
- Algorithmic Aspects of Upper Domination: A Parameterised Perspective (Q2830063) (← links)
- The Birth and Early Years of Parameterized Complexity (Q2908529) (← links)
- A Basic Parameterized Complexity Primer (Q2908536) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
- Domination When the Stars Are Out (Q3012826) (← links)
- Algorithms and Complexity of Signed, Minus, and Majority Domination (Q3384120) (← links)
