Pages that link to "Item:Q1877697"
From MaRDI portal
The following pages link to The Turing way to parameterized complexity (Q1877697):
Displaying 33 items.
- On the parameterised complexity of string morphism problems (Q315525) (← links)
- Finding approximate and constrained motifs in graphs (Q390871) (← links)
- Parameterized proof complexity (Q451111) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Chordless paths through three vertices (Q820149) (← links)
- On product covering in 3-tier supply chain models: natural complete problems for W[3] and W[4] (Q860874) (← links)
- Vertex and edge covers with clustering properties: Complexity and algorithms (Q1026225) (← links)
- Perfect Code is \(W[1]\)-complete (Q1603518) (← links)
- The complexity of probabilistic lobbying (Q1662102) (← links)
- The many facets of upper domination (Q1704853) (← links)
- A multi-parameter analysis of hard problems on deterministic finite automata (Q2256724) (← links)
- Facility location problems: a parameterized view (Q2275913) (← links)
- The complexity of finding harmless individuals in social networks (Q2339843) (← links)
- A completeness theory for polynomial (Turing) kernelization (Q2343083) (← links)
- Parameterizations of hitting set of bundles and inverse scope (Q2344004) (← links)
- A complete parameterized complexity analysis of bounded planning (Q2353405) (← links)
- The graph motif problem parameterized by the structure of the input graph (Q2403795) (← links)
- On the complexity of various parameterizations of common induced subgraph isomorphism (Q2405897) (← links)
- A parametric analysis of the state-explosion problem in model checking (Q2495399) (← links)
- Parameterized counting problems (Q2576944) (← links)
- Grundy Coloring and friends, half-graphs, bicliques (Q2700380) (← links)
- Algorithmic Aspects of Upper Domination: A Parameterised Perspective (Q2830063) (← links)
- A Parameterized Halting Problem (Q2908544) (← links)
- Parameterized exact and approximation algorithms for maximum<i>k</i>-set cover and related satisfiability problems (Q2956881) (← links)
- Dual parameterization and parameterized approximability of subset graph problems (Q2969972) (← links)
- Finding Approximate and Constrained Motifs in Graphs (Q3011870) (← links)
- Parameterized Dynamic Variants of Red-Blue Dominating Set (Q3297772) (← links)
- Facility Location Problems: A Parameterized View (Q3511428) (← links)
- Synchronizing words and monoid factorization, yielding a new parameterized complexity class? (Q5048011) (← links)
- (Q5150410) (← links)
- R<scp>OMAN DOMINATION</scp>: a parameterized perspective† (Q5438692) (← links)
- (Q5743498) (← links)
- Parameterized certificate dispersal and its variants (Q5964075) (← links)
