Ovidiu Daescu

Steven Bitner, Ovidiu Daescu: Minimum-sum dipolar spanning tree in R³. Comput. Geom. 45(9): 476-481 (2012)

Marko Zivanic, Ovidiu Daescu, Anastasia Kurdia, S. R. Goodman: The Voronoi diagram for graphs and its application in the Sickle Cell Disease research. J. Comput. Science 3(5): 335-343 (2012)

Weili Wu, Ovidiu Daescu: Preface. Theor. Comput. Sci. 447: 1 (2012)

Yam Ki Cheung, Ovidiu Daescu, J. Steven Kirtzic, Lech Papiez: Volume matching with application in medical treatment planning. ICCABS 2012: 1-6

Yam Ki Cheung, Ovidiu Daescu: Line facility location in weighted regions. J. Comb. Optim. 22(1): 52-70 (2011)

Yam Ki Cheung, Ovidiu Daescu, Lech Papiez: Volume matching with application in medical treatment planning. BCB 2011: 487-489

Sairam Behera, Ovidiu Daescu, Lech Papiez: Optimal delivery of volumetric modulated arc therapy (VMAT) for moving target. BIBM Workshops 2011: 297-304

Marko Zivanic, Ovidiu Daescu, Anastasia Kurdia: Rigid region pairwise sequence alignment. BIBM Workshops 2011: 319-326

Yam Ki Cheung, Ovidiu Daescu, Marko Zivanic: Kinetic Red-Blue Minimum Separating Circle. COCOA 2011: 448-463

Ovidiu Daescu, Wenqi Ju, Jun Luo, Binhai Zhu: Largest Area Convex Hull of Axis-Aligned Squares Based on Imprecise Data. COCOON 2011: 192-203

J. Steven Kirtzic, Ovidiu Daescu: Face It: 3D Facial Reconstruction from a Single 2D Image for Games and Simulations. CW 2011: 244-248

Pankaj K. Agarwal, Sergey Bereg, Ovidiu Daescu, Haim Kaplan, Simeon C. Ntafos, Micha Sharir, Binhai Zhu: Guarding a Terrain by Two Watchtowers. Algorithmica 58(2): 352-390 (2010)

Yam Ki Cheung, Ovidiu Daescu: FréChet Distance Problems in Weighted Regions. Discrete Math., Alg. and Appl. 2(2): 161-180 (2010)

Ovidiu Daescu, Wenqi Ju, Jun Luo: NP-Completeness of Spreading Colored Points. COCOA (1) 2010: 41-50

Steven Bitner, Yam Ki Cheung, Ovidiu Daescu: Minimum Separating Circle for Bichromatic Points in the Plane. ISVD 2010: 50-55

Steven Bitner, Yam Ki Cheung, Atlas F. Cook, Ovidiu Daescu, Anastasia Kurdia, Carola Wenk: Visiting a Sequence of Points with a Bevel-Tip Needle. LATIN 2010: 492-502

Robert Finis Anderson, J. Steven Kirtzic, Ovidiu Daescu: Applying Parallel Design Techniques to Template Matching with GPUs. VECPAR 2010: 456-468

Weili Wu, Ovidiu Daescu (Eds.): Combinatorial Optimization and Applications - 4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part I. Lecture Notes in Computer Science 6508, Springer 2010, isbn 978-3-642-17457-5

Weili Wu, Ovidiu Daescu (Eds.): Combinatorial Optimization and Applications - 4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part II. Lecture Notes in Computer Science 6509, Springer 2010, isbn 978-3-642-17460-5

Yam Ki Cheung, Ovidiu Daescu: Approximate Point-to-Face Shortest Paths in R^3. CoRR abs/1004.1588 (2010)

Yam Ki Cheung, Ovidiu Daescu: Fréchet Distance Problems in Weighted Regions. CoRR abs/1004.4901 (2010)

Steven Bitner, Ovidiu Daescu: Minimum Sum Dipolar Spanning Tree in R^3. CoRR abs/1007.1222 (2010)

Sergey Bereg, Ovidiu Daescu, Minghui Jiang: A PTAS for Cutting Out Polygons with Lines. Algorithmica 53(2): 157-171 (2009)

Ovidiu Daescu, Jun Luo: Stabbing balls and simplifying proteins. IJBRA 5(1): 64-80 (2009)

Ovidiu Daescu, James D. Palmer: Minimum Separation in Weighted Subdivisions. Int. J. Comput. Geometry Appl. 19(1): 33-57 (2009)

Steven Bitner, Ovidiu Daescu: Farthest segments and extremal triangles spanned by points in R³. Inf. Process. Lett. 109(20): 1167-1171 (2009)

Ovidiu Daescu, Anastasia Kurdia: Towards an optimal algorithm for recognizing Laman graphs. J. Graph Algorithms Appl. 13(2): 219-232 (2009)

Ovidiu Daescu, Yam Ki Cheung, James D. Palmer: Parallel Optimal Weighted Links. Transactions on Computational Science 3: 66-81 (2009)

