Pages that link to "Item:Q5283380"
From MaRDI portal
The following pages link to Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems (Q5283380):
Displaying 16 items.
- Structural parameterizations of clique coloring (Q832512) (← links)
- Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity (Q2134740) (← links)
- List-coloring -- parameterizing from triviality (Q2173305) (← links)
- Optimal data reduction for graph coloring using low-degree polynomials (Q2272594) (← links)
- Computing the chromatic number using graph decompositions via matrix rank (Q2330132) (← links)
- (Q5002765) (← links)
- Computing the Chromatic Number Using Graph Decompositions via Matrix Rank (Q5009610) (← links)
- (Q5089217) (← links)
- Parameterized (Approximate) Defective Coloring (Q5107096) (← links)
- Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials (Q5111881) (← links)
- Finer Tight Bounds for Coloring on Clique-Width (Q5130905) (← links)
- Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems (Q5283380) (← links)
- Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation (Q5925558) (← links)
- Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation (Q5925677) (← links)
- (Q6065467) (← links)
- (Q6089653) (← links)