Pages that link to "Item:Q673779"

The following pages link to Fixed-parameter tractability and completeness II: On completeness for W[1] (Q673779):

Displaying 50 items.

• On the efficiency of polynomial time approximation schemes (Q290268) (← links)
• An improved fixed-parameter algorithm for vertex cover (Q293227) (← links)
• Kernelization of edge perfect code and its variants (Q317422) (← links)
• Parameterized complexity of \(k\)-anonymity: hardness and tractability (Q358665) (← links)
• The density maximization problem in graphs (Q386420) (← links)
• On testing monomials in multivariate polynomials (Q391220) (← links)
• The \(l\)-diversity problem: tractability and approximability (Q392037) (← links)
• Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables (Q414863) (← links)
• On bounded block decomposition problems for under-specified systems of equations (Q414888) (← links)
• A structural/temporal query language for business processes (Q414923) (← links)
• Parameterized complexity of generalized domination problems (Q415279) (← links)
• On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs (Q448967) (← links)
• Lower bounds on kernelization (Q456702) (← links)
• Book review of: Rolf Niedermeier, Invitation to fixed-parameter algorithms (Q458454) (← links)
• Confronting intractability via parameters (Q465686) (← links)
• Correcting gene tree by removal and modification: tractability and approximability (Q491623) (← links)
• Parameterized complexity of coloring problems: treewidth versus vertex cover (Q534566) (← links)
• The intractability of computing the Hamming distance (Q557834) (← links)
• Kernel bounds for disjoint cycles and disjoint paths (Q638521) (← links)
• Approximation schemes for deal splitting and covering integer programs with multiplicity constraints (Q655417) (← links)
• Advice classes of parametrized tractability (Q676315) (← links)
• Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy (Q690460) (← links)
• On the complexity of fixed parameter clique and dominating set (Q703534) (← links)
• Complexity and kernels for bipartition into degree-bounded induced graphs (Q730002) (← links)
• The complexity ecology of parameters: An illustration using bounded max leaf number (Q733736) (← links)
• There is no EPTAS for two-dimensional knapsack (Q765522) (← links)
• Chordless paths through three vertices (Q820149) (← links)
• Compactors for parameterized counting problems (Q826317) (← links)
• Refined memorization for vertex cover (Q835007) (← links)
• Finding and counting cliques and independent sets in \(r\)-uniform hypergraphs (Q845699) (← links)
• On notions of regularity for data languages (Q846359) (← links)
• Fast local search methods for solving limited memory influence diagrams (Q895537) (← links)
• Sublinear separators, fragility and subexponential expansion (Q896068) (← links)
• On the hardness of labeled correlation clustering problem: a parameterized complexity view (Q896155) (← links)
• The challenges of unbounded treewidth in parameterised subgraph counting problems (Q897601) (← links)
• Efficient algorithms for counting parameterized list \(H\)-colorings (Q931733) (← links)
• Causal graphs and structurally restricted planning (Q988572) (← links)
• On the parameterized complexity of multiple-interval graph problems (Q1001898) (← links)
• A heuristic approach for the max-min diversity problem based on max-clique (Q1010298) (← links)
• Parameterized complexity of finding regular induced subgraphs (Q1026227) (← links)
• Before and after vacuity (Q1028732) (← links)
• Parameterized circuit complexity and the \(W\) hierarchy (Q1127315) (← links)
• Threshold dominating sets and an improved characterization of \(W[2]\) (Q1274918) (← links)
• Approximation algorithms for knapsack problems with cardinality constraints (Q1569936) (← links)
• The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs (Q1575712) (← links)
• Perfect Code is \(W[1]\)-complete (Q1603518) (← links)
• Enhancing quantum annealing performance for the molecular similarity problem (Q1679285) (← links)
• Approximation for vertex cover in \(\beta\)-conflict graphs (Q1679502) (← links)
• Change-making problems revisited: a parameterized point of view (Q1679517) (← links)
• Path-contractions, edge deletions and connectivity preservation (Q1713475) (← links)