|
Search the dblp DataBase
Ovidiu Daescu:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Ovidiu Daescu, James D. Palmer
Finding optimal weighted bridges with applications. [Citation Graph (0, 0)][DBLP] ACM Southeast Regional Conference, 2006, pp:12-17 [Conf]
- S. Emilda, L. Jacob, Ovidiu Daescu, B. Prabhakaran
Flexible disk scheduling for multimedia presentation servers. [Citation Graph (0, 0)][DBLP] IEEE Workshop on Multimedia Signal Processing, 2002, pp:452-455 [Conf]
- Ramaswamy Chandrasekaran, Ovidiu Daescu, Jun Luo
Cutting Out Polygons. [Citation Graph (0, 0)][DBLP] CCCG, 2005, pp:183-186 [Conf]
- Danny Z. Chen, Ovidiu Daescu
Maintaining Visibility of a Polygon with a Moving Point of View. [Citation Graph (0, 0)][DBLP] CCCG, 1996, pp:240-245 [Conf]
- Ovidiu Daescu, Jun Luo, David M. Mount
Proximity Problems on Line Segments Spanned by Points. [Citation Graph (0, 0)][DBLP] CCCG, 2005, pp:227-231 [Conf]
- Sergey Bereg, Ovidiu Daescu, Minghui Jiang
A PTAS for Cutting Out Polygons with Lines. [Citation Graph (0, 0)][DBLP] COCOON, 2006, pp:176-185 [Conf]
- Danny Z. Chen, Ovidiu Daescu
Space-Efficient Algorithms for Approximating Polygonal Curves in Two Dimensional Space. [Citation Graph (0, 0)][DBLP] COCOON, 1998, pp:45-54 [Conf]
- Pankaj K. Agarwal, Sergey Bereg, Ovidiu Daescu, Haim Kaplan, Simeon C. Ntafos, Binhai Zhu
Guarding a terrain by two watchtowers. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2005, pp:346-355 [Conf]
- Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Xiaodong Wu, Jinhui Xu
Determining an Optimal Penetration Among Weighted Regions in Two and Three Dimensions. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1999, pp:322-331 [Conf]
- 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. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2006, pp:483-484 [Conf]
- Ovidiu Daescu, James D. Palmer
1-link shortest paths in weighted regions. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2005, pp:378-379 [Conf]
- Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
Finding an Optimal Path without Growing the Tree. [Citation Graph (0, 0)][DBLP] ESA, 1998, pp:356-367 [Conf]
- Ovidiu Daescu
Parallel Optimal Weighted Links. [Citation Graph (0, 0)][DBLP] International Conference on Computational Science (1), 2001, pp:649-657 [Conf]
- Ovidiu Daescu
Improved Optimal Weighted Links Algorithms. [Citation Graph (0, 0)][DBLP] International Conference on Computational Science (3), 2002, pp:65-74 [Conf]
- Ovidiu Daescu, Ashish Bhatia
Computing Optimal Trajectories for Medical Treatment Planning and Optimization. [Citation Graph (0, 0)][DBLP] International Conference on Computational Science (3), 2002, pp:227-233 [Conf]
- Ovidiu Daescu, Derek Soeder, R. N. Uma
Task planning with transportation constraints: approximation bounds, implementation and experiments. [Citation Graph (0, 0)][DBLP] ICRA, 2003, pp:3542-3547 [Conf]
- Ovidiu Daescu, Jun Luo
Cutting Out Polygons with Lines and Rays. [Citation Graph (0, 0)][DBLP] ISAAC, 2004, pp:669-680 [Conf]
- Ovidiu Daescu, Ningfang Mi
Polygonal Path Approximation: A Query Based Approach. [Citation Graph (0, 0)][DBLP] ISAAC, 2003, pp:36-46 [Conf]
- Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexander Wolff
Farthest-Point Queries with Geometric and Combinatorial Constraints. [Citation Graph (0, 0)][DBLP] JCDCG, 2004, pp:62-75 [Conf]
- Ovidiu Daescu, Raja Jothi, Balaji Raghavachari, Kamil Saraç
Optimal placement of NAK-suppressing agents for reliable multicast: a partial deployment case. [Citation Graph (0, 0)][DBLP] SAC, 2004, pp:334-338 [Conf]
- Danny Z. Chen, Ovidiu Daescu, Yang Dai, Naoki Katoh, Xiaodong Wu, Jinhui Xu
Optimizing the sum of linear fractional functions and applications. [Citation Graph (0, 0)][DBLP] SODA, 2000, pp:707-716 [Conf]
- Danny Z. Chen, Ovidiu Daescu, John Hershberger, Peter M. Kogge, Jack Snoeyink
Polygonal path approximation with angle constraints. [Citation Graph (0, 0)][DBLP] SODA, 2001, pp:342-343 [Conf]
- Danny Z. Chen, Ovidiu Daescu, Kevin S. Klenk
On Geometric Path Query Problems. [Citation Graph (0, 0)][DBLP] WADS, 1997, pp:248-257 [Conf]
- Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap
k-Link Shortest Paths in Weighted Subdivisions. [Citation Graph (0, 0)][DBLP] WADS, 2005, pp:325-337 [Conf]
- Chao Gong, Ovidiu Daescu, Raja Jothi, Balaji Raghavachari, Kamil Saraç
Load balancing for reliable multicast. [Citation Graph (0, 0)][DBLP] Communications, Internet, and Information Technology, 2004, pp:86-91 [Conf]
- Mikhail J. Atallah, Danny Z. Chen, Ovidiu Daescu
Efficient Parallel Algorithms for Planar st-Graphs. [Citation Graph (0, 0)][DBLP] Algorithmica, 2003, v:35, n:3, pp:194-215 [Journal]
- Gill Barequet, Danny Z. Chen, Ovidiu Daescu, Michael T. Goodrich, Jack Snoeyink
Efficiently Approximating Polygonal Paths in Three and Higher Dimensions. [Citation Graph (0, 0)][DBLP] Algorithmica, 2002, v:33, n:2, pp:150-167 [Journal]
- Ovidiu Daescu
New Results on Path Approximation. [Citation Graph (0, 0)][DBLP] Algorithmica, 2003, v:38, n:1, pp:131-143 [Journal]
- Chao Gong, Kamil Saraç, Ovidiu Daescu, Balaji Raghavachari, Raja Jothi
Load-balanced agent activation for value-added network services. [Citation Graph (0, 0)][DBLP] Computer Communications, 2006, v:29, n:11, pp:1905-1916 [Journal]
- Danny Z. Chen, Ovidiu Daescu, John Hershberger, Peter M. Kogge, Ningfang Mi, Jack Snoeyink
Polygonal path simplification with angle constraints. [Citation Graph (0, 0)][DBLP] Comput. Geom., 2005, v:32, n:3, pp:173-187 [Journal]
- Ovidiu Daescu, Jun Luo, David M. Mount
Proximity problems on line segments spanned by points. [Citation Graph (0, 0)][DBLP] Comput. Geom., 2006, v:33, n:3, pp:115-129 [Journal]
- Ovidiu Daescu, Ningfang Mi
Polygonal chain approximation: a query based approach. [Citation Graph (0, 0)][DBLP] Comput. Geom., 2005, v:30, n:1, pp:41-58 [Journal]
- Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexander Wolff
Farthest-point queries with geometric and combinatorial constraints. [Citation Graph (0, 0)][DBLP] Comput. Geom., 2006, v:33, n:3, pp:174-185 [Journal]
- Ovidiu Daescu, Robert Serfling
Extremal point queries with lines and line segments and related problems. [Citation Graph (0, 0)][DBLP] Comput. Geom., 2005, v:32, n:3, pp:223-237 [Journal]
- Danny Z. Chen, Ovidiu Daescu
Space-Efficient Algorithms for Approximating Polygonal Curves in Two-Dimensional Space. [Citation Graph (0, 0)][DBLP] Int. J. Comput. Geometry Appl., 2003, v:13, n:2, pp:95-111 [Journal]
- Danny Z. Chen, Ovidiu Daescu, Kevin S. Klenk
On Geometric Path Query Problems. [Citation Graph (0, 0)][DBLP] Int. J. Comput. Geometry Appl., 2001, v:11, n:6, pp:617-645 [Journal]
- Ovidiu Daescu, Jun Luo
Cutting out Polygons with Lines and Rays. [Citation Graph (0, 0)][DBLP] Int. J. Comput. Geometry Appl., 2006, v:16, n:2-3, pp:227-248 [Journal]
- Danny Z. Chen, Ovidiu Daescu
Maintaining Visibility of a Polygon with a Moving Point of View. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1998, v:65, n:5, pp:269-275 [Journal]
- Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
Finding an optimal path without growing the tree. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2003, v:49, n:1, pp:13-41 [Journal]
- 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. [Citation Graph (0, 0)][DBLP] J. Comb. Optim., 2005, v:9, n:1, pp:69-90 [Journal]
- Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Xiaodong Wu, Jinhui Xu
Determining an Optimal Penetration Among Weighted Regions in Two and Three Dimensions. [Citation Graph (0, 0)][DBLP] J. Comb. Optim., 2001, v:5, n:1, pp:59-79 [Journal]
- S. Emilda, L. Jacob, Ovidiu Daescu, B. Prabhakaran
Flexible Strategies for Disk Scheduling in Multimedia Presentation Servers. [Citation Graph (0, 0)][DBLP] Multimedia Tools Appl., 2005, v:26, n:1, pp:81-99 [Journal]
- Ovidiu Daescu, Gheorghe Fasui, Karthik Haridoss
GARA: a geometry aided routing algorithm. [Citation Graph (0, 0)][DBLP] , 2006, v:, n:, pp:259-268 [Journal]
- Steven Bitner, Ovidiu Daescu
Finding Segments and Triangles Spanned by Points in R3. [Citation Graph (0, 0)][DBLP] CCCG, 2007, pp:17-20 [Conf]
- Steven Bitner, Ovidiu Daescu
Minimum-sum Dipolar Spanning Tree for Points in R3. [Citation Graph (0, 0)][DBLP] CCCG, 2007, pp:81-84 [Conf]
Line Facility Location in Weighted Regions. [Citation Graph (, )][DBLP]
Line Segment Facility Location in Weighted Subdivisions. [Citation Graph (, )][DBLP]
Polygonal Chain Simplification with Small Angle Constraints. [Citation Graph (, )][DBLP]
On Some City Guarding Problems. [Citation Graph (, )][DBLP]
Finding a Minimum-Sum Dipolar Spanning Tree in R3. [Citation Graph (, )][DBLP]
Towards an Optimal Algorithm for Recognizing Laman Graphs. [Citation Graph (, )][DBLP]
Visiting a Sequence of Points with a Bevel-Tip Needle. [Citation Graph (, )][DBLP]
Minimum Separating Circle for Bichromatic Points in the Plane. [Citation Graph (, )][DBLP]
Polygonal chain simplification for flight simulation systems. [Citation Graph (, )][DBLP]
An Experimental Study of Weighted k-Link Shortest Path Algorithms. [Citation Graph (, )][DBLP]
A New Modeling for Finding Optimal Weighted Distances. [Citation Graph (, )][DBLP]
A PTAS for Cutting Out Polygons with Lines. [Citation Graph (, )][DBLP]
Approximate Point-to-Face Shortest Paths in R^3 [Citation Graph (, )][DBLP]
Fréchet Distance Problems in Weighted Regions [Citation Graph (, )][DBLP]
Minimum Sum Dipolar Spanning Tree in R^3 [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.453secs
|