Yam Ki Cheung, Ovidiu Daescu: Line Segment Facility Location in Weighted Subdivisions. AAIM 2009: 100-113

Ovidiu Daescu, Anastasia Kurdia: Towards an Optimal Algorithm for Recognizing Laman Graphs. HICSS 2009: 1-10

Yam Ki Cheung, Ovidiu Daescu: Fréchet Distance Problems in Weighted Regions. ISAAC 2009: 97-111

Ovidiu Daescu, Anastasia Kurdia: Polygonal chain simplification for flight simulation systems. SpringSim 2009

Yam Ki Cheung, Ovidiu Daescu: Line Facility Location in Weighted Regions. AAIM 2008: 109-119

Yam Ki Cheung, Ovidiu Daescu, Anastasia Kurdia: A New Modeling for Finding Optimal Weighted Distances. BIOTECHNO 2008: 41-46

Ovidiu Daescu, Anastasia Kurdia: Polygonal Chain Simplification with Small Angle Constraints. CCCG 2008

Lichen Bao, Sergey Bereg, Ovidiu Daescu, Simeon C. Ntafos, Junqiang Zhou: On Some City Guarding Problems. COCOON 2008: 600-610

Steven Bitner, Ovidiu Daescu: Finding a Minimum-Sum Dipolar Spanning Tree in R3. HICSS 2008: 469

Ovidiu Daescu, James D. Palmer: Modeling Optimal Beam Treatment with Weighted Regions for Bio-medical Applications. Generalized Voronoi Diagram 2008: 215-232

Rita Casadio, Ovidiu Daescu, Cosmin Dini, Daniela Stan Raicu (Eds.): International Conference on Biocomputation, Bioinformatics, and Biomedical Technologies, BIOTECHNO 2008, June 29 - July 5, 2008, Bucharest, Romania. IEEE Computer Society 2008, isbn 978-0-7695-3191-5

Steven Bitner, Ovidiu Daescu: Finding Segments and Triangles Spanned by Points in R³. CCCG 2007: 17-20

Steven Bitner, Ovidiu Daescu: Minimum-sum Dipolar Spanning Tree for Points in R³. CCCG 2007: 81-84

Ovidiu Daescu, Jun Luo: Computing Simple Paths on Points in Simple Polygons. KyotoCGGT 2007: 41-55

Chao Gong, Kamil Saraç, Ovidiu Daescu, Balaji Raghavachari, Raja Jothi: Load-balanced agent activation for value-added network services. Computer Communications 29(11): 1905-1916 (2006)

Ovidiu Daescu, Jun Luo, David M. Mount: Proximity problems on line segments spanned by points. Comput. Geom. 33(3): 115-129 (2006)

Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexander Wolff: Farthest-point queries with geometric and combinatorial constraints. Comput. Geom. 33(3): 174-185 (2006)

Ovidiu Daescu, Jun Luo: Cutting out Polygons with Lines and Rays. Int. J. Comput. Geometry Appl. 16(2-3): 227-248 (2006)

Ovidiu Daescu, Gheorghe Fasui, Karthik Haridoss: GARA: a geometry aided routing algorithm. Wireless Communications and Mobile Computing 6: 259-268 (2006)

Ovidiu Daescu, James D. Palmer: Finding optimal weighted bridges with applications. ACM Southeast Regional Conference 2006: 12-17

Sergey Bereg, Ovidiu Daescu, Minghui Jiang: A PTAS for Cutting Out Polygons with Lines. COCOON 2006: 176-185

Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap: Approximating minimum-cost polygonal paths of bounded number of links in weighted subdivisions. Symposium on Computational Geometry 2006: 483-484

Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap: An Experimental Study of Weighted k-Link Shortest Path Algorithms. WAFR 2006: 187-202

Ovidiu Daescu, Ningfang Mi: Polygonal chain approximation: a query based approach. Comput. Geom. 30(1): 41-58 (2005)

Danny Z. Chen, Ovidiu Daescu, John Hershberger, Peter M. Kogge, Ningfang Mi, Jack Snoeyink: Polygonal path simplification with angle constraints. Comput. Geom. 32(3): 173-187 (2005)

Ovidiu Daescu, Robert Serfling: Extremal point queries with lines and line segments and related problems. Comput. Geom. 32(3): 223-237 (2005)

Danny Z. Chen, Ovidiu Daescu, Yang Dai, Naoki Katoh, Xiaodong Wu, Jinhui Xu: Efficient Algorithms and Implementations for Optimizing the Sum of Linear Fractional Functions, with Applications. J. Comb. Optim. 9(1): 69-90 (2005)

S. Emilda, L. Jacob, Ovidiu Daescu, B. Prabhakaran: Flexible Strategies for Disk Scheduling in Multimedia Presentation Servers. Multimedia Tools Appl. 26(1): 81-99 (2005)

