Pages that link to "Item:Q383833"
From MaRDI portal
The following pages link to Fundamentals of parameterized complexity (Q383833):
Displaying 50 items.
- Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity (Q2134740) (← links)
- On the parameterized complexity of the expected coverage problem (Q2135628) (← links)
- Parameterized complexity of finding subgraphs with hereditary properties on hereditary graph classes (Q2140500) (← links)
- A general scheme for solving a large set of scheduling problems with rejection in FPT time (Q2142679) (← links)
- Resolute control: forbidding candidates from winning an election is hard (Q2143123) (← links)
- Well-partitioned chordal graphs (Q2144581) (← links)
- Tree automata and pigeonhole classes of matroids. I (Q2149094) (← links)
- A parameterized view on the complexity of dependence logic (Q2151403) (← links)
- From the \(W\)-hierarchy to XNLP. Classes of fixed parameter intractability (Q2154075) (← links)
- Parameterized complexity of immunization in the threshold model (Q2154106) (← links)
- Parameterized complexity of minimum membership dominating set (Q2154108) (← links)
- An algorithm for finding approximate Nash equilibria in bimatrix games (Q2157005) (← links)
- Parameterized complexity of directed spanner problems (Q2161008) (← links)
- Structural parameterizations with modulator oblivion (Q2161010) (← links)
- A polynomial kernel for funnel arc deletion set (Q2161012) (← links)
- Induced star partition of graphs (Q2161236) (← links)
- Structural parameterization for minimum conflict-free colouring (Q2161251) (← links)
- Component order connectivity in directed graphs (Q2165039) (← links)
- Distance from triviality 2.0: hybrid parameterizations (Q2169932) (← links)
- The parameterized complexity of \(s\)-club with triangle and seed constraints (Q2169965) (← links)
- Learning from positive and negative examples: dichotomies and parameterized algorithms (Q2169975) (← links)
- On critical node problems with vulnerable vertices (Q2169985) (← links)
- Reoptimization of parameterized problems (Q2170282) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- Sparse obstructions for minor-covering parameters (Q2174553) (← links)
- Parameterized complexity of fair deletion problems (Q2174554) (← links)
- Grammars and clique-width bounds from split decompositions (Q2174558) (← links)
- On quasi-planar graphs: clique-width and logical description (Q2174559) (← links)
- Mim-width. I. Induced path problems (Q2174563) (← links)
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241) (← links)
- Parameterized complexity of conflict-free matchings and paths (Q2182094) (← links)
- The parameterized hardness of the \(k\)-center problem in transportation networks (Q2182096) (← links)
- Parameterized aspects of strong subgraph closure (Q2182097) (← links)
- Finding connected secluded subgraphs (Q2186823) (← links)
- Stable marriage with groups of similar agents (Q2190408) (← links)
- Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms (Q2192064) (← links)
- On the tractability of optimization problems on \(H\)-graphs (Q2196605) (← links)
- Polynomial kernels for hitting forbidden minors under structural parameterizations (Q2202024) (← links)
- Solving hard stable matching problems involving groups of similar agents (Q2205948) (← links)
- Parameterized algorithms for book embedding problems (Q2206870) (← links)
- Revisiting the parameterized complexity of maximum-duo preservation string mapping (Q2210511) (← links)
- Breakpoint distance and PQ-trees (Q2216109) (← links)
- Parameterized low-rank binary matrix approximation (Q2218414) (← links)
- Fashion game on graphs (Q2218646) (← links)
- How to compute digraph width measures on directed co-graphs (Q2220888) (← links)
- Parameterized \(k\)-clustering: tractability island (Q2221803) (← links)
- Maximum parsimony distance on phylogenetic trees: a linear kernel and constant factor approximation algorithm (Q2221808) (← links)
- Parameterized dynamic cluster editing (Q2223691) (← links)
- On structural parameterizations of the bounded-degree vertex deletion problem (Q2223699) (← links)
- Efficient computation of the oriented chromatic number of recursively defined digraphs (Q2235732) (← links)