◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

S. Faour

4 papers hereh-index 360 citations7 works total

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

author position
  • first author4

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

fields
  • cs.DS4
same name
  • S. Faour — 1 paper, h 2

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20202025
most citedLocal Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond

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

collaborators
Showing 2020 · cs.DSShow all

1 paper · 2 filters

cs.DS2020

Approximate Bipartite Vertex Cover in the CONGEST Model

Salwa Faour, Fabian Kuhn

We give efficient distributed algorithms for the minimum vertex cover problem in bipartite graphs in the CONGEST model. From Kőnig's theorem, it is well known that in bipartite gra…

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