Pages that link to "Item:Q3611990"
From MaRDI portal
The following pages link to On the Complexity of Some Colorful Problems Parameterized by Treewidth (Q3611990):
Displaying 12 items.
- Parameterized complexity of coloring problems: treewidth versus vertex cover (Q534566) (← links)
- On the complexity of some colorful problems parameterized by treewidth (Q627124) (← links)
- The complexity ecology of parameters: An illustration using bounded max leaf number (Q733736) (← links)
- Minimum conflict free colouring parameterized by treewidth (Q779250) (← links)
- On the complexity of the regenerator location problem treewidth and other parameters (Q896670) (← links)
- Coloring down: 3/2-approximation for special cases of the weighted tree augmentation problem (Q2102838) (← links)
- Parameterized complexity of fair deletion problems (Q2174554) (← links)
- On digraph coloring problems and treewidth duality (Q2427534) (← links)
- Milling a Graph with Turn Costs: A Parameterized Complexity Perspective (Q3057619) (← links)
- Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover (Q3630207) (← links)
- (Q5267684) (← links)
- Walking through waypoints (Q5918830) (← links)