☰

Ovidiu Daescu, Ph.D. - Publications

Affiliations: 
2000 University of Notre Dame, Notre Dame, IN, United States 
Area:
Computer Science
Tree Info Similar researchers PubMed Report error

60 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2020 Daescu O, Teo KY. Two-dimensional closest pair problem: A closer look Discrete Applied Mathematics. 287: 85-96. DOI: 10.1016/J.Dam.2020.08.006  0.496
2020 Teo KY, Daescu O, Fox K. Trajectory planning for an articulated probe Computational Geometry. 90: 101655. DOI: 10.1016/J.Comgeo.2020.101655  0.463
2019 Daescu O, Friedrichs S, Malik H, Polishchuk V, Schmidt C. Altitude terrain guarding and guarding uni-monotone polygons Computational Geometry: Theory and Applications. 84: 22-35. DOI: 10.1016/J.Comgeo.2019.07.004  0.453
2015 Armaselu B, Daescu O. Dynamic minimum bichromatic separating circle Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9486: 688-697. DOI: 10.1016/J.Tcs.2016.11.036  0.42
2015 Armaselu B, Daescu O. Algorithms for fair partitioning of convex polygons Theoretical Computer Science. DOI: 10.1016/J.Tcs.2015.08.003  0.51
2015 Bereg S, Daescu O, Zivanic M, Rozario T. Smallest maximum-weight circle for weighted points in the plane Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9156: 244-253. DOI: 10.1007/978-3-319-21407-8_19  0.411
2013 Ju W, Luo J, Zhu B, Daescu O. Largest area convex hull of imprecise data based on axis-aligned squares Journal of Combinatorial Optimization. 26: 832-859. DOI: 10.1007/S10878-012-9488-5  0.461
2013 Ju W, Fan C, Luo J, Zhu B, Daescu O. On some geometric problems of color-spanning sets Journal of Combinatorial Optimization. 26: 266-283. DOI: 10.1007/S10878-012-9458-Y  0.513
2012 Zivanic M, Daescu O, Kurdia A, Goodman SR. The Voronoi diagram for graphs and its application in the Sickle Cell Disease research Journal of Computational Science. 3: 335-343. DOI: 10.1016/J.Jocs.2011.10.006  0.327
2012 Bitner S, Daescu O. Minimum-sum dipolar spanning tree in ℝ 3 Computational Geometry: Theory and Applications. 45: 476-481. DOI: 10.1016/J.Comgeo.2010.09.011  0.481
2011 Cheung YK, Daescu O. Line facility location in weighted regions Journal of Combinatorial Optimization. 22: 52-70. DOI: 10.1007/S10878-009-9272-3  0.434
2011 Daescu O, Ju W, Luo J, Zhu B. Largest area convex hull of axis-aligned squares based on imprecise data Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6842: 192-203. DOI: 10.1007/978-3-642-22685-4_17  0.367
2011 Cheung YK, Daescu O, Zivanic M. Kinetic red-blue minimum separating circle Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6831: 448-463. DOI: 10.1007/978-3-642-22616-8_35  0.337
2010 Agarwal PK, Bereg S, Daescu O, Kaplan H, Ntafos S, Sharir M, Zhu B. Guarding a terrain by two watchtowers Algorithmica (New York). 58: 352-390. DOI: 10.1007/S00453-008-9270-3  0.465
2010 Daescu O, Ju W, Luo J. NP-completeness of spreading colored points Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6508: 41-50. DOI: 10.1007/978-3-642-17458-2_5  0.338
2009 Daescu O, Luo J. Stabbing balls and simplifying proteins. International Journal of Bioinformatics Research and Applications. 5: 64-80. PMID 19136365 DOI: 10.1504/Ijbra.2009.022464  0.413
2009 Daescu O, Kurdia A. Towards an optimal algorithm for recognizing Laman graphs Proceedings of the 42nd Annual Hawaii International Conference On System Sciences, Hicss. DOI: 10.7155/Jgaa.00185  0.424
2009 Cheung YK, Daescu O. Fréchet distance problems in weighted regions Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5878: 97-111. DOI: 10.1142/S1793830910000644  0.473
2009 Daescu O, Palmer J. Minimum separation in weighted subdivisions International Journal of Computational Geometry and Applications. 19: 33-57. DOI: 10.1142/S0218195909002824  0.488
2009 Bitner S, Daescu O. Farthest segments and extremal triangles spanned by points in R3 Information Processing Letters. 109: 1167-1171. DOI: 10.1016/J.Ipl.2009.07.018  0.439
2009 Cheung YK, Daescu O. Line segment facility location in weighted subdivisions Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5564: 100-113. DOI: 10.1007/978-3-642-02158-9_10  0.352
2008 Bitner S, Daescu O. Finding a minimum-sum dipolar spanning tree in ℝ3 Proceedings of the Annual Hawaii International Conference On System Sciences. DOI: 10.1109/HICSS.2008.171  0.369
2008 Daescu O, Luo J. Computing simple paths on points in simple polygons Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4535: 41-55. DOI: 10.1007/978-3-540-89550-3-5  0.304
2008 Daescu O, Mitchell JSB, Ntafos S, Palmer JD, Yap CK. An experimental study of weighted k-link shortest path algorithms Springer Tracts in Advanced Robotics. 47: 187-202. DOI: 10.1007/978-3-540-68405-3_12  0.372
2008 Daescu O, Kurdia A. Polygonal chain simplification with small angle constraints Proceedings of the 20th Annual Canadian Conference On Computational Geometry, Cccg 2008. 191-194.  0.336
2007 Daescu O, Yam KC. Computing a pocket depth descriptor for bio-molecules 2007 Ieee Dallas Engineering in Medicine and Biology Workshop, Dembs. 102-105. DOI: 10.1109/EMBSW.2007.4454184  0.32
2007 Bitner S, Daescu O. Minimum-sum dipolar spanning tree for points in ℝ3 Cccg 2007 - 19th Canadian Conference On Computational Geometry. 81-84.  0.385
2007 Bitner S, Daescu O. Finding segments and triangles spanned by points in ℝ3 Cccg 2007 - 19th Canadian Conference On Computational Geometry. 17-20.  0.338
2006 Daescu O, Luo J. Cutting out polygons with lines and rays International Journal of Computational Geometry and Applications. 16: 227-248. DOI: 10.1142/S0218195906002014  0.477
2006 Daescu O, Luo J, Mount DM. Proximity problems on line segments spanned by points Computational Geometry: Theory and Applications. 33: 115-129. DOI: 10.1016/J.Comgeo.2005.08.007  0.429
2006 Daescu O, Mi N, Shin CS, Wolff A. Farthest-point queries with geometric and combinatorial constraints Computational Geometry: Theory and Applications. 33: 174-185. DOI: 10.1016/J.Comgeo.2005.07.002  0.491
2006 Gong C, Sarac K, Daescu O, Raghavachari B, Jothi R. Load-balanced agent activation for value-added network services Computer Communications. 29: 1905-1916. DOI: 10.1016/J.Comcom.2005.10.035  0.307
2006 Bereg S, Daescu O, Jiang M. A PTAS for cutting out polygons with lines Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4112: 176-185. DOI: 10.1007/S00453-008-9182-2  0.547
2006 Bereg S, Daescu O, Jiang M. A PTAS for cutting out polygons with lines Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4112: 176-185.  0.474
2005 Daescu O, Palmer JD. 1-Link shortest paths in weighted regions Proceedings of the Annual Symposium On Computational Geometry. 378-379. DOI: 10.1145/1064092.1064155  0.338
2005 Agarwal PK, Bereg S, Daescu O, Kaplan H, Ntafos S, Zhu B. Guarding a terrain by two watchtowers Proceedings of the Annual Symposium On Computational Geometry. 346-355. DOI: 10.1145/1064092.1064145  0.362
2005 Daescu O, Serfling R. Extremal point queries with lines and line segments and related problems Computational Geometry: Theory and Applications. 32: 223-237. DOI: 10.1016/J.Comgeo.2005.03.002  0.49
2005 Chen DZ, Daescu O, Hershberger J, Kogge PM, Mi N, Snoeyink J. Polygonal path simplification with angle constraints Computational Geometry: Theory and Applications. 32: 173-187. DOI: 10.1016/J.Comgeo.2004.09.003  0.616
2005 Daescu O, Mi N. Polygonal chain approximation: A query based approach Computational Geometry: Theory and Applications. 30: 41-58. DOI: 10.1016/J.Comgeo.2004.07.001  0.431
2005 Chen DZ, Daescu O, Dai Y, Katoh N, Wu X, Xu J. Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications Journal of Combinatorial Optimization. 9: 69-90. DOI: 10.1007/S10878-005-5485-2  0.639
2005 Daescu O, Mi N, Shin CS, Wolff A. Farthest-point queries with geometric and combinatorial constraints Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3742: 62-75. DOI: 10.1007/11589440_7  0.413
2005 Daescu O, Mitchell JSB, Ntafos S, Palmer JD, Yap CK. k-Link shortest paths in weighted subdivisions Lecture Notes in Computer Science. 3608: 325-337.  0.351
2004 Daescu O, Fasui G, Haridoss K. GARA: A geometry aided routing algorithm Ieee Workshop On High Performance Switching and Routing, Hpsr. 224-228. DOI: 10.1002/wcm.385  0.375
2004 Daescu O, Fasui G, Haridoss K. GARA: A geometry aided routing algorithm Ieee Workshop On High Performance Switching and Routing, Hpsr. 224-228. DOI: 10.1002/Wcm.385  0.465
2004 Gong C, Daescu O, Jothi R, Raghavachari B, Sarac K. Load balancing for reliable multicast 433-121 Proceedings of the Third Iasted International Conference On Communications, Internet, and Information Technology. 86-91.  0.305
2003 Chen DZ, Daescu O. Space-efficient algorithms for approximating polygonal curves in two-dimensional space International Journal of Computational Geometry and Applications. 13: 95-111. DOI: 10.1142/S0218195903001086  0.63
2003 Daescu O. New results on path approximation Algorithmica (New York). 38: 131-143. DOI: 10.1007/S00453-003-1046-1  0.506
2003 Daescu O, Mi N. Polygonal path approximation: A query based approach Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2906: 36-46.  0.371
2002 Barequet G, Chen DZ, Daescu O, Goodrich MT, Snoeyink J. Efficiently Approximating Polygonal Paths in Three and Higher Dimensions Algorithmica. 33: 150-167. DOI: 10.1007/S00453-001-0096-5  0.61
2002 Daescu O. Improved optimal weighted links algorithms Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2331: 65-74.  0.385
2002 Barequet G, Chen DZ, Daescu O, Goodrich MT, Snoeyink J. Efficiently approximating polygonal paths in three and higher dimensions Algorithmica (New York). 33: 150-167.  0.468
2002 Daescu O, Bhatia A. Computing optimal trajectories for medical treatment planning and optimization Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2331: 227-233.  0.319
2001 Chen DZ, Daescu O, Klenk KS. On geometric path query problems International Journal of Computational Geometry and Applications. 11: 617-645. DOI: 10.1142/S0218195901000675  0.606
2001 Chen DZ, Daescu O, Hu X, Wu X, Xu J. Determining an Optimal Penetration among Weighted Regions in Two and Three Dimensions Journal of Combinatorial Optimization. 5: 59-79. DOI: 10.1023/A:1009885517653  0.603
2001 Daescu O. Parallel optimal weighted links Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2073: 649-657. DOI: 10.1007/978-3-642-00212-0_4  0.404
2001 Daescu O. Parallel optimal weighted links Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2073: 649-657.  0.404
1998 Chen DZ, Daescu O, Hu X, Xu J. Finding an optimal path without growing the tree Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1461: 356-367. DOI: 10.1016/S0196-6774(03)00080-4  0.62
1998 Chen DZ, Daescu O. Maintaining visibility of a polygon with a moving point of view Information Processing Letters. 65: 269-275. DOI: 10.1016/S0020-0190(97)00211-1  0.621
1998 Chen DZ, Daescu O. Space-efficient algorithms for approximating polygonal curves in two dimensional space Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1449: 45-55.  0.582
1997 Atallah MJ, Chen DZ, Daescu O. Efficient parallel algorithms for planar st-graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1350: 224-232. DOI: 10.1007/S00453-002-0995-0  0.596
Show low-probability matches.