The following pages link to (Q2768335):
Displaying 7 items.
- Edge dominating set and colorings on graphs with fixed clique-width (Q1861574) (← links)
- Algorithms for vertex-partitioning problems on graphs with fixed clique-width. (Q1874418) (← links)
- Efficient computation of the oriented chromatic number of recursively defined digraphs (Q2235732) (← links)
- Parameterized complexity of distance labeling and uniform channel assignment problems (Q2413966) (← links)
- Improved bottleneck domination algorithms (Q2499580) (← links)
- Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems (Q2817849) (← links)
- Graph Classes with Structured Neighborhoods and Algorithmic Applications (Q3104764) (← links)
