Zohair Raza Hassan

activity

20202026

most citedComputing Graph Descriptors on Edge Streams

1 citations · 1 across the 8 of their papers we have counts for

collaborators

9 papers

cs.CL2026

RamseyGadgets: A Graph Construction Dataset for LLMs

Zohair Raza Hassan, Deepak Pandita

Constructing special graphs is an important task within graph theory and computer science. Many popular graph constructions are the result of a comprehensive exploration of relevan…

math.CO2026

On Small Folkman Graphs Arrowing $K_{2}$ or $K_{3}$

Zohair Raza Hassan, Stanisław Radziszowski, Steven Van Overberghe

For a graph $G$ and integers $a_{i} \geq 1$ , we say that $G (a_{1}, \dots, a_{k})^{v}$ if in any $k$ -coloring of $G$ 's vertices there exists a monochromatic $a_{i}$ -clique…

cs.GT2025

On the Parallelizability of Approval-Based Committee Rules

Zack Fitzsimmons, Zohair Raza Hassan, Edith Hemaspaandra

Approval-Based Committee (ABC) rules are an important tool for choosing a fair set of candidates when given the preferences of a collection of voters. Though finding a winning comm…

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 $(P_{k}, P_{ℓ})$ -Arrowing

Zohair Raza Hassan, Edith Hemaspaandra, Stanisław Radziszowski

For fixed nonnegative integers $k$ and $ℓ$ , the $(P_{k}, P_{ℓ})$ -Arrowing problem asks whether a given graph, $G$ , has a red/blue coloring of $E (G)$ such that there are no red co…

math.CO2021

On Some Generalized Vertex Folkman Numbers

Zohair Raza Hassan, Yu Jiang, David E. Narváez +2

For a graph $G$ and integers $a_{i} \geq 1$ , the expression $G \to (a_{1}, \dots, a_{r})^{v}$ means that for any $r$ -coloring of the vertices of $G$ there exists a monochromatic $a_{i}$ -…

cs.LG2021★ 1 cited

Computing Graph Descriptors on Edge Streams

Zohair Raza Hassan, Sarwan Ali, Imdadullah Khan +2

Feature extraction is an essential task in graph analytics. These feature vectors, called graph descriptors, are used in downstream vector-space-based graph analysis models. This i…

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.

cs.DB2020

Estimating Descriptors for Large Graphs

Zohair Raza Hassan, Mudassir Shabbir, Imdadullah Khan +1

Embedding networks into a fixed dimensional feature space, while preserving its essential structural properties is a fundamental task in graph analytics. These feature vectors (gra…