Refereed Journal Publications:
1.“Proximity problems on line segments spanned by points”,
O. Daescu, J. Luo and D. Mount,
Computational Geometry: Theory & Applications, Vol. 33, No. 3, pp. 115-129, 2006.
2.“Farthest-point queries with geometric and combinatorial constraints”,
O. Daescu, N. Mi, C.-S. Shin and A. Wolff,
Computational Geometry: Theory & Applications, Vol. 33, No. 3, pp. 174-185, 2006.
3.“GARA: A Geometry Aided Routing Algorithm”,
O. Daescu, K. Haridoss and G. Fasui,
Wireless Communications and Mobile Computing, Special Issue onAd Hoc Networks, Vol. 6, No. 2, pp. 259-268, 2006.
4.“Extremal point queries with lines and line segments and related problems”,
O. Daescu and B. Serfling,
Computational Geometry: Theory & Applications, Vol. 32, No. 3, pp. 223-237, 2005.
5.“Polygonal path approximation with angle constraints”,
D.Z. Chen, O. Daescu, J. Hershberger, P.M. Kogge, N. Mi, and J. Snoeyink,
Computational Geometry: Theory & Applications, Vol. 32, No. 3, pp. 173-187, 2005.
6.“Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications”,
D.Z. Chen, O. Daescu, Y. Dai, N. Katoh, X. Wu and J. Xu,
Journal of Combinatorial Optimization, Vol. 9, No. 1, pp. 69-90, 2005.
7.“Polygonal path approximation: a query based approach”,
O. Daescu and N. Mi,
Computational Geometry: Theory & Applications, Vol. 30, No. 1, pp. 41-58, 2005.
8.“Flexible strategies for disk scheduling in multimedia presentation servers”,
S. Emilda, L. Jacob, O. Daescu and B. Prabhakaran,
Multimedia Tools and Applications, Vol. 26, No. 1, pp. 81-99, 2005.
9.“New results on path approximation”,
O. Daescu,
Algorithmica, Special Issue on Shape Algorithmics, Vol. 38, No. 2, pp. 131-143, 2003.
10. “Finding an optimal path without growing the tree,”
D.Z. Chen, O.Daescu, X. Hu and J. Xu,
Journal of Algorithms, Vol. 49, No. 1, pp. 13-41, 2003.
11.“Space-efficient algorithmsfor approximating polygonal curves in two dimensional space”,
D.Z. Chen and O. Daescu,
International Journal of Computational Geometry & Applications, Vol 13, No. 2, pp. 95-111, 2003.
12.“Efficient parallel algorithms for planar st-graphs”,
M.J. Atallah, D.Z. Chen and O.Daescu,
Algorithmica, Vol. 35, No. 3, pp. 194-215, 2003.
13. “Efficiently approximating polygonal paths in three and higher dimensions”,
G. Barequet, D.Z. Chen, O.Daescu, M.T. Goodrich and J.Snoeyink,
Algorithmica, Vol. 33, No. 2, pp. 150-167, 2002.
14. “Determining an optimal penetration among weighted regions in two and threedimensions”,
D.Z. Chen, O. Daescu, X. Hu, X. Wu and J. Xu,
Journal of Combinatorial Optimization, Special Issue on Optimization Problems in Medical Applications, Vol. 5, No. 1, pp. 59-79, 2001.
15. “On geometric path query problems”,
D.Z. Chen, O.Daescu and K.S. Klenk,
International Journal of Computational Geometry & Applications, Vol. 11, No.6, pp. 617-645,2001.
16. “Maintaining visibility of a polygon with a moving point of view”,
D.Z. Chen and O. Daescu,
Information ProcessingLetters, Vol. 65, No. 5, pp. 269-275, 1998.
Refereed Conference Publications:
17.“Finding optimal weighted bridges with applications”,
Ovidiu Daescu and James Palmer,
Proceedings of the 44th ACM Southeast Conference, pp. 12-17, 2006.
18.“K-Link Shortest Paths in Weighted Subdivisions”,
O. Daescu, J.S.B. Mitchell, S. Ntafos, J. Palmer and C.K. Yap,
In Lecture Notes in Computer Science, Vol. 3608, Springer Verlag, Proceedings of the 9th Workshop on Algorithms and Data Structures, pp. 325-337, August 2005.
19.“Cutting Out Polygons”,
R. Chandrasekaran, O. Daescu and J. Luo,
Proceedings of the 17th Canadian Conference on Computational Geometry,pp. 180-183, August 2005.
20.“Proximity Problems on Line Segments Spanned by Points”,
O. Daescu, J. Luo and D. Mount,
Proceedings of the 17th Canadian Conference on Computational Geometry,pp. 224-228, August 2005.
21.“Guarding a Terrain by Two Watchtowers”,
P.K. Agarwal, S. Bereg, O. Daescu, H. Kaplan, S. Ntafos and B. Zhu,
Proceedingsof the 21st Annual Symposium on Computational Geometry, pp. 346-355, June 2005.
22.“1-Link Shortest Paths in Weighted Regions”,
O. Daescu and J.D. Palmer,
Proceedings of the 21st Annual Symposium on Computational Geometry, Multimedia Review of Computational Geometry, pp. 378-379, June 2005.
23.“Stabbing Balls and Simplifying Proteins”,
O. Daescu and J. Luo,
Series in Mathematical Biology and Medicine, Advances in Bioinformatics and its Applications,
Proc. of the International Conference on Bioinformatics and its Applications, Vol. 8, pp. 329-340, May 2005.
24.“Cutting Out Polygons with Lines and Rays”,
O. Daescu and J. Luo,
In Lecture Notes in Computer Science, Vol. 3341, Springer Verlag, Proceedings of the 15th Annual International Symposium on Algorithms and Computation, pp. 669-681, December 2004.
25.“Load Balancing for Reliable Multicast”,
C. Gong, O. Daescu, R. Joti, B. Raghavachari and K. Sarac,
Proceedings of the 3rd IASTED International Conference on Communications, Internet and Information Technology (CIIT), pp. 86-91, November 2004.
26.“Farthest-point queries with geometric and combinatorial constraints”,
O. Daescu, N. Mi, C.-S. Shin and A. Wolff,
Proceedings of the Japan Conference on Discrete and Computational Geometry, October 2004, to appear fall 2005.
27.“GARA: A Geometry Aided Routing Algorithm”,
O. Daescu, K. Haridoss and G. Fasui,
IEEE Proceedings of the Workshop on High Performance Switching and Routing, pp. 224-228, April 2004.
28.“Optimal placement of NAK-suppressing agents for reliable multicast”,
O. Daescu, R. Joti, B. Raghavachari and K. Sarac,
Proceedings of the 19th ACM Symposium on Applied Computing, pp. 334-338, March 2004.
29.“Farthest-point queries with geometric and combinatorial constraints”,
O. Daescu, N. Mi, C.-S. Shin and A. Wolff,
Proceedings of the 20th European Workshop on Computational Geometry, pp 45-48, March 2004.
30.“Polygonal path approximation: a query based approach”,
O. Daescu and N. Mi,
In Lecture Notes in Computer Science, Vol. 2906, Springer Verlag, Proceedings of the 14th Annual International Symposium on Algorithms and Computation, pp. 36-46, December 2003.
31.“Task planning with transportation constraints: approximation bounds, implementations and experiments”,
O. Daescu, D. Soeder and R.N. Uma,
Proceedings of the IEEE International Conference on Robotics and Automation, Vol.3, pp. 3542-3547, September 2003.
32.“Flexible disk scheduling strategies for multimedia presentation servers”,
S. Emilda, L. Jacob, O. Daescu, B. Prabhakaran,
Proceedings of the IEEE International Workshop on Multimedia Signal Processing, pp. 452- 455, December 2002.
33.“Flexible disk scheduling for multimedia presentation servers”,
S. Emilda, L. Jacob, O. Daescu, B. Prabhakaran,
Proceedings of the IEEE International Conference on Networks, pp. 151- 155, August 2002.
34. “Improved optimal weighted links algorithms”,
O. Daescu.
In Lecture Notes in Computer Science, Vol. 2331, Springer Verlag, Proceedings of ICCS, International Workshop on Computational Geometry and Applications, pp. 65-74, April 2002.
35. “Computing optimal trajectories for medical treatment planning and optimization”,
O. Daescu and A. Bhatia,
In Lecture Notes in Computer Science, Vol. 2331, Springer Verlag, Proceedings of ICCS, Computing in Medicine, pp. 227-233, April 2002.
36. “Parallel optimal weighted links”,
O. Daescu,
In Lecture Notes in Computer Science, Vol. 2073, Springer Verlag,
Proceedings of ICCS, International Workshop on Computational Geometry and Applications, pp. 649-657, May 2001.
37. “From experiments to theory: optimal weighted links”,
O. Daescu,
Proceedings of the 17th European Workshop on Computational Geometry, pp. 158-161, March 2001.
38. “Polygonal path approximation with angle constraints”,
D.Z. Chen, O. Daescu, J. Hershberger, P.M. Kogge and J. Snoeyink,
Proceedings of 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 342-343, January 2001.
39. “Optimizing the sum of linear fractional functions and applications”,
D.Z. Chen, O. Daescu, Y. Dai, N. Katoh, X. Wu and J. Xu,
Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 707-716, January 2000.
40. “Determining an optimal penetration among weighted regions in two and three dimensions”,
D.Z. Chen, O. Daescu, X. Hu, X. Wu and J. Xu,
Proceedings of the 15th ACM Symposium on Computational Geometry, pp. 322-331, June 1999.
41. “Finding an optimal path without growing the tree”,
D.Z. Chen, O. Daescu, X. Hu and J. Xu,
In Lecture Notes in Computer Science, Vol. 1461, Springer Verlag, Proceedings of the 6th Annual European Symposium on Algorithms, pp. 356-368, August 1998.
42. “Space-efficient algorithms for approximating polygonal curves in two dimensional space”,
D.Z. Chen and O. Daescu,
In Lecture Notes in Computer Science, Vol. 1449, Springer Verlag, Proceedings of the 4th Annual International Computing and Combinatorics Conference, pp. 55-64, August 1998.
43. “Parallel content-based image analysis on PIM processors”,
O. Daescu, P.M. Kogge and D.Z. Chen,
Proceedings of the IEEE Workshop on Content-Based Access of Image and Video Libraries (CBAIVL'98), pp. 73-77, June 1998.
44. “Efficiently approximating polygonal paths in three and higher dimensions”,
G. Barequet, D.Z. Chen, O. Daescu, M.T. Goodrich and J. Snoeyink,
In Proceedings of the 14th ACM Symposium on Computational Geometry, pp. 317-327,June 1998.
45. “Efficient parallel algorithms for planar st-graphs”,
M.J. Atallah, D.Z. Chen and O. Daescu,
In Lecture Notes in Computer Science, Vol. 1350, Springer Verlag, Proceedings of the 8th Annual International Symposium on Algorithms and Computation, pp. 223-232, December 1997.
46. “On geometric path query problems”,
D.Z. Chen, O. Daescu and K.S. Klenk.
In Lecture Notes in Computer Science, Vol. 1272, Springer Verlag, Proceedings of the Fifth Workshop on Algorithms and Data Structures, pp. 248-257, August 1997.
47. “Maintaining visibility of a polygon with a moving point of view”,
D.Z. Chen and O. Daescu,
Proceedings of the 8h Canadian Conference on Computational Geometry, pp.169-174, August 1996.