default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOvidiu Daescu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c86]Ankur Yadav
, Ovidiu Daescu, Zachary Sickmann:
From Topological Signatures to Textural Patterns: Enhancing the Precision of Sand Classification. SSIAI 2024: 121-124- [c85]Ankur Yadav, Ovidiu Daescu:
Optimizing Foundation Models for Histopathology: A Continual Learning Approach to Cancer Detection. TAI4H 2024: 145-156 - 2023
- [c84]Ankur Yadav, Faisal Ahmed, Ovidiu Daescu, Reyhan Gedik, Baris Coskunuzer:
Histopathological Cancer Detection with Topological Signatures. BIBM 2023: 1610-1619 - [c83]Ovidiu Daescu, Ka Yaw Teo:
Approximate Line Segment Nearest Neighbor Search amid Polyhedra in 3-Space. CCCG 2023: 291-297 - [c82]Ankur Yadav, Ovidiu Daescu, Patrick Leavey, Erin R. Rudzinski:
Machine Learning for Rhabdomyosarcoma Whole Slide Images Sub-type Classification. PETRA 2023: 192-196 - 2022
- [c81]Ovidiu Daescu, Ka Yaw Teo:
Fast Deterministic Approximation of Medoid in Rd. CCCG 2022: 83-90 - [c80]Ovidiu Daescu, Ka Yaw Teo:
The Median Line Segment Problem: Computational Complexity and Constrained Variants. CCCG 2022: 91-97 - 2021
- [j40]Ovidiu Daescu, Ka Yaw Teo:
Characterization and computation of feasible trajectories for an articulated probe with a variable-length end segment. Comput. Geom. 96: 101756 (2021) - [j39]Ovidiu Daescu, Hemant Malik:
New bounds on guarding problems for orthogonal polygons in the plane using vertex guards with halfplane vision. Theor. Comput. Sci. 882: 63-76 (2021) - [c79]Ovidiu Daescu, Ka Yaw Teo:
The Discrete Median and Center Line Segment Problems in the Plane. CCCG 2021: 312-319 - [c78]Saloni Agarwal, Mohamedelfatih Eltigani Osman Abaker, Ovidiu Daescu:
Survival Prediction Based on Histopathology Imaging and Clinical Data: A Novel, Whole Slide CNN Approach. MICCAI (5) 2021: 762-771 - 2020
- [j38]Ka Yaw Teo, Ovidiu Daescu, Kyle Fox:
Trajectory planning for an articulated probe. Comput. Geom. 90: 101655 (2020) - [j37]Ovidiu Daescu, Ka Yaw Teo:
Two-dimensional closest pair problem: A closer look. Discret. Appl. Math. 287: 85-96 (2020) - [c77]Saloni Agarwal, Mohamedelfatih Eltigani Osman Abaker, Xinyi Zhang, Ovidiu Daescu, Donald A. Barkauskas, Erin R. Rudzinski, Patrick Leavey:
Rhabdomyosarcoma Histology Classification using Ensemble of Deep Learning Networks. BCB 2020: 24:1-24:10 - [c76]Ovidiu Daescu, Ka Yaw Teo:
Characterization and Computation of Feasible Trajectories for an Articulated Probe with a Variable-Length End Segment. CCCG 2020: 189-198 - [c75]Ovidiu Daescu, Hemant Malik:
City Guarding with Limited Field of View. CCCG 2020: 300-311 - [c74]Ovidiu Daescu, Hemant Malik:
Guarding Disjoint Orthogonal Polygons in the Plane. COCOA 2020: 499-514 - [i10]Ovidiu Daescu, Hemant Malik:
City Guarding with Limited Field of View. CoRR abs/2007.06052 (2020) - [i9]Ovidiu Daescu, Ka Yaw Teo:
Characterization and Computation of Feasible Trajectories for an Articulated Probe with a Variable-Length End Segment. CoRR abs/2011.11672 (2020) - [i8]Ovidiu Daescu, Ka Yaw Teo:
Computing Feasible Trajectories for an Articulated Probe in Three Dimensions. CoRR abs/2011.11685 (2020)
2010 – 2019
- 2019
- [j36]Ovidiu Daescu, Stephan Friedrichs, Hemant Malik, Valentin Polishchuk, Christiane Schmidt:
Altitude terrain guarding and guarding uni-monotone polygons. Comput. Geom. 84: 22-35 (2019) - [j35]Bogdan Armaselu, Ovidiu Daescu:
Dynamic minimum bichromatic separating circle. Theor. Comput. Sci. 774: 133-142 (2019) - [c73]Ovidiu Daescu, Ka Yaw Teo:
Computing Feasible Trajectories for an Articulated Probe in Three Dimensions. CCCG 2019: 59-70 - [c72]Ovidiu Daescu, Hongyao Huang, Maxwell A. Weinzierl:
Deep learning based face recognition system with smart glasses. PETRA 2019: 218-226 - [c71]Ovidiu Daescu, Hemant Malik:
k-Maximum Subarrays for Small k: Divide-and-Conquer Made Simpler. SEA² 2019: 454-472 - 2018
- [j34]Rashika Mishra, Ovidiu Daescu, Patrick Leavey, Dinesh Rakheja, Anita Sengupta:
Convolutional Neural Network for Histopathological Analysis of Osteosarcoma. J. Comput. Biol. 25(3): 313-325 (2018) - [c70]Ovidiu Daescu, Kyle Fox, Ka Yaw Teo:
Trajectory Planning for an Articulated Probe. CCCG 2018: 296-303 - [c69]Ovidiu Daescu, Hemant Malik:
Does a Robot Path Have Clearance C? COCOA 2018: 509-521 - [c68]Saloni Agarwal, Rami R. Hallac, Rashika Mishra, Chao Li, Ovidiu Daescu, Alex A. Kane:
Image Based Detection of Craniofacial Abnormalities using Feature Extraction by Classical Convolutional Neural Network. ICCABS 2018: 1-6 - [c67]Ovidiu Daescu, Ka Yaw Teo:
Improved line facility location in weighted subdivisions. IWISC 2018: 59-63 - [i7]Hemant Malik, Ovidiu Daescu:
k-Maximum Subarrays for Small k: Divide-and-Conquer made simpler. CoRR abs/1804.05956 (2018) - [i6]Ovidiu Daescu, Hemant Malik:
Does a robot path have clearance c? CoRR abs/1807.09392 (2018) - 2017
- [c66]Rashika Mishra, Ovidiu Daescu:
Deep learning for skin lesion segmentation. BIBM 2017: 1189-1194 - [c65]Ovidiu Daescu, Ka Yaw Teo:
2D Closest Pair Problem: A Closer Look. CCCG 2017: 185-190 - [c64]Rashika Mishra, Ovidiu Daescu, Patrick Leavey, Dinesh Rakheja, Anita Sengupta:
Histopathological Diagnosis for Viable and Non-viable Tumor Prediction for Osteosarcoma Using Convolutional Neural Network. ISBRA 2017: 12-23 - [c63]Bogdan Armaselu, Ovidiu Daescu:
Interactive Assistive Framework for Maximum Profit Routing in Public Transportation in Smart Cities. PETRA 2017: 13-16 - [c62]Harish Babu Arunachalam, Rashika Mishra, Bogdan Armaselu, Ovidiu Daescu, Maria Martinez, Patrick Leavey, Dinesh Rakheja, Kevin Cederberg, Anita Sengupta, Molly Ni'suilleabhain:
Computer Aided Image Segmentation and Classification for Viable and Non-Viable Tumor Identification in Osteosarcoma. PSB 2017: 195-206 - [e4]Zhipeng Cai, Ovidiu Daescu, Min Li:
Bioinformatics Research and Applications - 13th International Symposium, ISBRA 2017, Honolulu, HI, USA, May 29 - June 2, 2017, Proceedings. Lecture Notes in Computer Science 10330, Springer 2017, ISBN 978-3-319-59574-0 [contents] - [i5]Bogdan Armaselu, Ovidiu Daescu:
Maximum Area Rectangle Separating Red and Blue Points. CoRR abs/1706.03268 (2017) - 2016
- [c61]Bogdan Armaselu, Ovidiu Daescu:
Maximum Area Rectangle Separating Red and Blue Points. CCCG 2016: 244-251 - [c60]Bogdan Armaselu, Ovidiu Daescu:
Approximation algorithms for the Vehicle Routing Problem with Time Windows, Capacity Constraint and Unlimited Number of Vehicles: Poster Paper. PETRA 2016: 75 - [i4]Bogdan Armaselu, Ovidiu Daescu:
Approximation Algorithms for the Maximum Profit Pick-up Problem with Time Windows and Capacity Constraint. CoRR abs/1612.01038 (2016) - 2015
- [j33]Bogdan Armaselu, Ovidiu Daescu:
Algorithms for fair partitioning of convex polygons. Theor. Comput. Sci. 607: 351-362 (2015) - [c59]Bogdan Armaselu, Ovidiu Daescu:
Dynamic Minimum Bichromatic Separating Circle. COCOA 2015: 688-697 - [c58]Bogdan Armaselu, Harish Babu Arunachalam, Ovidiu Daescu, John-Paul Bach, Kevin Cederberg, Dinesh Rakheja, Anita Sengupta, Stephen Skapek, Patrick Leavey:
Whole slide images stitching for osteosarcoma detection. ICCABS 2015: 1-5 - [c57]Sergey Bereg, Ovidiu Daescu, Marko Zivanic, Timothy Rozario:
Smallest Maximum-Weight Circle for Weighted Points in the Plane. ICCSA (2) 2015: 244-253 - 2014
- [c56]Bogdan Armaselu, Ovidiu Daescu:
Algorithms for Fair Partitioning of Convex Polygons. COCOA 2014: 53-65 - [c55]David Allen, Ovidiu Daescu:
Optimization of IMRT treatment plan with Kinetic Data Structures. ICCABS 2014: 1-6 - [c54]David Allen, Ovidiu Daescu:
Improving healthcare cost transparency through mobile application development. PETRA 2014: 55:1-55:8 - 2013
- [j32]Wenqi Ju, Chenglin Fan, Jun Luo, Binhai Zhu, Ovidiu Daescu:
On some geometric problems of color-spanning sets. J. Comb. Optim. 26(2): 266-283 (2013) - [j31]Wenqi Ju, Jun Luo, Binhai Zhu, Ovidiu Daescu:
Largest area convex hull of imprecise data based on axis-aligned squares. J. Comb. Optim. 26(4): 832-859 (2013) - [c53]David Allen, Ovidiu Daescu:
Radiation therapy simulation and optimization using kinetic polygon modeling. IRI 2013: 239-246 - [c52]David Allen, Ovidiu Daescu:
A comprehensive system for locating medical services. PETRA 2013: 31:1-31:4 - 2012
- [j30]Steven Bitner, Ovidiu Daescu:
Minimum-sum dipolar spanning tree in R3. Comput. Geom. 45(9): 476-481 (2012) - [j29]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. Sci. 3(5): 335-343 (2012) - [j28]Weili Wu, Ovidiu Daescu:
Preface. Theor. Comput. Sci. 447: 1 (2012) - [c51]Yam Ki Cheung, Ovidiu Daescu, J. Steven Kirtzic, Lech Papiez:
Volume matching with application in medical treatment planning. ICCABS 2012: 1-6 - 2011
- [j27]Yam Ki Cheung, Ovidiu Daescu:
Line facility location in weighted regions. J. Comb. Optim. 22(1): 52-70 (2011) - [c50]Yam Ki Cheung, Ovidiu Daescu, Lech Papiez:
Volume matching with application in medical treatment planning. BCB 2011: 487-489 - [c49]Sairam Behera, Ovidiu Daescu, Lech Papiez:
Optimal delivery of volumetric modulated arc therapy (VMAT) for moving target. BIBM Workshops 2011: 297-304 - [c48]Marko Zivanic, Ovidiu Daescu, Anastasia Kurdia:
Rigid region pairwise sequence alignment. BIBM Workshops 2011: 319-326 - [c47]Yam Ki Cheung, Ovidiu Daescu, Marko Zivanic:
Kinetic Red-Blue Minimum Separating Circle. COCOA 2011: 448-463 - [c46]Ovidiu Daescu, Wenqi Ju, Jun Luo, Binhai Zhu:
Largest Area Convex Hull of Axis-Aligned Squares Based on Imprecise Data. COCOON 2011: 192-203 - [c45]J. Steven Kirtzic, Ovidiu Daescu:
Face It: 3D Facial Reconstruction from a Single 2D Image for Games and Simulations. CW 2011: 244-248 - 2010
- [j26]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) - [j25]Yam Ki Cheung, Ovidiu Daescu:
FréChet Distance Problems in Weighted Regions. Discret. Math. Algorithms Appl. 2(2): 161-180 (2010) - [c44]Ovidiu Daescu, Wenqi Ju, Jun Luo:
NP-Completeness of Spreading Colored Points. COCOA (1) 2010: 41-50 - [c43]Steven Bitner, Yam Ki Cheung, Ovidiu Daescu:
Minimum Separating Circle for Bichromatic Points in the Plane. ISVD 2010: 50-55 - [c42]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 - [c41]Robert Finis Anderson, J. Steven Kirtzic, Ovidiu Daescu:
Applying Parallel Design Techniques to Template Matching with GPUs. VECPAR 2010: 456-468 - [e3]Weili Wu, Ovidiu Daescu:
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 [contents] - [e2]Weili Wu, Ovidiu Daescu:
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 [contents] - [i3]Yam Ki Cheung, Ovidiu Daescu:
Approximate Point-to-Face Shortest Paths in R^3. CoRR abs/1004.1588 (2010) - [i2]Yam Ki Cheung, Ovidiu Daescu:
Fréchet Distance Problems in Weighted Regions. CoRR abs/1004.4901 (2010) - [i1]Steven Bitner, Ovidiu Daescu:
Minimum Sum Dipolar Spanning Tree in R^3. CoRR abs/1007.1222 (2010)
2000 – 2009
- 2009
- [j24]Sergey Bereg, Ovidiu Daescu, Minghui Jiang:
A PTAS for Cutting Out Polygons with Lines. Algorithmica 53(2): 157-171 (2009) - [j23]Ovidiu Daescu, Jun Luo:
Stabbing balls and simplifying proteins. Int. J. Bioinform. Res. Appl. 5(1): 64-80 (2009) - [j22]Ovidiu Daescu, James D. Palmer:
Minimum Separation in Weighted Subdivisions. Int. J. Comput. Geom. Appl. 19(1): 33-57 (2009) - [j21]Steven Bitner, Ovidiu Daescu:
Farthest segments and extremal triangles spanned by points in R3. Inf. Process. Lett. 109(20): 1167-1171 (2009) - [j20]Ovidiu Daescu, Anastasia Kurdia:
Towards an optimal algorithm for recognizing Laman graphs. J. Graph Algorithms Appl. 13(2): 219-232 (2009) - [j19]Ovidiu Daescu, Yam Ki Cheung, James D. Palmer:
Parallel Optimal Weighted Links. Trans. Comput. Sci. 3: 66-81 (2009) - [c40]Yam Ki Cheung, Ovidiu Daescu:
Line Segment Facility Location in Weighted Subdivisions. AAIM 2009: 100-113 - [c39]Ovidiu Daescu, Anastasia Kurdia:
Towards an Optimal Algorithm for Recognizing Laman Graphs. HICSS 2009: 1-10 - [c38]Yam Ki Cheung, Ovidiu Daescu:
Fréchet Distance Problems in Weighted Regions. ISAAC 2009: 97-111 - [c37]Ovidiu Daescu, Anastasia Kurdia:
Polygonal chain simplification for flight simulation systems. SpringSim 2009 - 2008
- [c36]Yam Ki Cheung, Ovidiu Daescu:
Line Facility Location in Weighted Regions. AAIM 2008: 109-119 - [c35]Yam Ki Cheung, Ovidiu Daescu, Anastasia Kurdia:
A New Modeling for Finding Optimal Weighted Distances. BIOTECHNO 2008: 41-46 - [c34]Ovidiu Daescu, Anastasia Kurdia:
Polygonal Chain Simplification with Small Angle Constraints. CCCG 2008 - [c33]Lichen Bao, Sergey Bereg, Ovidiu Daescu, Simeon C. Ntafos, Junqiang Zhou:
On Some City Guarding Problems. COCOON 2008: 600-610 - [c32]Steven Bitner, Ovidiu Daescu:
Finding a Minimum-Sum Dipolar Spanning Tree in R3. HICSS 2008: 469 - [p2]Ovidiu Daescu, James D. Palmer:
Modeling Optimal Beam Treatment with Weighted Regions for Bio-medical Applications. Generalized Voronoi Diagram 2008: 215-232 - [e1]Rita Casadio, Ovidiu Daescu, Cosmin Dini, Daniela Stan Raicu:
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 [contents] - 2007
- [c31]Steven Bitner, Ovidiu Daescu:
Finding Segments and Triangles Spanned by Points in R3. CCCG 2007: 17-20 - [c30]Steven Bitner, Ovidiu Daescu:
Minimum-sum Dipolar Spanning Tree for Points in R3. CCCG 2007: 81-84 - [c29]Ovidiu Daescu, Jun Luo:
Computing Simple Paths on Points in Simple Polygons. KyotoCGGT 2007: 41-55 - 2006
- [j18]Chao Gong, Kamil Saraç, Ovidiu Daescu, Balaji Raghavachari, Raja Jothi:
Load-balanced agent activation for value-added network services. Comput. Commun. 29(11): 1905-1916 (2006) - [j17]Ovidiu Daescu, Jun Luo, David M. Mount:
Proximity problems on line segments spanned by points. Comput. Geom. 33(3): 115-129 (2006) - [j16]Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexander Wolff:
Farthest-point queries with geometric and combinatorial constraints. Comput. Geom. 33(3): 174-185 (2006) - [j15]Ovidiu Daescu, Jun Luo:
Cutting out Polygons with Lines and Rays. Int. J. Comput. Geom. Appl. 16(2-3): 227-248 (2006) - [j14]Ovidiu Daescu, Gheorghe Fasui, Karthik Haridoss:
GARA: a geometry aided routing algorithm. Wirel. Commun. Mob. Comput. 6: 259-268 (2006) - [c28]Ovidiu Daescu, James D. Palmer:
Finding optimal weighted bridges with applications. ACM Southeast Regional Conference 2006: 12-17 - [c27]Sergey Bereg, Ovidiu Daescu, Minghui Jiang:
A PTAS for Cutting Out Polygons with Lines. COCOON 2006: 176-185 - [c26]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. SCG 2006: 483-484 - [c25]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 - 2005
- [j13]Ovidiu Daescu, Ningfang Mi:
Polygonal chain approximation: a query based approach. Comput. Geom. 30(1): 41-58 (2005) - [j12]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) - [j11]Ovidiu Daescu, Robert Serfling:
Extremal point queries with lines and line segments and related problems. Comput. Geom. 32(3): 223-237 (2005) - [j10]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) - [j9]Sindhu Emilda, Lillykutty Jacob, Ovidiu Daescu, B. Prabhakaran:
Flexible Strategies for Disk Scheduling in Multimedia Presentation Servers. Multim. Tools Appl. 26(1): 81-99 (2005) - [c24]Ramaswamy Chandrasekaran, Ovidiu Daescu, Jun Luo:
Cutting Out Polygons. CCCG 2005: 183-186 - [c23]Ovidiu Daescu, Jun Luo, David M. Mount:
Proximity Problems on Line Segments Spanned by Points. CCCG 2005: 227-231 - [c22]Pankaj K. Agarwal, Sergey Bereg, Ovidiu Daescu, Haim Kaplan, Simeon C. Ntafos, Binhai Zhu:
Guarding a terrain by two watchtowers. SCG 2005: 346-355 - [c21]Ovidiu Daescu, James D. Palmer:
1-link shortest paths in weighted regions. SCG 2005: 378-379 - [c20]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 - [p1]Ovidiu Daescu, J. Luo:
Stabbing Balls and Simplifying proteins. Advances in Bioinformatics and Its Applications 2005 - 2004
- [j8]Ovidiu Daescu:
New Results on Path Approximation. Algorithmica 38(1): 131-143 (2004) - [c19]Chao Gong, Ovidiu Daescu, Raja Jothi, Balaji Raghavachari, Kamil Saraç:
Load balancing for reliable multicast. Communications, Internet, and Information Technology 2004: 86-91 - [c18]Ovidiu Daescu, Jun Luo:
Cutting Out Polygons with Lines and Rays. ISAAC 2004: 669-680 - [c17]Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexander Wolff:
Farthest-Point Queries with Geometric and Combinatorial Constraints. JCDCG 2004: 62-75 - [c16]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
- [j7]Mikhail J. Atallah, Danny Z. Chen, Ovidiu Daescu:
Efficient Parallel Algorithms for Planar st-Graphs. Algorithmica 35(3): 194-215 (2003) - [j6]Danny Z. Chen, Ovidiu Daescu:
Space-Efficient Algorithms for Approximating Polygonal Curves in Two-Dimensional Space. Int. J. Comput. Geom. Appl. 13(2): 95-111 (2003) - [j5]Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu:
Finding an optimal path without growing the tree. J. Algorithms 49(1): 13-41 (2003) - [c15]Ovidiu Daescu, Derek Soeder, R. N. Uma:
Task planning with transportation constraints: approximation bounds, implementation and experiments. ICRA 2003: 3542-3547 - [c14]Ovidiu Daescu, Ningfang Mi:
Polygonal Path Approximation: A Query Based Approach. ISAAC 2003: 36-46 - 2002
- [j4]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) - [c13]Sindhu Emilda, Lillykutty Jacob, Ovidiu Daescu, B. Prabhakaran:
Flexible disk scheduling for multimedia presentation servers. IEEE Workshop on Multimedia Signal Processing 2002: 452-455 - [c12]Ovidiu Daescu:
Improved Optimal Weighted Links Algorithms. International Conference on Computational Science (3) 2002: 65-74 - [c11]Ovidiu Daescu, Ashish Bhatia:
Computing Optimal Trajectories for Medical Treatment Planning and Optimization. International Conference on Computational Science (3) 2002: 227-233 - [c10]Sindhu Emilda, Lillykutty Jacob, Ovidiu Daescu, B. Prabhakaran:
Flexible disk scheduling for multimedia presentation servers. ICON 2002: 151-155 - 2001
- [j3]Danny Z. Chen, Ovidiu Daescu, Kevin S. Klenk:
On Geometric Path Query Problems. Int. J. Comput. Geom. Appl. 11(6): 617-645 (2001) - [j2]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) - [c9]Ovidiu Daescu:
Parallel Optimal Weighted Links. International Conference on Computational Science (1) 2001: 649-657 - [c8]Danny Z. Chen, Ovidiu Daescu, John Hershberger, Peter M. Kogge, Jack Snoeyink:
Polygonal path approximation with angle constraints. SODA 2001: 342-343 - 2000
- [c7]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
1990 – 1999
- 1999
- [c6]Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Xiaodong Wu, Jinhui Xu:
Determining an Optimal Penetration Among Weighted Regions in Two and Three Dimensions. SCG 1999: 322-331 - 1998
- [j1]Danny Z. Chen, Ovidiu Daescu:
Maintaining Visibility of a Polygon with a Moving Point of View. Inf. Process. Lett. 65(5): 269-275 (1998) - [c5]Danny Z. Chen, Ovidiu Daescu:
Space-Efficient Algorithms for Approximating Polygonal Curves in Two Dimensional Space. COCOON 1998: 45-54 - [c4]Gill Barequet, Michael T. Goodrich, Danny Z. Chen, Ovidiu Daescu, Jack Snoeyink:
Efficiently Approximating Polygonal Paths in Three and Higher Dimensions. SCG 1998: 317-326 - [c3]Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu:
Finding an Optimal Path without Growing the Tree. ESA 1998: 356-367 - 1997
- [c2]Danny Z. Chen, Ovidiu Daescu, Kevin S. Klenk:
On Geometric Path Query Problems. WADS 1997: 248-257 - 1996
- [c1]Danny Z. Chen, Ovidiu Daescu:
Maintaining Visibility of a Polygon with a Moving Point of View. CCCG 1996: 240-245
Coauthor Index
Danny Ziyi Chen
aka: Danny Z. Chen
aka: Danny Z. Chen
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
