◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Mudassir Shabbir

Rutgers

25 papers hereh-index 15679 citations72 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • middle author19
  • last author5

Across the 24 of 25 papers where every author was matched, so the position is known.

fields
  • cs.LG7
  • eess.SY6
  • math.CO3
  • cs.DM2
  • cs.SI2
  • cs.CC1
affiliations
  • Rutgers
  • ITU
  • LANL;Vanderbilt

identity via Semantic Scholar / OpenAlex

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

11 citations · 19 across the 17 of their papers we have counts for

collaborators
Showing cs.CCShow all

1 paper · 1 filter

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.

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.