The following pages link to Parametrized complexity theory. (Q2488567):
Displaying 50 items.
- Parameterized complexity of connected even/odd subgraph problems (Q395000) (← links)
- Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking (Q395003) (← links)
- Effective computation of immersion obstructions for unions of graph classes (Q395009) (← links)
- The complexity of weighted counting for acyclic conjunctive queries (Q395018) (← links)
- Courcelle's theorem -- a game-theoretic approach (Q408375) (← links)
- Aspects of a multivariate complexity analysis for rectangle tiling (Q408398) (← links)
- Improved bounds for spanning trees with many leaves (Q409458) (← links)
- Hardness of discrepancy computation and \(\varepsilon\)-net verification in high dimension (Q413466) (← links)
- Parameterized complexity of finding small degree-constrained subgraphs (Q414424) (← links)
- Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables (Q414863) (← links)
- Editing graphs to satisfy degree constraints: a parameterized approach (Q414866) (← links)
- On making directed graphs transitive (Q414917) (← links)
- Parameterized complexity of generalized domination problems (Q415279) (← links)
- On the model-checking of monadic second-order formulas with edge set quantifications (Q415286) (← links)
- Mod/Resc parsimony inference: theory and application (Q418168) (← links)
- Most probable explanations in Bayesian networks: complexity and tractability (Q433524) (← links)
- Minimum common string partition revisited (Q437061) (← links)
- Parameterized Eulerian strong component arc deletion problem on tournaments (Q437687) (← links)
- Local search: is brute-force avoidable? (Q439931) (← links)
- Catalan structures and dynamic programming in \(H\)-minor-free graphs (Q440008) (← links)
- The complexity of finding uniform sparsest cuts in various graph classes (Q450559) (← links)
- Graph-based data clustering with overlaps (Q456688) (← links)
- Parameterized complexity and approximability of the longest compatible sequence problem (Q456697) (← links)
- FPT algorithms for path-transversal and cycle-transversal problems (Q456698) (← links)
- On the directed full degree spanning tree problem (Q456701) (← links)
- Lower bounds on kernelization (Q456702) (← links)
- Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search (Q457253) (← links)
- Subexponential parameterized algorithms (Q458457) (← links)
- An efficient polynomial time approximation scheme for load balancing on uniformly related machines (Q463715) (← links)
- Exploiting a hypergraph model for finding Golomb rulers (Q471187) (← links)
- Parameterized complexity of three edge contraction problems with degree constraints (Q471188) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Patterns with bounded treewidth (Q476169) (← links)
- Complexity of splits reconstruction for low-degree trees (Q476307) (← links)
- Approximation algorithms for intersection graphs (Q476425) (← links)
- Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable (Q476442) (← links)
- On the parameterized complexity of vertex cover and edge cover with connectivity constraints (Q482281) (← links)
- Towards optimal and expressive kernelization for \(d\)-hitting set (Q486984) (← links)
- Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy (Q491087) (← links)
- Graphs with few \(P_4\)'s under the convexity of paths of order three (Q491593) (← links)
- On the parameterized complexity of computing balanced partitions in graphs (Q493645) (← links)
- Minimizing Rosenthal potential in multicast games (Q493648) (← links)
- On the parameterized complexity of non-monotonic logics (Q494658) (← links)
- Restricted and swap common superstring: a multivariate algorithmic perspective (Q494787) (← links)
- Augmenting graphs to minimize the diameter (Q494792) (← links)
- \textsc{Max-Cut} parameterized above the Edwards-Erdős bound (Q494801) (← links)
- Parameterized complexity analysis for the closest string with wildcards problem (Q495996) (← links)
- On finding optimal polytrees (Q500966) (← links)
- Parameterized complexity of strip packing and minimum volume packing (Q501656) (← links)
- 1.5D terrain guarding problem parameterized by guard range (Q501659) (← links)
