Page not found

Perhaps you were looking for one of these?

Latest

• On the complexity of restoring corrupted colorings

• Fine-grained Search Space Classification for Hard Enumeration Variants of Subset Problems

• On the complexity of rainbow coloring problems

• NP-completeness results for partitioning a graph into total dominating sets

• Computing Minimum Rainbow and Strong Rainbow Colorings of Block Graphs

• Engineering Motif Search for Large Motifs

• On the Fine-Grained Complexity of Rainbow Coloring

• Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs

• Algorithms and hardness results for happy coloring problems

• Complexity of rainbow vertex connectivity problems for restricted graph classes