◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Babak Farzad

6 papers hereh-index 9196 citations25 works total

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

author position
  • first author3
  • middle author3

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

fields
  • cs.DM2
  • math.CO2
  • cs.SI1
  • nlin.CG1

identity via Semantic Scholar / OpenAlex

activity
20092020
most citedSquare-Root Finding Problem In Graphs, A Complete Dichotomy Theorem

10 citations · 14 across the 6 of their papers we have counts for

collaborators
Showing 2012Show all

1 paper · 1 filter

cs.DM2012★ 10 cited

Square-Root Finding Problem In Graphs, A Complete Dichotomy Theorem

Babak Farzad, Majid Karimi

Graph G is the square of graph H if two vertices x,y have an edge in G if and only if x,y are of distance at most two in H. Given H it is easy to compute its square H^2. Determinin…

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