Maintaining Visibility of a Polygon with a Moving Point of View. - Danny Z. Chen; Ovidiu Daescu (Inf. Process. Lett., 1998)

Optimizing the sum of linear fractional functions and applications. - Danny Z. Chen; Ovidiu Daescu; Yang Dai; Naoki Katoh; Xiaodong Wu 001; Jinhui Xu 001 (SODA, 2000)

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

Polygonal path approximation with angle constraints. - Danny Z. Chen; Ovidiu Daescu; John Hershberger 001; Peter M. Kogge; Jack Snoeyink (SODA, 2001)

On Geometric Path Query Problems. - Danny Z. Chen; Ovidiu Daescu; Kevin S. Klenk (Int. J. Comput. Geom. Appl., 2001)

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

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

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

Flexible disk scheduling for multimedia presentation servers. - Sindhu Emilda; Lillykutty Jacob; Ovidiu Daescu; B. Prabhakaran 001 (ICON, 2002)

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

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

Polygonal Path Approximation: A Query Based Approach. - Ovidiu Daescu; Ningfang Mi (ISAAC, 2003)

Efficient Parallel Algorithms for Planar st-Graphs. - Mikhail J. Atallah; Danny Z. Chen; Ovidiu Daescu (Algorithmica, 2003)

Space-Efficient Algorithms for Approximating Polygonal Curves in Two-Dimensional Space. - Danny Z. Chen; Ovidiu Daescu (Int. J. Comput. Geom. Appl., 2003)

Finding an optimal path without growing the tree. - Danny Z. Chen; Ovidiu Daescu; Xiaobo Hu 001; Jinhui Xu 001 (J. Algorithms, 2003)

Load balancing for reliable multicast. - Chao Gong 006; Ovidiu Daescu; Raja Jothi; Balaji Raghavachari; Kamil Saraç (Communications, Internet, and Information Technology, 2004)

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

New Results on Path Approximation. - Ovidiu Daescu (Algorithmica, 2004)

Stabbing Balls and Simplifying proteins. - Ovidiu Daescu; J. Luo (Advances in Bioinformatics and Its Applications, 2005)

Cutting Out Polygons. - Ramaswamy Chandrasekaran; Ovidiu Daescu; Jun Luo 008 (CCCG, 2005)

Guarding a terrain by two watchtowers. - Pankaj K. Agarwal; Sergey Bereg; Ovidiu Daescu; Haim Kaplan; Simeon C. Ntafos; Binhai Zhu (SCG, 2005)

1-link shortest paths in weighted regions. - Ovidiu Daescu; James D. Palmer 002 (SCG, 2005)

k-Link Shortest Paths in Weighted Subdivisions. - Ovidiu Daescu; Joseph S. B. Mitchell; Simeon C. Ntafos; James D. Palmer 002; Chee-Keng Yap (WADS, 2005)

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

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

Extremal point queries with lines and line segments and related problems. - Ovidiu Daescu; Robert Serfling (Comput. Geom., 2005)

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

Flexible Strategies for Disk Scheduling in Multimedia Presentation Servers. - Sindhu Emilda; Lillykutty Jacob; Ovidiu Daescu; B. Prabhakaran 001 (Multim. Tools Appl., 2005)

Finding optimal weighted bridges with applications. - Ovidiu Daescu; James D. Palmer 002 (ACM Southeast Regional Conference, 2006)

Approximating minimum-cost polygonal paths of bounded number of links in weighted subdivisions. - Ovidiu Daescu; Joseph S. B. Mitchell; Simeon C. Ntafos; James D. Palmer 002; Chee-Keng Yap (SCG, 2006)

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

Load-balanced agent activation for value-added network services. - Chao Gong 006; Kamil Saraç; Ovidiu Daescu; Balaji Raghavachari; Raja Jothi (Comput. Commun., 2006)

Proximity problems on line segments spanned by points. - Ovidiu Daescu; Jun Luo 008; David M. Mount (Comput. Geom., 2006)

Farthest-point queries with geometric and combinatorial constraints. - Ovidiu Daescu; Ningfang Mi; Chan-Su Shin; Alexander Wolff 001 (Comput. Geom., 2006)

Cutting out Polygons with Lines and Rays. - Ovidiu Daescu; Jun Luo 008 (Int. J. Comput. Geom. Appl., 2006)

GARA: a geometry aided routing algorithm. - Ovidiu Daescu; Gheorghe Fasui; Karthik Haridoss (Wirel. Commun. Mob. Comput., 2006)

Finding Segments and Triangles Spanned by Points in R3. - Steven Bitner; Ovidiu Daescu (CCCG, 2007)

