Ovidiu Daescu

	2009
57		Yam Ki Cheung, Ovidiu Daescu: Line Segment Facility Location in Weighted Subdivisions. AAIM 2009: 100-113
56		Ovidiu Daescu, Anastasia Kurdia: Towards an Optimal Algorithm for Recognizing Laman Graphs. HICSS 2009: 1-10
55		Sergey Bereg, Ovidiu Daescu, Minghui Jiang: A PTAS for Cutting Out Polygons with Lines. Algorithmica 53(2): 157-171 (2009)
54		Ovidiu Daescu, Jun Luo: Stabbing balls and simplifying proteins. IJBRA 5(1): 64-80 (2009)
53		Ovidiu Daescu, James D. Palmer: Minimum Separation in Weighted Subdivisions. Int. J. Comput. Geometry Appl. 19(1): 33-57 (2009)
52		Ovidiu Daescu, Yam Ki Cheung, James D. Palmer: Parallel Optimal Weighted Links. Transactions on Computational Science 3: 66-81 (2009)
	2008
51		Yam Ki Cheung, Ovidiu Daescu: Line Facility Location in Weighted Regions. AAIM 2008: 109-119
50		Ovidiu Daescu, Anastasia Kurdia: Polygonal Chain Simplification with Small Angle Constraints. CCCG 2008
49		Lichen Bao, Sergey Bereg, Ovidiu Daescu, Simeon C. Ntafos, Junqiang Zhou: On Some City Guarding Problems. COCOON 2008: 600-610
48		Steven Bitner, Ovidiu Daescu: Finding a Minimum-Sum Dipolar Spanning Tree in R3. HICSS 2008: 469
47		Ovidiu Daescu, James D. Palmer: Modeling Optimal Beam Treatment with Weighted Regions for Bio-medical Applications. Generalized Voronoi Diagram 2008: 215-232
	2007
46		Steven Bitner, Ovidiu Daescu: Finding Segments and Triangles Spanned by Points in R3. CCCG 2007: 17-20
45		Steven Bitner, Ovidiu Daescu: Minimum-sum Dipolar Spanning Tree for Points in R3. CCCG 2007: 81-84
	2006
44		Ovidiu Daescu, James D. Palmer: Finding optimal weighted bridges with applications. ACM Southeast Regional Conference 2006: 12-17
43		Sergey Bereg, Ovidiu Daescu, Minghui Jiang: A PTAS for Cutting Out Polygons with Lines. COCOON 2006: 176-185
42		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
41		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
40		Ovidiu Daescu, Jun Luo, David M. Mount: Proximity problems on line segments spanned by points. Comput. Geom. 33(3): 115-129 (2006)
39		Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexander Wolff: Farthest-point queries with geometric and combinatorial constraints. Comput. Geom. 33(3): 174-185 (2006)
38		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)
37		Ovidiu Daescu, Jun Luo: Cutting out Polygons with Lines and Rays. Int. J. Comput. Geometry Appl. 16(2-3): 227-248 (2006)
36		Ovidiu Daescu, Gheorghe Fasui, Karthik Haridoss: GARA: a geometry aided routing algorithm. Wireless Communications and Mobile Computing 6: 259-268 (2006)
	2005
35		Ramaswamy Chandrasekaran, Ovidiu Daescu, Jun Luo: Cutting Out Polygons. CCCG 2005: 183-186
34		Ovidiu Daescu, Jun Luo, David M. Mount: Proximity Problems on Line Segments Spanned by Points. CCCG 2005: 227-231
33		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
32		Ovidiu Daescu, James D. Palmer: 1-link shortest paths in weighted regions. Symposium on Computational Geometry 2005: 378-379
31		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
30		Ovidiu Daescu, Ningfang Mi: Polygonal chain approximation: a query based approach. Comput. Geom. 30(1): 41-58 (2005)
29		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)
28		Ovidiu Daescu, Robert Serfling: Extremal point queries with lines and line segments and related problems. Comput. Geom. 32(3): 223-237 (2005)
27		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)
26		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)
	2004
25		Chao Gong, Ovidiu Daescu, Raja Jothi, Balaji Raghavachari, Kamil Saraç: Load balancing for reliable multicast. Communications, Internet, and Information Technology 2004: 86-91
24		Ovidiu Daescu, Jun Luo: Cutting Out Polygons with Lines and Rays. ISAAC 2004: 669-680
23		Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexander Wolff: Farthest-Point Queries with Geometric and Combinatorial Constraints. JCDCG 2004: 62-75
22		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
	2003
