Pages that link to "Item:Q2192381"
From MaRDI portal
The following pages link to Parameterized complexity of happy coloring problems (Q2192381):
Displayed 3 items.
- Serial and parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU (Q6078297) (← links)
- Spanning trees with few branch vertices in graphs of bounded neighborhood diversity (Q6148080) (← links)
- On \(d\)-stable locally checkable problems parameterized by mim-width (Q6202932) (← links)