Ramaswamy Chandrasekaran, Ovidiu Daescu, Jun Luo: Cutting Out Polygons. CCCG 2005: 183-186

Ovidiu Daescu, Jun Luo, David M. Mount: Proximity Problems on Line Segments Spanned by Points. CCCG 2005: 227-231

Pankaj K. Agarwal, Sergey Bereg, Ovidiu Daescu, Haim Kaplan, Simeon C. Ntafos, Binhai Zhu: Guarding a terrain by two watchtowers. Symposium on Computational Geometry 2005: 346-355

Ovidiu Daescu, James D. Palmer: 1-link shortest paths in weighted regions. Symposium on Computational Geometry 2005: 378-379

Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap: k-Link Shortest Paths in Weighted Subdivisions. WADS 2005: 325-337

Chao Gong, Ovidiu Daescu, Raja Jothi, Balaji Raghavachari, Kamil Saraç: Load balancing for reliable multicast. Communications, Internet, and Information Technology 2004: 86-91

Ovidiu Daescu, Jun Luo: Cutting Out Polygons with Lines and Rays. ISAAC 2004: 669-680

Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexander Wolff: Farthest-Point Queries with Geometric and Combinatorial Constraints. JCDCG 2004: 62-75

Ovidiu Daescu, Raja Jothi, Balaji Raghavachari, Kamil Saraç: Optimal placement of NAK-suppressing agents for reliable multicast: a partial deployment case. SAC 2004: 334-338

Mikhail J. Atallah, Danny Z. Chen, Ovidiu Daescu: Efficient Parallel Algorithms for Planar st-Graphs. Algorithmica 35(3): 194-215 (2003)

Ovidiu Daescu: New Results on Path Approximation. Algorithmica 38(1): 131-143 (2003)

Danny Z. Chen, Ovidiu Daescu: Space-Efficient Algorithms for Approximating Polygonal Curves in Two-Dimensional Space. Int. J. Comput. Geometry Appl. 13(2): 95-111 (2003)

Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu: Finding an optimal path without growing the tree. J. Algorithms 49(1): 13-41 (2003)

Ovidiu Daescu, Derek Soeder, R. N. Uma: Task planning with transportation constraints: approximation bounds, implementation and experiments. ICRA 2003: 3542-3547

Ovidiu Daescu, Ningfang Mi: Polygonal Path Approximation: A Query Based Approach. ISAAC 2003: 36-46

Gill Barequet, Danny Z. Chen, Ovidiu Daescu, Michael T. Goodrich, Jack Snoeyink: Efficiently Approximating Polygonal Paths in Three and Higher Dimensions. Algorithmica 33(2): 150-167 (2002)

S. Emilda, L. Jacob, Ovidiu Daescu, B. Prabhakaran: Flexible disk scheduling for multimedia presentation servers. IEEE Workshop on Multimedia Signal Processing 2002: 452-455

Ovidiu Daescu: Improved Optimal Weighted Links Algorithms. International Conference on Computational Science (3) 2002: 65-74

Ovidiu Daescu, Ashish Bhatia: Computing Optimal Trajectories for Medical Treatment Planning and Optimization. International Conference on Computational Science (3) 2002: 227-233

Danny Z. Chen, Ovidiu Daescu, Kevin S. Klenk: On Geometric Path Query Problems. Int. J. Comput. Geometry Appl. 11(6): 617-645 (2001)

Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Xiaodong Wu, Jinhui Xu: Determining an Optimal Penetration Among Weighted Regions in Two and Three Dimensions. J. Comb. Optim. 5(1): 59-79 (2001)

Ovidiu Daescu: Parallel Optimal Weighted Links. International Conference on Computational Science (1) 2001: 649-657

Danny Z. Chen, Ovidiu Daescu, John Hershberger, Peter M. Kogge, Jack Snoeyink: Polygonal path approximation with angle constraints. SODA 2001: 342-343

Danny Z. Chen, Ovidiu Daescu, Yang Dai, Naoki Katoh, Xiaodong Wu, Jinhui Xu: Optimizing the sum of linear fractional functions and applications. SODA 2000: 707-716

Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Xiaodong Wu, Jinhui Xu: Determining an Optimal Penetration Among Weighted Regions in Two and Three Dimensions. Symposium on Computational Geometry 1999: 322-331

Danny Z. Chen, Ovidiu Daescu: Maintaining Visibility of a Polygon with a Moving Point of View. Inf. Process. Lett. 65(5): 269-275 (1998)

Danny Z. Chen, Ovidiu Daescu: Space-Efficient Algorithms for Approximating Polygonal Curves in Two Dimensional Space. COCOON 1998: 45-54

Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu: Finding an Optimal Path without Growing the Tree. ESA 1998: 356-367

Danny Z. Chen, Ovidiu Daescu, Kevin S. Klenk: On Geometric Path Query Problems. WADS 1997: 248-257

Danny Z. Chen, Ovidiu Daescu: Maintaining Visibility of a Polygon with a Moving Point of View. CCCG 1996: 240-245