◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

A. Sepahvand

1 paper here

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

author position
  • last author1

Across the 1 of 1 paper where every author was matched, so the position is known.

fields
  • cs.CC1

identity via Semantic Scholar / OpenAlex

most citedFinding Two Disjoint Simple Paths on Two Sets of Points is NP-Complete

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

collaborators

1 paper

cs.CC2017★ 6 cited

Finding Two Disjoint Simple Paths on Two Sets of Points is NP-Complete

Mohammadreza Razzazi, Abdolah Sepahvand

Finding two disjoint simple paths on two given sets of points is a geometric problem introduced by Jeff Erickson. This problem has various applications in computational geometry, l…

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