◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

O. Daescu

19 papers hereh-index 211.5k citations169 works total

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

author position
  • first author5
  • middle author3
  • last author11

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

fields
  • cs.CG9
  • cs.RO4
  • cs.DS3
  • cs.LG2
  • cs.AI1

identity via Semantic Scholar / OpenAlex

activity
20102026
most citedMaximum Area Rectangle Separating Red and Blue Points

3 citations · 13 across the 19 of their papers we have counts for

collaborators
Showing 2016Show all

1 paper · 1 filter

cs.DS2016★ 2 cited

Approximation Algorithms for the Maximum Profit Pick-up Problem with Time Windows and Capacity Constraint

Bogdan Armaselu, Ovidiu Daescu

In this paper, we study the Maximum Profit Pick-up Problem with Time Windows and Capacity Constraint (MP-PPTWC). Our main results are 3 polynomial time algorithms, all having const…

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