Pages that link to "Item:Q1642688"
From MaRDI portal
The following pages link to On the parameterized complexity of happy vertex coloring (Q1642688):
Displaying 12 items.
- Finding happiness: an analysis of the maximum happy vertices problem (Q1634084) (← links)
- Graph classes and approximability of the happy set problem (Q2019476) (← links)
- Tackling the maximum happy vertices problem in large networks (Q2026712) (← links)
- A simple and effective algorithm for the maximum happy vertices problem (Q2121620) (← links)
- Parameterized complexity of happy coloring problems (Q2192381) (← links)
- Complexity and approximability of the happy set problem (Q2662689) (← links)
- Linear Time Algorithms for Happy Vertex Coloring Problems for Trees (Q2819511) (← links)
- Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover (Q3630207) (← links)
- Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph (Q5918330) (← links)
- Lower bounds for the happy coloring problems (Q5918935) (← links)
- Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph (Q5919045) (← links)
- Parameterized algorithms for the happy set problem (Q5919103) (← links)