Pages that link to "Item:Q673779"
From MaRDI portal
The following pages link to Fixed-parameter tractability and completeness II: On completeness for W[1] (Q673779):
Displaying 50 items.
- Parameterized complexity classes beyond para-NP (Q2396719) (← links)
- A multivariate framework for weighted FPT algorithms (Q2402359) (← links)
- Parameterized algorithms for graph partitioning problems (Q2408556) (← links)
- Improved parameterized algorithms for network query problems (Q2414861) (← links)
- Knapsack problems: a parameterized point of view (Q2419116) (← links)
- Distance-\(d\) independent set problems for bipartite and chordal graphs (Q2436655) (← links)
- Exact algorithms for problems related to the densest \(k\)-set problem (Q2448865) (← links)
- Algorithms in the W-hierarchy (Q2464321) (← links)
- Open problems around exact algorithms (Q2473037) (← links)
- On the structure of parameterized problems in NP (Q2508336) (← links)
- On the kernelization of split graph problems (Q2636501) (← links)
- Kernelization and approximation of distance-\(r\) independent sets on nowhere dense graphs (Q2662795) (← links)
- Optimizing reachability sets in temporal graphs by delaying (Q2672269) (← links)
- Tight FPT approximation for constrained \(k\)-center and \(k\)-supplier (Q2699973) (← links)
- Components in time-varying graphs (Q2787742) (← links)
- On the independent set problem in random graphs (Q2804023) (← links)
- Parameterized Complexity in Multiple-Interval Graphs: Domination (Q2891335) (← links)
- The Birth and Early Years of Parameterized Complexity (Q2908529) (← links)
- The Impact of Parameterized Complexity to Interdisciplinary Problem Solving (Q2908532) (← links)
- A Basic Parameterized Complexity Primer (Q2908536) (← links)
- FPT Suspects and Tough Customers: Open Problems of Downey and Fellows (Q2908547) (← links)
- Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs (Q2942649) (← links)
- Improved Parameterized Algorithms for Network Query Problems (Q2946028) (← links)
- Maximum Minimal Vertex Cover Parameterized by Vertex Cover (Q2946427) (← links)
- On the 2-Club Polytope of Graphs (Q2957469) (← links)
- Fixed-parameter decidability: Extending parameterized complexity analysis (Q2958220) (← links)
- Parameterized Complexity of k-Anonymity: Hardness and Tractability (Q3000512) (← links)
- Improved Approximations for Hard Optimization Problems via Problem Instance Classification (Q3003467) (← links)
- Parameterized Complexity Classes under Logical Reductions (Q3182930) (← links)
- Evaluation and Enumeration Problems for Regular Path Queries (Q3305367) (← links)
- A Purely Democratic Characterization of W[1] (Q3503582) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- (Q4281539) (← links)
- Maximum Minimal Vertex Cover Parameterized by Vertex Cover (Q4588848) (← links)
- Simple doubly-efficient interactive proof systems for locally-characterizable sets (Q4993281) (← links)
- Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure (Q5013568) (← links)
- Computing the Tandem Duplication Distance is NP-Hard (Q5020832) (← links)
- The Complexity of General-Valued Constraint Satisfaction Problems Seen from the Other Side (Q5026391) (← links)
- A Retrospective on (Meta) Kernelization (Q5042460) (← links)
- Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack (Q5075797) (← links)
- On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs (Q5084707) (← links)
- (Q5092423) (← links)
- Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking (Q5111257) (← links)
- Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements (Q5136256) (← links)
- The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs (Q5157395) (← links)
- A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs (Q5266610) (← links)
- An analysis of the W*-hierarchy (Q5294024) (← links)
- Parameterized Complexity for Domination Problems on Degenerate Graphs (Q5302055) (← links)
- Exact Weight Subgraphs and the k-Sum Conjecture (Q5326545) (← links)
- Perfect domination and small cycles (Q5367522) (← links)