Minimum-sum Dipolar Spanning Tree for Points in R3. - Steven Bitner; Ovidiu Daescu (CCCG, 2007)

Computing Simple Paths on Points in Simple Polygons. - Ovidiu Daescu; Jun Luo 008 (KyotoCGGT, 2007)

A New Modeling for Finding Optimal Weighted Distances. - Yam Ki Cheung; Ovidiu Daescu; Anastasia Kurdia (BIOTECHNO, 2008)

Polygonal Chain Simplification with Small Angle Constraints. - Ovidiu Daescu; Anastasia Kurdia (CCCG, 2008)

On Some City Guarding Problems. - Lichen Bao; Sergey Bereg; Ovidiu Daescu; Simeon C. Ntafos; Junqiang Zhou (COCOON, 2008)

Finding a Minimum-Sum Dipolar Spanning Tree in R3. - Steven Bitner; Ovidiu Daescu (HICSS, 2008)

Modeling Optimal Beam Treatment with Weighted Regions for Bio-medical Applications. - Ovidiu Daescu; James D. Palmer 002 (Generalized Voronoi Diagram, 2008)

Line Segment Facility Location in Weighted Subdivisions. - Yam Ki Cheung; Ovidiu Daescu (AAIM, 2009)

Polygonal chain simplification for flight simulation systems. - Ovidiu Daescu; Anastasia Kurdia (SpringSim, 2009)

A PTAS for Cutting Out Polygons with Lines. - Sergey Bereg; Ovidiu Daescu; Minghui Jiang 001 (Algorithmica, 2009)

Stabbing balls and simplifying proteins. - Ovidiu Daescu; Jun Luo 008 (Int. J. Bioinform. Res. Appl., 2009)

Minimum Separation in Weighted Subdivisions. - Ovidiu Daescu; James D. Palmer 002 (Int. J. Comput. Geom. Appl., 2009)

Farthest segments and extremal triangles spanned by points in R3. - Steven Bitner; Ovidiu Daescu (Inf. Process. Lett., 2009)

Towards an optimal algorithm for recognizing Laman graphs. - Ovidiu Daescu; Anastasia Kurdia (J. Graph Algorithms Appl., 2009)

Parallel Optimal Weighted Links. - Ovidiu Daescu; Yam Ki Cheung; James D. Palmer 002 (Trans. Comput. Sci., 2009)

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

Minimum Separating Circle for Bichromatic Points in the Plane. - Steven Bitner; Yam Ki Cheung; Ovidiu Daescu (ISVD, 2010)

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

Applying Parallel Design Techniques to Template Matching with GPUs. - Robert Finis Anderson; J. Steven Kirtzic; Ovidiu Daescu (VECPAR, 2010)

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

Approximate Point-to-Face Shortest Paths in R^3 - Yam Ki Cheung; Ovidiu Daescu (CoRR, 2010)

Minimum Sum Dipolar Spanning Tree in R^3 - Steven Bitner; Ovidiu Daescu (CoRR, 2010)

FréChet Distance Problems in Weighted Regions. - Yam Ki Cheung; Ovidiu Daescu (Discret. Math. Algorithms Appl., 2010)

Volume matching with application in medical treatment planning. - Yam Ki Cheung; Ovidiu Daescu; Lech Papiez (BCB, 2011)

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

Rigid region pairwise sequence alignment. - Marko Zivanic; Ovidiu Daescu; Anastasia Kurdia (BIBM Workshops, 2011)

Kinetic Red-Blue Minimum Separating Circle. - Yam Ki Cheung; Ovidiu Daescu; Marko Zivanic (COCOA, 2011)

Largest Area Convex Hull of Axis-Aligned Squares Based on Imprecise Data. - Ovidiu Daescu; Wenqi Ju; Jun Luo 008; Binhai Zhu (COCOON, 2011)

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

Line facility location in weighted regions. - Yam Ki Cheung; Ovidiu Daescu (J. Comb. Optim., 2011)

Volume matching with application in medical treatment planning. - Yam Ki Cheung; Ovidiu Daescu; J. Steven Kirtzic; Lech Papiez (ICCABS, 2012)

Minimum-sum dipolar spanning tree in R3. - Steven Bitner; Ovidiu Daescu (Comput. Geom., 2012)

The Voronoi diagram for graphs and its application in the Sickle Cell Disease research. - Marko Zivanic; Ovidiu Daescu; Anastasia Kurdia; S. R. Goodman (J. Comput. Sci., 2012)