21		Ovidiu Daescu, Derek Soeder, R. N. Uma: Task planning with transportation constraints: approximation bounds, implementation and experiments. ICRA 2003: 3542-3547
20		Ovidiu Daescu, Ningfang Mi: Polygonal Path Approximation: A Query Based Approach. ISAAC 2003: 36-46
19		Mikhail J. Atallah, Danny Z. Chen, Ovidiu Daescu: Efficient Parallel Algorithms for Planar st-Graphs. Algorithmica 35(3): 194-215 (2003)
18		Ovidiu Daescu: New Results on Path Approximation. Algorithmica 38(1): 131-143 (2003)
17		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)
16		Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu: Finding an optimal path without growing the tree. J. Algorithms 49(1): 13-41 (2003)
	2002
15		S. Emilda, L. Jacob, Ovidiu Daescu, B. Prabhakaran: Flexible disk scheduling for multimedia presentation servers. IEEE Workshop on Multimedia Signal Processing 2002: 452-455
14		Ovidiu Daescu, Ashish Bhatia: Computing Optimal Trajectories for Medical Treatment Planning and Optimization. International Conference on Computational Science (3) 2002: 227-233
13		Ovidiu Daescu: Improved Optimal Weighted Links Algorithms. International Conference on Computational Science (3) 2002: 65-74
12		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)
	2001
11		Ovidiu Daescu: Parallel Optimal Weighted Links. International Conference on Computational Science (1) 2001: 649-657
10		Danny Z. Chen, Ovidiu Daescu, John Hershberger, Peter M. Kogge, Jack Snoeyink: Polygonal path approximation with angle constraints. SODA 2001: 342-343
9		Danny Z. Chen, Ovidiu Daescu, Kevin S. Klenk: On Geometric Path Query Problems. Int. J. Comput. Geometry Appl. 11(6): 617-645 (2001)
8		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)
	2000
7		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
	1999
6		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
	1998
5		Danny Z. Chen, Ovidiu Daescu: Space-Efficient Algorithms for Approximating Polygonal Curves in Two Dimensional Space. COCOON 1998: 45-54
4		Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu: Finding an Optimal Path without Growing the Tree. ESA 1998: 356-367
3		Danny Z. Chen, Ovidiu Daescu: Maintaining Visibility of a Polygon with a Moving Point of View. Inf. Process. Lett. 65(5): 269-275 (1998)
	1997
2		Danny Z. Chen, Ovidiu Daescu, Kevin S. Klenk: On Geometric Path Query Problems. WADS 1997: 248-257
	1996
1		Danny Z. Chen, Ovidiu Daescu: Maintaining Visibility of a Polygon with a Moving Point of View. CCCG 1996: 240-245

Coauthor Index

1	Pankaj K. Agarwal	[33]
2	Mikhail J. Atallah	[19]
3	Lichen Bao	[49]
4	Gill Barequet	[12]
5	Sergey Bereg (Sergei Bespamyatnikh)	[33] [43] [49] [55]
6	Ashish Bhatia	[14]
7	Steven Bitner	[45] [46] [48]
8	Ramaswamy Chandrasekaran (R. Chandrasekaran)	[35]
9	Danny Z. Chen	[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [12] [16] [17] [19] [27] [29]
10	Yam Ki Cheung	[51] [52] [57]
11	Yang Dai	[7] [27]
12	S. Emilda	[15] [26]
13	Gheorghe Fasui	[36]
14	Chao Gong	[25] [38]
15	Michael T. Goodrich	[12]
16	Karthik Haridoss	[36]
17	John Hershberger	[10] [29]
18	Xiaobo Sharon Hu (Xiaobo Hu)	[4] [6] [8] [16]
19	L. Jacob	[15] [26]
20	Minghui Jiang	[43] [55]
21	Raja Jothi	[22] [25] [38]
22	Haim Kaplan	[33]
23	Naoki Katoh	[7] [27]
24	Kevin S. Klenk	[2] [9]
25	Peter M. Kogge	[10] [29]
26	Anastasia Kurdia	[50] [56]
27	Jun Luo	[24] [34] [35] [37] [40] [54]
28	Ningfang Mi	[20] [23] [29] [30] [39]
29	Joseph S. B. Mitchell	[31] [41] [42]
30	David M. Mount	[34] [40]
31	Simeon C. Ntafos	[31] [33] [41] [42] [49]
32	James D. Palmer	[31] [32] [41] [42] [44] [47] [52] [53]
33	B. Prabhakaran (Balakrishnan Prabhakaran)	[15] [26]
34	Balaji Raghavachari	[22] [25] [38]
35	Kamil Saraç	[22] [25] [38]
36	Robert Serfling	[28]
37	Chan-Su Shin	[23] [39]
38	Jack Snoeyink	[10] [12] [29]
39	Derek Soeder	[21]
40	R. N. Uma	[21]
41	Alexander Wolff	[23] [39]
42	Xiaodong Wu	[6] [7] [8] [27]
43	Jinhui Xu	[4] [6] [7] [8] [16] [27]
44	Chee-Keng Yap (Chee Yap)	[31] [41] [42]
45	Junqiang Zhou	[49]
46	Binhai Zhu	[33]

Colors in the list of coauthors