Pages that link to "Item:Q393081"

The following pages link to Data reduction for graph coloring problems (Q393081):

Displaying 23 items.

• Reducing graph coloring to clique search (Q326946) (← links)
• Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization (Q722549) (← links)
• Saving colors and max coloring: some fixed-parameter tractability results (Q1755584) (← links)
• Subexponential parameterized algorithms and kernelization on almost chordal graphs (Q2037110) (← links)
• Structural parameterizations of Tracking Paths problem (Q2089072) (← links)
• Fine-grained parameterized complexity analysis of graph coloring problems (Q2112649) (← links)
• Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies (Q2119402) (← links)
• Optimal data reduction for graph coloring using low-degree polynomials (Q2272594) (← links)
• Revisiting connected vertex cover: FPT algorithms and lossy kernels (Q2322693) (← links)
• Computing the chromatic number using graph decompositions via matrix rank (Q2330132) (← links)
• Sparsification upper and lower bounds for graph problems and not-all-equal SAT (Q2408194) (← links)
• A Turing kernelization dichotomy for structural parameterizations of \(\mathcal{F} \)-minor-free deletion (Q2662677) (← links)
• FPT is characterized by useful obstruction sets: connecting algorithms, kernels, and quasi-orders (Q2828222) (← links)
• Exact and Parameterized Algorithms for (k, i)-Coloring (Q2971658) (← links)
• Saving Colors and Max Coloring: Some Fixed-Parameter Tractability Results (Q3181046) (← links)
• Parameterized Complexity of Conflict-Free Graph Coloring (Q4959657) (← links)
• Data Reduction for Maximum Matching on Real-World Graphs (Q5102046) (← links)
• Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials (Q5111881) (← links)
• Obstructions for Three-Coloring and List Three-Coloring $H$-Free Graphs (Q5216779) (← links)
• Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems (Q5283380) (← links)
• (Q5874519) (← links)
• Fixed-parameter tractability of \((n-k)\) list coloring (Q5918286) (← links)
• Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization (Q6107887) (← links)