activity
20132026
most citedSEMOUR: A Scripted Emotional Speech Repository for Urdu

11 citations · 36 across the 27 of their papers we have counts for

collaborators

30 papers

math.CO2026

On the number of generalized cospectral mates of graphs

Muhammad Raza, Obaid Ullah Ahmad, Mudassir Shabbir +1

This paper establishes an upper bound on the number of generalized cospectral mates of simple graphs, where the generalized spectrum consists of the spectrum of a graph and its com…

cs.LG2025

Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning

Anwar Said, Yifan Wei, Obaid Ullah Ahmad +3

In this article, we utilize the concept of average controllability in graphs, along with a novel rank encoding method, to enhance the performance of Graph Neural Networks (GNNs) in…

math.CO2025

Walk Matrix-Based Upper Bounds on Generalized Cospectral Mates

Muhammad Raza, Mudassir Shabbir, Waseem Abbas

The problem of characterizing graphs determined by their spectrum (DS) or generalized spectrum (DGS) has been a longstanding topic of interest in spectral graph theory, originating…

math.CO2025

An upper bound on generalized cospectral mates of oriented hraphs using skew-walk matrices

Muhammad Raza, Obaid Ullah Ahmed, Mudassir Shabbir +2

Let be an oriented graph with skew-adjacency matrix . Two oriented graphs and are said to share the same generalized skew spectrum if and have the s…

cs.LG2025

Learning Backbones: Sparsifying Graphs through Zero Forcing for Effective Graph-Based Learning

Obaid Ullah Ahmad, Anwar Said, Mudassir Shabbir +2

This paper introduces a novel framework for graph sparsification that preserves the essential learning attributes of original graphs, improving computational efficiency and reducin…

cs.LG2024

Improving Graph Machine Learning Performance Through Feature Augmentation Based on Network Control Theory

Anwar Said, Obaid Ullah Ahmad, Waseem Abbas +2

Network control theory (NCT) offers a robust analytical framework for understanding the influence of network topology on dynamic behaviors, enabling researchers to decipher how cer…

cs.LG2024

Control-based Graph Embeddings with Data Augmentation for Contrastive Learning

Obaid Ullah Ahmad, Anwar Said, Mudassir Shabbir +2

In this paper, we study the problem of unsupervised graph representation learning by harnessing the control properties of dynamical networks defined on graphs. Our approach introdu…

cs.SI2023

Enhanced Graph Neural Networks with Ego-Centric Spectral Subgraph Embeddings Augmentation

Anwar Said, Mudassir Shabbir, Tyler Derr +2

Graph Neural Networks (GNNs) have shown remarkable merit in performing various learning-based tasks in complex networks. The superior performance of GNNs often correlates with the…

cs.LG2023★ 2 cited

A Survey of Graph Unlearning

Anwar Said, Ngoc N. Tran, Yuying Zhao +4

Graph unlearning emerges as a crucial advancement in the pursuit of responsible AI, providing the means to remove sensitive data traces from trained models, thereby upholding the \…

eess.SY2023

Controllability Backbone in Networks

Obaid Ullah Ahmad, Waseem Abbas, Mudassir Shabbir

This paper studies the controllability backbone problem in dynamical networks defined over graphs. The main idea of the controllability backbone is to identify a small subset of ed…

cs.LG2023

Learning-Based Heuristic for Combinatorial Optimization of the Minimum Dominating Set Problem using Graph Convolutional Networks

Abihith Kothapalli, Mudassir Shabbir, Xenofon Koutsoukos

A dominating set of a graph is a subset of vertices such that every vertex outside the dominating set is…

cs.LG2023★ 9 cited

NeuroGraph: Benchmarks for Graph Machine Learning in Brain Connectomics

Anwar Said, Roza G. Bayrak, Tyler Derr +4

Machine learning provides a valuable tool for analyzing high-dimensional functional neuroimaging data, and is proving effective in predicting various neurological conditions, psych…

cs.CR2023★ 1 cited

Sequential Graph Neural Networks for Source Code Vulnerability Identification

Ammar Ahmed, Anwar Said, Mudassir Shabbir +1

Vulnerability identification constitutes a task of high importance for cyber security. It is quite helpful for locating and fixing vulnerable functions in large applications. Howev…

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.SD2021★ 11 cited

SEMOUR: A Scripted Emotional Speech Repository for Urdu

Nimra Zaheer, Obaid Ullah Ahmad, Ammar Ahmed +2

Designing reliable Speech Emotion Recognition systems is a complex task that inevitably requires sufficient data for training purposes. Such extensive datasets are currently availa…

eess.SY2021

Edge Augmentation with Controllability Constraints in Directed Laplacian Networks

Waseem Abbas, Mudassir Shabbir, Yasin Yazıcıoglu +1

In this paper, we study the maximum edge augmentation problem in directed Laplacian networks to improve their robustness while preserving lower bounds on their strong structural 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.

eess.SY2020

Interplay Between Resilience and Accuracy in Resilient Vector Consensus in Multi-Agent Networks

Waseem Abbas, Mudassir Shabbir, Jiani Li +1

In this paper, we study the relationship between resilience and accuracy in the resilient distributed multi-dimensional consensus problem. We consider a network of agents, each of…

eess.SY2020

Strong Structural Controllability of Diffusively Coupled Networks: Comparison of Bounds Based on Distances and Zero Forcing

Yasin Yazicioglu, Mudassir Shabbir, Waseem Abbas +1

We study the strong structural controllability (SSC) of diffusively coupled networks, where the external control inputs are injected to only some nodes, namely the leaders. For suc…

eess.SY2020

Improving Network Robustness through Edge Augmentation While Preserving Strong Structural Controllability

Waseem Abbas, Mudassir Shabbir, Hassan Jaleel +1

In this paper, we consider a network of agents with Laplacian dynamics, and study the problem of improving network robustness by adding a maximum number of edges within the network…

eess.SY2020

Resilient Distributed Vector Consensus Using Centerpoints

Waseem Abbas, Mudassir Shabbir, Jiani Li +1

In this paper, we study the resilient vector consensus problem in networks with adversarial agents and improve resilience guarantees of existing algorithms. A common approach to ac…

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…

cs.SI2019

Combinatorial Trace Method for Network Immunization

Muhammad Ahmad, Sarwan Ali, Juvaria Tariq +3

Immunizing a subset of nodes in a network - enabling them to identify and withstand the spread of harmful content - is one of the most effective ways to counter the spread of malic…

eess.SY2019

Computation of the Distance-based Bound on Strong Structural Controllability in Networks

Mudassir Shabbir, Waseem Abbas, A. Yasin Yazicioglu +1

In this paper, we study the problem of computing a tight lower bound on the dimension of the strong structurally controllable subspace (SSCS) in networks with Laplacian dynamics. T…