Pages that link to "Item:Q4852629"
From MaRDI portal
The following pages link to Fixed-Parameter Tractability and Completeness I: Basic Results (Q4852629):
Displaying 50 items.
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- On the efficiency of polynomial time approximation schemes (Q290268) (← links)
- An improved fixed-parameter algorithm for vertex cover (Q293227) (← links)
- Courcelle's theorem for triangulations (Q346450) (← links)
- Proof systems and transformation games (Q354613) (← links)
- Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs (Q411223) (← links)
- Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables (Q414863) (← links)
- On spanning galaxies in digraphs (Q415275) (← links)
- Extended dynamic subgraph statistics using \(h\)-index parameterized data structures (Q443712) (← 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)
- The intractability of computing the Hamming distance (Q557834) (← links)
- Kernel bounds for disjoint cycles and disjoint paths (Q638521) (← links)
- Fixed-parameter tractability and completeness II: On completeness for W[1] (Q673779) (← links)
- A linear-time algorithm for computing the intersection of all odd cycles in a graph (Q674917) (← links)
- Advice classes of parametrized tractability (Q676315) (← links)
- The complexity ecology of parameters: An illustration using bounded max leaf number (Q733736) (← links)
- Compactors for parameterized counting problems (Q826317) (← links)
- Scheduling with conflicts: Online and offline algorithms (Q842559) (← links)
- Fast local search methods for solving limited memory influence diagrams (Q895537) (← 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)
- Minimal proper interval completions (Q963366) (← links)
- A problem reduction based approach to discrete optimization algorithm design (Q975314) (← links)
- Efficient algorithms for clique problems (Q976087) (← links)
- On the parameterized complexity of multiple-interval graph problems (Q1001898) (← links)
- The complexity of the matroid-greedoid partition problem (Q1006060) (← links)
- A heuristic approach for the max-min diversity problem based on max-clique (Q1010298) (← links)
- Derivation of algorithms for cutwidth and related graph layout parameters (Q1015810) (← links)
- Computational properties of argument systems satisfying graph-theoretic constraints (Q1028949) (← links)
- Parameterized learnability of juntas (Q1034613) (← links)
- Parameterized circuit complexity and the \(W\) hierarchy (Q1127315) (← links)
- Threshold dominating sets and an improved characterization of \(W[2]\) (Q1274918) (← links)
- Approximability of flow shop scheduling (Q1290640) (← links)
- On the complexity of database queries (Q1307689) (← links)
- On fixed-parameter tractability and approximability of NP optimization problems (Q1362338) (← 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)
- Fixed-parameter complexity in AI and nonmonotonic reasoning (Q1603733) (← links)
- On directed covering and domination problems (Q1735678) (← links)
- The complexity of dominating set in geometric intersection graphs (Q1737591) (← links)
- \(K\)-adaptability in stochastic combinatorial optimization under objective uncertainty (Q1740549) (← links)
- Online dominating set (Q1741855) (← links)
- The inapproximability of non-NP-hard optimization problems. (Q1853546) (← links)
- Parameterized complexity of finding subgraphs with hereditary properties. (Q1853579) (← links)
- Preprocessing of intractable problems (Q1854544) (← links)
- On the parametric complexity of schedules to minimize tardy tasks. (Q1874274) (← links)
- Algorithms for vertex-partitioning problems on graphs with fixed clique-width. (Q1874418) (← links)
