Pages that link to "Item:Q415279"
From MaRDI portal
The following pages link to Parameterized complexity of generalized domination problems (Q415279):
Displaying 7 items.
- 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)
- 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 Intractability of Even Set and Shortest Vector Problem from Gap-ETH (Q5002683) (← links)
