papers
Publications (10)
cs.CG2019
Altitude Terrain Guarding and Guarding Uni-Monotone Polygons
Ovidiu Daescu, Stephan Friedrichs, Hemant Malik +2
cs.CG2010
Approximate Point-to-Face Shortest Paths in R^3
Yam Ki Cheung, Ovidiu Daescu
cs.DS2016
Approximation Algorithms for the Maximum Profit Pick-up Problem with Time Windows and Capacity Constraint
Bogdan Armaselu, Ovidiu Daescu
cs.DS2018
k-Maximum Subarrays for Small k: Divide-and-Conquer made simpler
Hemant Malik, Ovidiu Daescu
math.CO2008
Towards an optimal algorithm for recognizing Laman graphs
Ovidiu Daescu, Anastasia Kurdia
cs.CG2017
Maximum Area Rectangle Separating Red and Blue Points
Bogdan Armaselu, Ovidiu Daescu
cs.CG2010
Minimum Sum Dipolar Spanning Tree in R^3
Steven Bitner, Ovidiu Daescu
cs.DS2018
Edge Disjoint Spanning Trees in an Undirected Graph with E=2(V-1)
Hemant Malik, Ovidiu Daescu, Ramaswamy Chandrasekaran
cs.CG2018
Does a robot path have clearance c?
Ovidiu Daescu, Hemant Malik
cs.CG2010
Fréchet Distance Problems in Weighted Regions
Yam Ki Cheung, Ovidiu Daescu