Preface. - Weili Wu 001; Ovidiu Daescu (Theor. Comput. Sci., 2012)

Radiation therapy simulation and optimization using kinetic polygon modeling. - David Allen; Ovidiu Daescu (IRI, 2013)

A comprehensive system for locating medical services. - David Allen; Ovidiu Daescu (PETRA, 2013)

On some geometric problems of color-spanning sets. - Wenqi Ju; Chenglin Fan; Jun Luo 008; Binhai Zhu; Ovidiu Daescu (J. Comb. Optim., 2013)

Largest area convex hull of imprecise data based on axis-aligned squares. - Wenqi Ju; Jun Luo 008; Binhai Zhu; Ovidiu Daescu (J. Comb. Optim., 2013)

Optimization of IMRT treatment plan with Kinetic Data Structures. - David Allen; Ovidiu Daescu (ICCABS, 2014)

Improving healthcare cost transparency through mobile application development. - David Allen; Ovidiu Daescu (PETRA, 2014)

Whole slide images stitching for osteosarcoma detection. - Bogdan Armaselu; Harish Babu Arunachalam; Ovidiu Daescu; John-Paul Bach; Kevin Cederberg; Dinesh Rakheja; Anita Sengupta; Stephen Skapek; Patrick Leavey (ICCABS, 2015)

Smallest Maximum-Weight Circle for Weighted Points in the Plane. - Sergey Bereg; Ovidiu Daescu; Marko Zivanic; Timothy Rozario (ICCSA (2), 2015)

Algorithms for fair partitioning of convex polygons. - Bogdan Armaselu; Ovidiu Daescu (Theor. Comput. Sci., 2015)

Maximum Area Rectangle Separating Red and Blue Points. - Bogdan Armaselu; Ovidiu Daescu (CCCG, 2016)

Approximation algorithms for the Vehicle Routing Problem with Time Windows, Capacity Constraint and Unlimited Number of Vehicles: Poster Paper. - Bogdan Armaselu; Ovidiu Daescu (PETRA, 2016)

Approximation Algorithms for the Maximum Profit Pick-up Problem with Time Windows and Capacity Constraint. - Bogdan Armaselu; Ovidiu Daescu (CoRR, 2016)

Deep learning for skin lesion segmentation. - Rashika Mishra; Ovidiu Daescu (BIBM, 2017)

2D Closest Pair Problem: A Closer Look. - Ovidiu Daescu; Ka Yaw Teo (CCCG, 2017)

Histopathological Diagnosis for Viable and Non-viable Tumor Prediction for Osteosarcoma Using Convolutional Neural Network. - Rashika Mishra; Ovidiu Daescu; Patrick Leavey; Dinesh Rakheja; Anita Sengupta (ISBRA, 2017)

Interactive Assistive Framework for Maximum Profit Routing in Public Transportation in Smart Cities. - Bogdan Armaselu; Ovidiu Daescu (PETRA, 2017)

Computer Aided Image Segmentation and Classification for Viable and Non-Viable Tumor Identification in Osteosarcoma. - Harish Babu Arunachalam; Rashika Mishra; Bogdan Armaselu; Ovidiu Daescu; Maria Martinez; Patrick Leavey; Dinesh Rakheja; Kevin Cederberg; Anita Sengupta; Molly Ni'suilleabhain (PSB, 2017)

Does a Robot Path Have Clearance C? - Ovidiu Daescu; Hemant Malik (COCOA, 2018)

Image Based Detection of Craniofacial Abnormalities using Feature Extraction by Classical Convolutional Neural Network. - Saloni Agarwal; Rami R. Hallac; Rashika Mishra; Chao Li 021; Ovidiu Daescu; Alex A. Kane (ICCABS, 2018)

Improved line facility location in weighted subdivisions. - Ovidiu Daescu; Ka Yaw Teo (IWISC, 2018)

Convolutional Neural Network for Histopathological Analysis of Osteosarcoma. - Rashika Mishra; Ovidiu Daescu; Patrick Leavey; Dinesh Rakheja; Anita Sengupta (J. Comput. Biol., 2018)

Computing Feasible Trajectories for an Articulated Probe in Three Dimensions. - Ovidiu Daescu; Ka Yaw Teo (CCCG, 2019)

Deep learning based face recognition system with smart glasses. - Ovidiu Daescu; Hongyao Huang; Maxwell A. Weinzierl (PETRA, 2019)

k-Maximum Subarrays for Small k: Divide-and-Conquer Made Simpler. - Ovidiu Daescu; Hemant Malik (SEA², 2019)

