Pages that link to "Item:Q2413966"
From MaRDI portal
The following pages link to Parameterized complexity of distance labeling and uniform channel assignment problems (Q2413966):
Displaying 9 items.
- Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity (Q1687933) (← links)
- Combinatorial \(n\)-fold integer programming and applications (Q2205969) (← links)
- Computing \(L(p, 1)\)-labeling with combined parameters (Q2232248) (← links)
- Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems (Q2817849) (← links)
- Integer Programming in Parameterized Complexity: Three Miniatures. (Q5009484) (← links)
- Computing L(p,1)-Labeling with Combined Parameters (Q5049996) (← links)
- (Q5111743) (← links)
- Parameterized complexity for iterated type partitions and modular-width (Q6126724) (← links)
- Getting linear time in graphs of bounded neighborhood diversity (Q6599065) (← links)