Pages that link to "Item:Q484316"

The following pages link to Complexity of conflict-free colorings of graphs (Q484316):

Displaying 25 items.

• Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity (Q1687933) (← links)
• Parameterized algorithms for conflict-free colorings of graphs (Q1786593) (← links)
• Conflict-free coloring of string graphs (Q2022631) (← links)
• Coloring a dominating set without conflicts: \(q\)-subset square coloring (Q2097209) (← links)
• Conflict-free coloring: graphs of bounded clique width and intersection graphs (Q2115843) (← links)
• Parameterized complexity of immunization in the threshold model (Q2154106) (← links)
• Conflict-free coloring bounds on open neighborhoods (Q2161000) (← links)
• Structural parameterization for minimum conflict-free colouring (Q2161251) (← links)
• A tight bound for conflict-free coloring in terms of distance to cluster (Q2166302) (← links)
• Conflict-free coloring of intersection graphs of geometric objects (Q2207603) (← links)
• Integer programming in parameterized complexity: five miniatures (Q2673236) (← links)
• Evangelism in Social Networks (Q2819494) (← links)
• Conflict-Free Coloring of Graphs (Q4556952) (← links)
• Conflict-Free Coloring of Intersection Graphs (Q4557736) (← links)
• Parameterized Complexity of Conflict-Free Graph Coloring (Q4959657) (← links)
• Integer Programming in Parameterized Complexity: Three Miniatures. (Q5009484) (← links)
• Iterated Type Partitions (Q5041190) (← links)
• A Short Note on Open-Neighborhood Conflict-Free Colorings of Graphs (Q5128500) (← links)
• (Q5136250) (← links)
• Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs (Q5745127) (← links)
• Immunization in the threshold model: a parameterized complexity study (Q6069928) (← links)
• Colouring a dominating set without conflicts: \(q\)-subset square colouring (Q6077071) (← links)
• Serial and parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU (Q6078297) (← links)
• Parameterized complexity for iterated type partitions and modular-width (Q6126724) (← links)
• A survey on conflict-free connection coloring of graphs (Q6497946) (← links)