Estimating Descriptors for Large Graphs. - Zohair Raza Hassan; Mudassir Shabbir; Imdadullah Khan; Waseem Abbas (PAKDD (1), 2020)

A Simpler NP-Hardness Proof for Familial Graph Compression. - Ammar Ahmed; Zohair Raza Hassan; Mudassir Shabbir (CoRR, 2020)

Interpretable multi-scale graph descriptors via structural compression. - Ammar Ahmed; Zohair Raza Hassan; Mudassir Shabbir (Inf. Sci., 2020)

Computing Graph Descriptors on Edge Streams. - Zohair Raza Hassan; Imdadullah Khan; Mudassir Shabbir; Waseem Abbas (CoRR, 2021)

Seymour's Second Neighborhood Conjecture for 6-antitransitive digraphs. - Zohair Raza Hassan; Imran F. Khan; Mehvish I. Poshni; Mudassir Shabbir (Discret. Appl. Math., 2021)

Data driven smart policing: A novel road distance-based k-median model for optimal substation placement. - Abinta Mehmood Mir; Ali Hassan; Asma Khalid; Zohair Raza Hassan; Faisal Kamiran; Agha Ali Raza; Saeed-Ul Hassan; Mudassir Shabbir (Comput. Hum. Behav., 2022)

The Complexity of (Pk, Pℓ )-Arrowing. - Zohair Raza Hassan; Edith Hemaspaandra; Stanislaw P. Radziszowski (FCT, 2023)

Computing Graph Descriptors on Edge Streams. - Zohair Raza Hassan; Sarwan Ali; Imdadullah Khan; Mudassir Shabbir; Waseem Abbas (ACM Trans. Knowl. Discov. Data, 2023)

On augmenting topological graph representations for attributed graphs. - Anwar Said; Mudassir Shabbir; Saeed-Ul Hassan; Zohair Raza Hassan; Ammar Ahmed; Xenofon D. Koutsoukos (Appl. Soft Comput., 2023)

On Some Generalized Vertex Folkman Numbers. - Zohair Raza Hassan; Yu Jiang; David E. Narváez; Stanislaw P. Radziszowski; Xiaodong Xu 006 (Graphs Comb., 2023)

The Complexity of (P₃, H)-Arrowing and Beyond. - Zohair Raza Hassan (MFCS, 2024)

The Complexity of (P3, H)-Arrowing and Beyond. - Zohair Raza Hassan (CoRR, 2024)

On the Parallelizability of Approval-Based Committee Rules. - Zack Fitzsimmons; Zohair Raza Hassan; Edith Hemaspaandra (CoRR, 2025)