◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Ruzayn Quaddoura

3 papers hereh-index 385 citations15 works total

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

author position
  • sole author1
  • first author1
  • middle author1

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

fields
  • cs.CR1
  • cs.DM1
  • cs.DS1

identity via Semantic Scholar / OpenAlex

most citedInternet of Things Protection and Encryption: A Survey

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

collaborators
Showing cs.DMShow all

1 paper · 1 filter

cs.DM2014

An O(n) Time Algorithm For Maximum Induced Matching In Bipartite Star_123-free Graphs

Ruzayn Quaddoura

A matching in a graph is a set of edges no two of which share a common vertex. A matching M is an induced matching if no edge connects two edges of M. The problem of finding a maxi…

◍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.