Pages that link to "Item:Q1811065"
From MaRDI portal
The following pages link to Parameterized complexity of vertex colouring (Q1811065):
Displaying 50 items.
- Chordal editing is fixed-parameter tractable (Q300460) (← links)
- Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter (Q372970) (← links)
- Data reduction for graph coloring problems (Q393081) (← links)
- Parameterized complexity of coloring problems: treewidth versus vertex cover (Q534566) (← links)
- Parameterized coloring problems on chordal graphs (Q820152) (← links)
- Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs (Q972334) (← links)
- Chordal deletion is fixed-parameter tractable (Q973007) (← links)
- The vertex coloring problem and its generalizations (Q1022440) (← links)
- Sublinear approximation algorithms for boxicity and related problems (Q1693125) (← links)
- Solving problems on graphs of high rank-width (Q1709595) (← links)
- Saving colors and max coloring: some fixed-parameter tractability results (Q1755584) (← links)
- Parameterized algorithms for conflict-free colorings of graphs (Q1786593) (← links)
- Subexponential parameterized algorithms and kernelization on almost chordal graphs (Q2037110) (← links)
- Measuring what matters: a hybrid approach to dynamic programming with treewidth (Q2040028) (← links)
- Role coloring bipartite graphs (Q2081494) (← links)
- Parameterized complexity of maximum edge colorable subgraph (Q2088595) (← links)
- Fine-grained parameterized complexity analysis of graph coloring problems (Q2112649) (← links)
- Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity (Q2134740) (← links)
- List-coloring -- parameterizing from triviality (Q2173305) (← links)
- Vertex coloring of a graph for memory constrained scenarios (Q2183733) (← links)
- The power of linear-time data reduction for maximum matching (Q2211355) (← links)
- Complexity of stability (Q2237893) (← links)
- Closing complexity gaps for coloring problems on \(H\)-free graphs (Q2252529) (← links)
- On explaining integer vectors by few homogeneous segments (Q2256725) (← links)
- Polynomial kernels for vertex cover parameterized by small degree modulators (Q2322700) (← links)
- Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs (Q2402262) (← links)
- Parameterized and exact algorithms for class domination coloring (Q2659082) (← links)
- Integer programming in parameterized complexity: five miniatures (Q2673236) (← links)
- FPT and kernelization algorithms for the induced tree problem (Q2692722) (← links)
- Open Problems on Graph Coloring for Special Graph Classes (Q2827799) (← links)
- Parameterized complexity: the main ideas and connections to practical computing (Q2841253) (← links)
- Parameterized and Exact Algorithms for Class Domination Coloring (Q2971145) (← links)
- On Structural Parameterizations of Graph Motif and Chromatic Number (Q2971640) (← links)
- Exact and Parameterized Algorithms for (k, i)-Coloring (Q2971658) (← links)
- Data Reduction for Graph Coloring Problems (Q3088272) (← links)
- Saving Colors and Max Coloring: Some Fixed-Parameter Tractability Results (Q3181046) (← links)
- Solving Problems on Graphs of High Rank-Width (Q3449829) (← links)
- Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover (Q3630207) (← links)
- Approximation and Kernelization for Chordal Vertex Deletion (Q4586151) (← links)
- Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. (Q5092404) (← links)
- The Power of Linear-Time Data Reduction for Maximum Matching (Q5111261) (← links)
- Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems (Q5283380) (← links)
- Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs (Q5387822) (← links)
- Parameterized Pre-Coloring Extension and List Coloring Problems (Q5857010) (← links)
- (Q5874519) (← links)
- Temporal graph classes: a view through temporal separators (Q5915590) (← links)
- Efficient algorithms for measuring the funnel-likeness of DAGs (Q5915704) (← links)
- Fixed-parameter tractability of \((n-k)\) list coloring (Q5918286) (← links)
- The parameterized complexity of cycle packing: indifference is not an issue (Q5919574) (← links)
- Parameterized complexity of optimizing list vertex-coloring through reconfiguration (Q6091170) (← links)
