Pages that link to "Item:Q2192381"
From MaRDI portal
The following pages link to Parameterized complexity of happy coloring problems (Q2192381):
Displaying 9 items.
- Algorithmic aspects of homophyly of networks (Q501003) (← links)
- Finding happiness: an analysis of the maximum happy vertices problem (Q1634084) (← links)
- On structural parameterizations of happy coloring, empire coloring and boxicity (Q1641127) (← links)
- On the parameterized complexity of happy vertex coloring (Q1642688) (← links)
- Linear Time Algorithms for Happy Vertex Coloring Problems for Trees (Q2819511) (← links)
- Lower bounds for the happy coloring problems (Q5918935) (← links)
- Parameterized algorithms for the happy set problem (Q5919103) (← links)
- Serial and parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU (Q6078297) (← links)
- On \(d\)-stable locally checkable problems parameterized by mim-width (Q6202932) (← links)