Altitude terrain guarding and guarding uni-monotone polygons. - Ovidiu Daescu; Stephan Friedrichs; Hemant Malik; Valentin Polishchuk; Christiane Schmidt 001 (Comput. Geom., 2019)

Dynamic minimum bichromatic separating circle. - Bogdan Armaselu; Ovidiu Daescu (Theor. Comput. Sci., 2019)

Rhabdomyosarcoma Histology Classification using Ensemble of Deep Learning Networks. - Saloni Agarwal; Mohamedelfatih Eltigani Osman Abaker; Xinyi Zhang; Ovidiu Daescu; Donald A. Barkauskas; Erin R. Rudzinski; Patrick Leavey (BCB, 2020)

City Guarding with Limited Field of View. - Ovidiu Daescu; Hemant Malik (CCCG, 2020)

Guarding Disjoint Orthogonal Polygons in the Plane. - Ovidiu Daescu; Hemant Malik (COCOA, 2020)

Trajectory planning for an articulated probe. - Ka Yaw Teo; Ovidiu Daescu; Kyle Fox (Comput. Geom., 2020)

Two-dimensional closest pair problem: A closer look. - Ovidiu Daescu; Ka Yaw Teo (Discret. Appl. Math., 2020)

The Discrete Median and Center Line Segment Problems in the Plane. - Ovidiu Daescu; Ka Yaw Teo (CCCG, 2021)

Survival Prediction Based on Histopathology Imaging and Clinical Data: A Novel, Whole Slide CNN Approach. - Saloni Agarwal; Mohamedelfatih Eltigani Osman Abaker; Ovidiu Daescu (MICCAI (5), 2021)

Characterization and computation of feasible trajectories for an articulated probe with a variable-length end segment. - Ovidiu Daescu; Ka Yaw Teo (Comput. Geom., 2021)

New bounds on guarding problems for orthogonal polygons in the plane using vertex guards with halfplane vision. - Ovidiu Daescu; Hemant Malik (Theor. Comput. Sci., 2021)

Fast Deterministic Approximation of Medoid in Rd. - Ovidiu Daescu; Ka Yaw Teo (CCCG, 2022)

The Median Line Segment Problem: Computational Complexity and Constrained Variants. - Ovidiu Daescu; Ka Yaw Teo (CCCG, 2022)

Histopathological Cancer Detection with Topological Signatures. - Ankur Yadav; Faisal Ahmed; Ovidiu Daescu; Reyhan Gedik; Baris Coskunuzer (BIBM, 2023)

Approximate Line Segment Nearest Neighbor Search amid Polyhedra in 3-Space. - Ovidiu Daescu; Ka Yaw Teo (CCCG, 2023)

A Unified Machine Learning Framework for Multi-subtype Tumour Classification Across Diverse Datasets. - Ankur Yadav; Ovidiu Daescu (ICCABS, 2023)

Machine Learning for Rhabdomyosarcoma Whole Slide Images Sub-type Classification. - Ankur Yadav; Ovidiu Daescu; Patrick Leavey; Erin R. Rudzinski (PETRA, 2023)

WIP: How to Improve Student Comprehension of Pseudocode Reading and Writing. - Anjum Chida; Ovidiu Daescu (FIE, 2024)

From Topological Signatures to Textural Patterns: Enhancing the Precision of Sand Classification. - Ankur Yadav; Ovidiu Daescu; Zachary Sickmann (SSIAI, 2024)

Optimizing Foundation Models for Histopathology: A Continual Learning Approach to Cancer Detection. - Ankur Yadav; Ovidiu Daescu (TAI4H, 2024)

LLM-Sentry: A Model-Agnostic Human-in-the-Loop Framework for Securing Large Language Models. - Saquib Irtiza; Khandakar Ashrafi Akbar; Arowa Yasmeen; Latifur Khan; Ovidiu Daescu; Bhavani Thuraisingham (TPS-ISA, 2024)

Olfactory Inertial Odometry: Methodology for Effective Robot Navigation by Scent. - Kordel K. France; Ovidiu Daescu (UR, 2025)

Position: Olfaction Standardization is Essential for the Advancement of Embodied Artificial Intelligence. - Kordel K. France; Rohith Peddi; Nik Dennler; Ovidiu Daescu (CoRR, 2025)

Diffusion Graph Neural Networks for Robustness in Olfaction Sensors and Datasets. - Kordel K. France; Ovidiu Daescu (CoRR, 2025)

Olfactory Inertial Odometry: Sensor Calibration and Drift Compensation. - Kordel K. France; Ovidiu Daescu; Anirban Paul; Shalini Prasad (CoRR, 2025)