◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Ovidiu Daescu

4 papers here

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

author position
  • first author1
  • last author3

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

fields
  • cs.CG3
  • math.CO1
ORCID 0000-0002-0278-4174

identity via Semantic Scholar / OpenAlex

most citedApproximate Point-to-Face Shortest Paths in R^3

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

collaborators
Showing math.COShow all

1 paper · 1 filter

math.CO2008★ 1 cited

Towards an optimal algorithm for recognizing Laman graphs

Ovidiu Daescu, Anastasia Kurdia

Laman graphs are fundamental to rigidity theory. A graph G with n vertices and m edges is a generic minimally rigid graph (Laman graph), if m=2n-3 and every induced subset of k ver…

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