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):
Displayed 50 items.
- Turbocharging treewidth heuristics (Q1725636) (← links)
- Maximum disjoint paths on edge-colored graphs: approximability and tractability (Q1736537) (← links)
- Finding a potential community in networks (Q1737592) (← links)
- Computing the number of induced copies of a fixed graph in a bounded degree graph (Q1741847) (← links)
- Improved approximation algorithms for capacitated fault-tolerant \(k\)-center (Q1742378) (← links)
- Two decomposition algorithms for solving a minimum weight maximum clique model for the air conflict resolution problem (Q1752252) (← links)
- On the complexity of finding and counting solution-free sets of integers (Q1752464) (← links)
- Parameterized computational complexity of finding small-diameter subgraphs (Q1758028) (← links)
- Multivariate complexity analysis of Swap Bribery (Q1759677) (← links)
- Cliques with maximum/minimum edge neighborhood and neighborhood density (Q1762007) (← links)
- Parameterized complexity of vertex colouring (Q1811065) (← links)
- Parameterized complexity of finding subgraphs with hereditary properties. (Q1853579) (← links)
- Preprocessing of intractable problems (Q1854544) (← links)
- Algorithms for vertex-partitioning problems on graphs with fixed clique-width. (Q1874418) (← links)
- The Turing way to parameterized complexity (Q1877697) (← links)
- Solving large FPT problems on coarse-grained parallel machines (Q1877701) (← 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)
- The complexity of irredundant sets parameterized by size (Q1971218) (← links)
- Partial information network queries (Q2018546) (← links)
- Hardness and tractability of the \(\gamma\)\textsf{-Complete Subgraph} problem (Q2032141) (← links)
- On the induced matching problem in Hamiltonian bipartite graphs (Q2059914) (← links)
- The complexity of dependency detection and discovery in relational databases (Q2062133) (← links)
- Parameterized algorithms and complexity for the traveling purchaser problem and its variants (Q2084609) (← links)
- On the complexity of approximately matching a string to a directed graph (Q2084771) (← links)
- Few induced disjoint paths for \(H\)-free graphs (Q2098179) (← links)
- Length-bounded cuts: proper interval graphs and structural parameters (Q2119399) (← links)
- Envy-free allocations respecting social networks (Q2124438) (← links)
- Parameterized complexity of finding subgraphs with hereditary properties on hereditary graph classes (Q2140500) (← links)
- From the \(W\)-hierarchy to XNLP. Classes of fixed parameter intractability (Q2154075) (← links)
- On the \(\Delta \)-interval and the \(\Delta \)-convexity numbers of graphs and graph products (Q2161271) (← links)
- Checking regular invariance under tightly-controlled string modifications (Q2163978) (← links)
- Reoptimization of parameterized problems (Q2170282) (← links)
- Parameterized complexity of conflict-free matchings and paths (Q2182094) (← links)
- Parameterized complexity of independent set reconfiguration problems (Q2192091) (← links)
- Assigning times to minimise reachability in temporal graphs (Q2208254) (← links)
- The envy-free matching problem with pairwise preferences (Q2234784) (← links)
- Detecting fixed patterns in chordal graphs in polynomial time (Q2249737) (← links)
- Applying modular decomposition to parameterized cluster editing problems (Q2272201) (← links)
- CP decomposition and weighted clique problem (Q2307404) (← links)
- Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers (Q2317862) (← links)
- An improved linear kernel for complementary maximal strip recovery: simpler and smaller (Q2319903) (← links)
- The complexity of finding harmless individuals in social networks (Q2339843) (← links)
- Finding disjoint paths in networks with star shared risk link groups (Q2344758) (← links)
- An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems (Q2354725) (← links)
- Tennis manipulation: can we help Serena Williams win another tournament? Or can we control a knockout tournament with reasonable complexity? (Q2363601) (← links)
- 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)