Pages that link to "Item:Q415279"
From MaRDI portal
The following pages link to Parameterized complexity of generalized domination problems (Q415279):
Displaying 16 items.
- Sort and Search: exact algorithms for generalized domination (Q989487) (← links)
- Combinatorial properties of a general domination problem with parity constraints (Q998375) (← links)
- Threshold dominating sets and an improved characterization of \(W[2]\) (Q1274918) (← links)
- A width parameter useful for chordal and co-comparability graphs (Q1680525) (← links)
- Subexponential fixed-parameter algorithms for partial vector domination (Q1751177) (← links)
- Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications (Q1799219) (← links)
- An integer programming approach for solving a generalized version of the Grundy domination number (Q2032968) (← links)
- On the parameterized complexity of \([1,j]\)-domination problems (Q2283043) (← links)
- The complexity of finding harmless individuals in social networks (Q2339843) (← links)
- The mixed Chinese postman problem parameterized by pathwidth and treedepth (Q2835842) (← links)
- Structural Parameterizations of the Mixed Chinese Postman Problem (Q3452829) (← links)
- Parameterized Complexity of Independence and Domination on Geometric Graphs (Q3499733) (← links)
- Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH (Q5002683) (← links)
- On the Parameterized Complexity of Approximating Dominating Set (Q5215462) (← links)
- Parameterized Complexity of Generalized Domination Problems (Q5851100) (← links)
- Parameterized Complexity of DPLL Search Procedures (Q5892172) (← links)