pith. sign in

Ovidiu Daescu

Identifiers

  • name variant Ovidiu Daescu 0.60 · backfill

Papers (13)

  1. Grow-Prune-Freeze Networks: Adaptive & Continual Learning Technique for Olfactory Navigation cs.LG · 2026 · author #2
  2. BiScale-GTR: Fragment-Aware Graph Transformers for Multi-Scale Molecular Representation Learning cs.LG · 2026 · author #2
  3. Chasing Ghosts: A Simulation-to-Real Olfactory Navigation Stack with Optional Vision Augmentation cs.RO · 2026 · author #2
  4. Edge Disjoint Spanning Trees in an Undirected Graph with E=2(V-1) cs.DS · 2018 · author #2
  5. Does a robot path have clearance c? cs.CG · 2018 · author #1
  6. k-Maximum Subarrays for Small k: Divide-and-Conquer made simpler cs.DS · 2018 · author #2
  7. Altitude Terrain Guarding and Guarding Uni-Monotone Polygons cs.CG · 2018 · author #1
  8. Maximum Area Rectangle Separating Red and Blue Points cs.CG · 2017 · author #2
  9. Approximation Algorithms for the Maximum Profit Pick-up Problem with Time Windows and Capacity Constraint cs.DS · 2016 · author #2
  10. Minimum Sum Dipolar Spanning Tree in R^3 cs.CG · 2010 · author #2
  11. Fr\'echet Distance Problems in Weighted Regions cs.CG · 2010 · author #2
  12. Approximate Point-to-Face Shortest Paths in R^3 cs.CG · 2010 · author #2
  13. Towards an optimal algorithm for recognizing Laman graphs math.CO · 2008 · author #1

Mentions

  • 2605.25170 #2 · arxiv_oai · confidence 0.70 Ovidiu Daescu
  • 1007.1222 #2 · backfill · confidence 0.70 Ovidiu Daescu
  • 1004.4901 #2 · backfill · confidence 0.70 Ovidiu Daescu
  • 1004.1588 #2 · backfill · confidence 0.70 Ovidiu Daescu
  • 0801.2404 #1 · backfill · confidence 0.70 Ovidiu Daescu

Frequent Coauthors