Pages that link to "Item:Q1971218"
From MaRDI portal
The following pages link to The complexity of irredundant sets parameterized by size (Q1971218):
Displaying 14 items.
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack (Q635734) (← links)
- Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy (Q690460) (← links)
- Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles (Q958211) (← links)
- The parameterized complexity of the induced matching problem (Q1028465) (← links)
- The many facets of upper domination (Q1704853) (← links)
- Parameterized complexity of finding subgraphs with hereditary properties. (Q1853579) (← links)
- On the induced matching problem in Hamiltonian bipartite graphs (Q2059914) (← links)
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241) (← links)
- Perfectly matched sets in graphs: parameterized and exact computation (Q2697539) (← links)
- On the Complexity Landscape of the Domination Chain (Q2795935) (← links)
- Algorithmic Aspects of Upper Domination: A Parameterised Perspective (Q2830063) (← links)
- Vertex Cover, Dominating Set and My Encounters with Parameterized Complexity and Mike Fellows (Q2908533) (← links)
- Exploiting c-Closure in Kernelization Algorithms for Graph Problems (Q5874537) (← links)
- On the parameterized complexity of the acyclic matching problem (Q6038700) (← links)
