1 citations · 1 across the 8 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2024
The Complexity of (P3, H)-Arrowing and Beyond
Zohair Raza Hassan
Often regarded as the study of how order emerges from randomness, Ramsey theory has played an important role in mathematics and computer science, giving rise to applications in num…
cs.CC2023
The Complexity of -Arrowing
Zohair Raza Hassan, Edith Hemaspaandra, Stanisław Radziszowski
For fixed nonnegative integers and , the -Arrowing problem asks whether a given graph, , has a red/blue coloring of such that there are no red co…
cs.CC2020
A Simpler NP-Hardness Proof for Familial Graph Compression
Ammar Ahmed, Zohair Raza Hassan, Mudassir Shabbir
This document presents a simpler proof showcasing the NP-hardness of Familial Graph Compression.