Ovidiu Daescu - RankMe

150 papers A* 3A 1B 5C 11Misc 10Journal 55Unranked 59

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Chasing Ghosts: A Simulation-to-Real Olfactory Navigation Stack with Optional Vision Augmentation. CoRR Kordel K. France, Ovidiu Daescu, Latifur Khan, Rohith Peddi
2025	J	`jnl`	Diffusion Graph Neural Networks for Robustness in Olfaction Sensors and Datasets. CoRR Kordel K. France, Ovidiu Daescu
2025	—	`conf`	Olfactory Inertial Odometry: Methodology for Effective Robot Navigation by Scent. UR Kordel K. France, Ovidiu Daescu
2025	J	`jnl`	Olfactory Inertial Odometry: Methodology for Effective Robot Navigation by Scent. CoRR Kordel K. France, Ovidiu Daescu
2025	J	`jnl`	Olfactory Inertial Odometry: Sensor Calibration and Drift Compensation. CoRR Kordel K. France, Ovidiu Daescu, Anirban Paul, Shalini Prasad
2025	J	`jnl`	Position: Olfaction Standardization is Essential for the Advancement of Embodied Artificial Intelligence. CoRR Kordel K. France, Rohith Peddi, Nik Dennler, Ovidiu Daescu
2024	—	`conf`	From Topological Signatures to Textural Patterns: Enhancing the Precision of Sand Classification. SSIAI Ankur Yadav, Ovidiu Daescu, Zachary Sickmann
2024	—	`conf`	LLM-Sentry: A Model-Agnostic Human-in-the-Loop Framework for Securing Large Language Models. TPS-ISA Saquib Irtiza, Khandakar Ashrafi Akbar, Arowa Yasmeen, Latifur Khan, Ovidiu Daescu, Bhavani Thuraisingham
2024	—	`conf`	Optimizing Foundation Models for Histopathology: A Continual Learning Approach to Cancer Detection. TAI4H Ankur Yadav, Ovidiu Daescu
2024	C	`conf`	WIP: How to Improve Student Comprehension of Pseudocode Reading and Writing. FIE Anjum Chida, Ovidiu Daescu
2023	—	`conf`	A Unified Machine Learning Framework for Multi-subtype Tumour Classification Across Diverse Datasets. ICCABS Ankur Yadav, Ovidiu Daescu
2023	—	`conf`	Approximate Line Segment Nearest Neighbor Search amid Polyhedra in 3-Space. CCCG Ovidiu Daescu, Ka Yaw Teo
2023	—	`conf`	Histopathological Cancer Detection with Topological Signatures. BIBM Ankur Yadav, Faisal Ahmed, Ovidiu Daescu, Reyhan Gedik, Baris Coskunuzer
2023	—	`conf`	Machine Learning for Rhabdomyosarcoma Whole Slide Images Sub-type Classification. PETRA Ankur Yadav, Ovidiu Daescu, Patrick Leavey, Erin R. Rudzinski
2022	—	`conf`	Fast Deterministic Approximation of Medoid in R CCCG Ovidiu Daescu, Ka Yaw Teo
2022	—	`conf`	The Median Line Segment Problem: Computational Complexity and Constrained Variants. CCCG Ovidiu Daescu, Ka Yaw Teo
2021	J	`jnl`	Characterization and computation of feasible trajectories for an articulated probe with a variable-length end segment. Comput. Geom. Ovidiu Daescu, Ka Yaw Teo
2021	J	`jnl`	New bounds on guarding problems for orthogonal polygons in the plane using vertex guards with halfplane vision. Theor. Comput. Sci. Ovidiu Daescu, Hemant Malik
2021	—	`conf`	Survival Prediction Based on Histopathology Imaging and Clinical Data: A Novel, Whole Slide CNN Approach. MICCAI (5) Saloni Agarwal, Mohamedelfatih Eltigani Osman Abaker, Ovidiu Daescu
2021	—	`conf`	The Discrete Median and Center Line Segment Problems in the Plane. CCCG Ovidiu Daescu, Ka Yaw Teo
2020	—	`conf`	Characterization and Computation of Feasible Trajectories for an Articulated Probe with a Variable-Length End Segment. CCCG Ovidiu Daescu, Ka Yaw Teo
2020	J	`jnl`	Characterization and Computation of Feasible Trajectories for an Articulated Probe with a Variable-Length End Segment. CoRR Ovidiu Daescu, Ka Yaw Teo
2020	—	`conf`	City Guarding with Limited Field of View. CCCG Ovidiu Daescu, Hemant Malik
2020	J	`jnl`	City Guarding with Limited Field of View. CoRR Ovidiu Daescu, Hemant Malik
2020	J	`jnl`	Computing Feasible Trajectories for an Articulated Probe in Three Dimensions. CoRR Ovidiu Daescu, Ka Yaw Teo
2020	C	`conf`	Guarding Disjoint Orthogonal Polygons in the Plane. COCOA Ovidiu Daescu, Hemant Malik
2020	—	`conf`	Rhabdomyosarcoma Histology Classification using Ensemble of Deep Learning Networks. BCB Saloni Agarwal, Mohamedelfatih Eltigani Osman Abaker, Xinyi Zhang, Ovidiu Daescu, Donald A. Barkauskas, Erin R. Rudzinski, Patrick Leavey
2020	J	`jnl`	Trajectory planning for an articulated probe. Comput. Geom. Ka Yaw Teo, Ovidiu Daescu, Kyle Fox
2020	J	`jnl`	Two-dimensional closest pair problem: A closer look. Discret. Appl. Math. Ovidiu Daescu, Ka Yaw Teo
2019	J	`jnl`	Altitude terrain guarding and guarding uni-monotone polygons. Comput. Geom. Ovidiu Daescu, Stephan Friedrichs, Hemant Malik, Valentin Polishchuk, Christiane Schmidt
2019	—	`conf`	Computing Feasible Trajectories for an Articulated Probe in Three Dimensions. CCCG Ovidiu Daescu, Ka Yaw Teo
2019	—	`conf`	Deep learning based face recognition system with smart glasses. PETRA Ovidiu Daescu, Hongyao Huang, Maxwell A. Weinzierl
2019	J	`jnl`	Dynamic minimum bichromatic separating circle. Theor. Comput. Sci. Bogdan Armaselu, Ovidiu Daescu
2019	—	`conf`	k-Maximum Subarrays for Small k: Divide-and-Conquer Made Simpler. SEA² Ovidiu Daescu, Hemant Malik
2018	J	`jnl`	Convolutional Neural Network for Histopathological Analysis of Osteosarcoma. J. Comput. Biol. Rashika Mishra, Ovidiu Daescu, Patrick Leavey, Dinesh Rakheja, Anita Sengupta
2018	C	`conf`	Does a Robot Path Have Clearance C? COCOA Ovidiu Daescu, Hemant Malik
2018	J	`jnl`	Does a robot path have clearance c? CoRR Ovidiu Daescu, Hemant Malik
2018	—	`conf`	Image Based Detection of Craniofacial Abnormalities using Feature Extraction by Classical Convolutional Neural Network. ICCABS Saloni Agarwal, Rami R. Hallac, Rashika Mishra, Chao Li, Ovidiu Daescu, Alex A. Kane
2018	—	`conf`	Improved line facility location in weighted subdivisions. IWISC Ovidiu Daescu, Ka Yaw Teo
2018	—	`conf`	Trajectory Planning for an Articulated Probe. CCCG Ovidiu Daescu, Kyle Fox, Ka Yaw Teo
2018	J	`jnl`	k-Maximum Subarrays for Small k: Divide-and-Conquer made simpler. CoRR Hemant Malik, Ovidiu Daescu
2017	—	`conf`	2D Closest Pair Problem: A Closer Look. CCCG Ovidiu Daescu, Ka Yaw Teo
2017	—	`ed.`	Bioinformatics Research and Applications - 13th International Symposium, ISBRA 2017, Honolulu, HI, USA, May 29 - June 2, 2017, Proceedings ISBRA Zhipeng Cai, Ovidiu Daescu, Min Li
2017	Misc	`conf`	Computer Aided Image Segmentation and Classification for Viable and Non-Viable Tumor Identification in Osteosarcoma. PSB Harish Babu Arunachalam, Rashika Mishra, Bogdan Armaselu, Ovidiu Daescu, Maria Martinez, Patrick Leavey, Dinesh Rakheja, Kevin Cederberg, Anita Sengupta, Molly Ni'suilleabhain
2017	—	`conf`	Deep learning for skin lesion segmentation. BIBM Rashika Mishra, Ovidiu Daescu
2017	—	`conf`	Histopathological Diagnosis for Viable and Non-viable Tumor Prediction for Osteosarcoma Using Convolutional Neural Network. ISBRA Rashika Mishra, Ovidiu Daescu, Patrick Leavey, Dinesh Rakheja, Anita Sengupta
2017	—	`conf`	Interactive Assistive Framework for Maximum Profit Routing in Public Transportation in Smart Cities. PETRA Bogdan Armaselu, Ovidiu Daescu
2017	J	`jnl`	Maximum Area Rectangle Separating Red and Blue Points. CoRR Bogdan Armaselu, Ovidiu Daescu
2016	J	`jnl`	Approximation Algorithms for the Maximum Profit Pick-up Problem with Time Windows and Capacity Constraint. CoRR Bogdan Armaselu, Ovidiu Daescu
2016	—	`conf`	Approximation algorithms for the Vehicle Routing Problem with Time Windows, Capacity Constraint and Unlimited Number of Vehicles: Poster Paper. PETRA Bogdan Armaselu, Ovidiu Daescu
2016	—	`conf`	Maximum Area Rectangle Separating Red and Blue Points. CCCG Bogdan Armaselu, Ovidiu Daescu
2015	J	`jnl`	Algorithms for fair partitioning of convex polygons. Theor. Comput. Sci. Bogdan Armaselu, Ovidiu Daescu
2015	C	`conf`	Dynamic Minimum Bichromatic Separating Circle. COCOA Bogdan Armaselu, Ovidiu Daescu
2015	—	`conf`	Smallest Maximum-Weight Circle for Weighted Points in the Plane. ICCSA (2) Sergey Bereg, Ovidiu Daescu, Marko Zivanic, Timothy Rozario
2015	—	`conf`	Whole slide images stitching for osteosarcoma detection. ICCABS Bogdan Armaselu, Harish Babu Arunachalam, Ovidiu Daescu, John-Paul Bach, Kevin Cederberg, Dinesh Rakheja, Anita Sengupta, Stephen Skapek, Patrick Leavey
2014	C	`conf`	Algorithms for Fair Partitioning of Convex Polygons. COCOA Bogdan Armaselu, Ovidiu Daescu
2014	—	`conf`	Improving healthcare cost transparency through mobile application development. PETRA David Allen, Ovidiu Daescu
2014	—	`conf`	Optimization of IMRT treatment plan with Kinetic Data Structures. ICCABS David Allen, Ovidiu Daescu
2013	—	`conf`	A comprehensive system for locating medical services. PETRA David Allen, Ovidiu Daescu
2013	J	`jnl`	Largest area convex hull of imprecise data based on axis-aligned squares. J. Comb. Optim. Wenqi Ju, Jun Luo, Binhai Zhu, Ovidiu Daescu
2013	J	`jnl`	On some geometric problems of color-spanning sets. J. Comb. Optim. Wenqi Ju, Chenglin Fan, Jun Luo, Binhai Zhu, Ovidiu Daescu
2013	Misc	`conf`	Radiation therapy simulation and optimization using kinetic polygon modeling. IRI David Allen, Ovidiu Daescu
2012	J	`jnl`	Minimum-sum dipolar spanning tree in R Comput. Geom. Steven Bitner, Ovidiu Daescu
2012	J	`jnl`	Preface. Theor. Comput. Sci. Weili Wu, Ovidiu Daescu
2012	J	`jnl`	The Voronoi diagram for graphs and its application in the Sickle Cell Disease research. J. Comput. Sci. Marko Zivanic, Ovidiu Daescu, Anastasia Kurdia, S. R. Goodman
2012	—	`conf`	Volume matching with application in medical treatment planning. ICCABS Yam Ki Cheung, Ovidiu Daescu, J. Steven Kirtzic, Lech Papiez
2011	C	`conf`	Face It: 3D Facial Reconstruction from a Single 2D Image for Games and Simulations. CW J. Steven Kirtzic, Ovidiu Daescu
2011	C	`conf`	Kinetic Red-Blue Minimum Separating Circle. COCOA Yam Ki Cheung, Ovidiu Daescu, Marko Zivanic
2011	Misc	`conf`	Largest Area Convex Hull of Axis-Aligned Squares Based on Imprecise Data. COCOON Ovidiu Daescu, Wenqi Ju, Jun Luo, Binhai Zhu
2011	J	`jnl`	Line facility location in weighted regions. J. Comb. Optim. Yam Ki Cheung, Ovidiu Daescu
2011	—	`conf`	Optimal delivery of volumetric modulated arc therapy (VMAT) for moving target. BIBM Workshops Sairam Behera, Ovidiu Daescu, Lech Papiez
2011	—	`conf`	Rigid region pairwise sequence alignment. BIBM Workshops Marko Zivanic, Ovidiu Daescu, Anastasia Kurdia
2011	—	`conf`	Volume matching with application in medical treatment planning. BCB Yam Ki Cheung, Ovidiu Daescu, Lech Papiez
2010	—	`conf`	Applying Parallel Design Techniques to Template Matching with GPUs. VECPAR Robert Finis Anderson, J. Steven Kirtzic, Ovidiu Daescu
2010	J	`jnl`	Approximate Point-to-Face Shortest Paths in R^3 CoRR Yam Ki Cheung, Ovidiu Daescu
2010	—	`ed.`	Combinatorial Optimization and Applications - 4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part I COCOA (1) Weili Wu, Ovidiu Daescu
2010	—	`ed.`	Combinatorial Optimization and Applications - 4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part II COCOA (2) Weili Wu, Ovidiu Daescu
2010	J	`jnl`	FréChet Distance Problems in Weighted Regions. Discret. Math. Algorithms Appl. Yam Ki Cheung, Ovidiu Daescu
2010	J	`jnl`	Fréchet Distance Problems in Weighted Regions CoRR Yam Ki Cheung, Ovidiu Daescu
2010	J	`jnl`	Guarding a Terrain by Two Watchtowers. Algorithmica Pankaj K. Agarwal, Sergey Bereg, Ovidiu Daescu, Haim Kaplan, Simeon C. Ntafos, Micha Sharir, Binhai Zhu
2010	—	`conf`	Minimum Separating Circle for Bichromatic Points in the Plane. ISVD Steven Bitner, Yam Ki Cheung, Ovidiu Daescu
2010	J	`jnl`	Minimum Sum Dipolar Spanning Tree in R^3 CoRR Steven Bitner, Ovidiu Daescu
2010	—	`conf`	NP-Completeness of Spreading Colored Points. COCOA (1) Ovidiu Daescu, Wenqi Ju, Jun Luo
2010	B	`conf`	Visiting a Sequence of Points with a Bevel-Tip Needle. LATIN Steven Bitner, Yam Ki Cheung, Atlas F. Cook, Ovidiu Daescu, Anastasia Kurdia, Carola Wenk
2009	J	`jnl`	A PTAS for Cutting Out Polygons with Lines. Algorithmica Sergey Bereg, Ovidiu Daescu, Minghui Jiang
2009	J	`jnl`	Farthest segments and extremal triangles spanned by points in R Inf. Process. Lett. Steven Bitner, Ovidiu Daescu
2009	B	`conf`	Fréchet Distance Problems in Weighted Regions. ISAAC Yam Ki Cheung, Ovidiu Daescu
2009	C	`conf`	Line Segment Facility Location in Weighted Subdivisions. AAIM Yam Ki Cheung, Ovidiu Daescu
2009	J	`jnl`	Minimum Separation in Weighted Subdivisions. Int. J. Comput. Geom. Appl. Ovidiu Daescu, James D. Palmer
2009	J	`jnl`	Parallel Optimal Weighted Links. Trans. Comput. Sci. Ovidiu Daescu, Yam Ki Cheung, James D. Palmer
2009	—	`conf`	Polygonal chain simplification for flight simulation systems. SpringSim Ovidiu Daescu, Anastasia Kurdia
2009	J	`jnl`	Stabbing balls and simplifying proteins. Int. J. Bioinform. Res. Appl. Ovidiu Daescu, Jun Luo
2009	—	`conf`	Towards an Optimal Algorithm for Recognizing Laman Graphs. HICSS Ovidiu Daescu, Anastasia Kurdia
2009	J	`jnl`	Towards an optimal algorithm for recognizing Laman graphs. J. Graph Algorithms Appl. Ovidiu Daescu, Anastasia Kurdia
2008	—	`conf`	A New Modeling for Finding Optimal Weighted Distances. BIOTECHNO Yam Ki Cheung, Ovidiu Daescu, Anastasia Kurdia
2008	—	`conf`	Finding a Minimum-Sum Dipolar Spanning Tree in R3. HICSS Steven Bitner, Ovidiu Daescu
2008	—	`ed.`	International Conference on Biocomputation, Bioinformatics, and Biomedical Technologies, BIOTECHNO 2008, June 29 - July 5, 2008, Bucharest, Romania BIOTECHNO Rita Casadio, Ovidiu Daescu, Cosmin Dini, Daniela Stan Raicu
2008	C	`conf`	Line Facility Location in Weighted Regions. AAIM Yam Ki Cheung, Ovidiu Daescu
2008	—	`ch.`	Modeling Optimal Beam Treatment with Weighted Regions for Bio-medical Applications. Generalized Voronoi Diagram Ovidiu Daescu, James D. Palmer
2008	Misc	`conf`	On Some City Guarding Problems. COCOON Lichen Bao, Sergey Bereg, Ovidiu Daescu, Simeon C. Ntafos, Junqiang Zhou
2008	—	`conf`	Polygonal Chain Simplification with Small Angle Constraints. CCCG Ovidiu Daescu, Anastasia Kurdia
2007	—	`conf`	Computing Simple Paths on Points in Simple Polygons. KyotoCGGT Ovidiu Daescu, Jun Luo
2007	—	`conf`	Finding Segments and Triangles Spanned by Points in R CCCG Steven Bitner, Ovidiu Daescu
2007	—	`conf`	Minimum-sum Dipolar Spanning Tree for Points in R CCCG Steven Bitner, Ovidiu Daescu
2006	Misc	`conf`	A PTAS for Cutting Out Polygons with Lines. COCOON Sergey Bereg, Ovidiu Daescu, Minghui Jiang
2006	C	`conf`	An Experimental Study of Weighted k-Link Shortest Path Algorithms. WAFR Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap
2006	—	`conf`	Approximating minimum-cost polygonal paths of bounded number of links in weighted subdivisions. SCG Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap
2006	J	`jnl`	Cutting out Polygons with Lines and Rays. Int. J. Comput. Geom. Appl. Ovidiu Daescu, Jun Luo
2006	J	`jnl`	Farthest-point queries with geometric and combinatorial constraints. Comput. Geom. Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexander Wolff
2006	—	`conf`	Finding optimal weighted bridges with applications. ACM Southeast Regional Conference Ovidiu Daescu, James D. Palmer
2006	J	`jnl`	GARA: a geometry aided routing algorithm. Wirel. Commun. Mob. Comput. Ovidiu Daescu, Gheorghe Fasui, Karthik Haridoss
2006	J	`jnl`	Load-balanced agent activation for value-added network services. Comput. Commun. Chao Gong, Kamil Saraç, Ovidiu Daescu, Balaji Raghavachari, Raja Jothi
2006	J	`jnl`	Proximity problems on line segments spanned by points. Comput. Geom. Ovidiu Daescu, Jun Luo, David M. Mount
2005	—	`conf`	1-link shortest paths in weighted regions. SCG Ovidiu Daescu, James D. Palmer
2005	—	`conf`	Cutting Out Polygons. CCCG Ramaswamy Chandrasekaran, Ovidiu Daescu, Jun Luo
2005	J	`jnl`	Efficient Algorithms and Implementations for Optimizing the Sum of Linear Fractional Functions, with Applications. J. Comb. Optim. Danny Z. Chen, Ovidiu Daescu, Yang Dai, Naoki Katoh, Xiaodong Wu, Jinhui Xu
2005	J	`jnl`	Extremal point queries with lines and line segments and related problems. Comput. Geom. Ovidiu Daescu, Robert Serfling
2005	J	`jnl`	Flexible Strategies for Disk Scheduling in Multimedia Presentation Servers. Multim. Tools Appl. Sindhu Emilda, Lillykutty Jacob, Ovidiu Daescu, B. Prabhakaran
2005	—	`conf`	Guarding a terrain by two watchtowers. SCG Pankaj K. Agarwal, Sergey Bereg, Ovidiu Daescu, Haim Kaplan, Simeon C. Ntafos, Binhai Zhu
2005	J	`jnl`	Polygonal chain approximation: a query based approach. Comput. Geom. Ovidiu Daescu, Ningfang Mi
2005	J	`jnl`	Polygonal path simplification with angle constraints. Comput. Geom. Danny Z. Chen, Ovidiu Daescu, John Hershberger, Peter M. Kogge, Ningfang Mi, Jack Snoeyink
2005	—	`conf`	Proximity Problems on Line Segments Spanned by Points. CCCG Ovidiu Daescu, Jun Luo, David M. Mount
2005	—	`ch.`	Stabbing Balls and Simplifying proteins. Advances in Bioinformatics and Its Applications Ovidiu Daescu, J. Luo
2004	B	`conf`	Cutting Out Polygons with Lines and Rays. ISAAC Ovidiu Daescu, Jun Luo
2004	—	`conf`	Farthest-Point Queries with Geometric and Combinatorial Constraints. JCDCG Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexander Wolff
2004	—	`conf`	Load balancing for reliable multicast. Communications, Internet, and Information Technology Chao Gong, Ovidiu Daescu, Raja Jothi, Balaji Raghavachari, Kamil Saraç
2004	J	`jnl`	New Results on Path Approximation. Algorithmica Ovidiu Daescu
2004	Misc	`conf`	Optimal placement of NAK-suppressing agents for reliable multicast: a partial deployment case. SAC Ovidiu Daescu, Raja Jothi, Balaji Raghavachari, Kamil Saraç
2003	J	`jnl`	Efficient Parallel Algorithms for Planar Algorithmica Mikhail J. Atallah, Danny Z. Chen, Ovidiu Daescu
2003	J	`jnl`	Finding an optimal path without growing the tree. J. Algorithms Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
2003	B	`conf`	Polygonal Path Approximation: A Query Based Approach. ISAAC Ovidiu Daescu, Ningfang Mi
2003	J	`jnl`	Space-Efficient Algorithms for Approximating Polygonal Curves in Two-Dimensional Space. Int. J. Comput. Geom. Appl. Danny Z. Chen, Ovidiu Daescu
2003	A*	`conf`	Task planning with transportation constraints: approximation bounds, implementation and experiments. ICRA Ovidiu Daescu, Derek Soeder, R. N. Uma
2002	Misc	`conf`	Computing Optimal Trajectories for Medical Treatment Planning and Optimization. International Conference on Computational Science (3) Ovidiu Daescu, Ashish Bhatia
2002	J	`jnl`	Efficiently Approximating Polygonal Paths in Three and Higher Dimensions. Algorithmica Gill Barequet, Danny Z. Chen, Ovidiu Daescu, Michael T. Goodrich, Jack Snoeyink
2002	C	`conf`	Flexible disk scheduling for multimedia presentation servers. IEEE Workshop on Multimedia Signal Processing Sindhu Emilda, Lillykutty Jacob, Ovidiu Daescu, B. Prabhakaran
2002	—	`conf`	Flexible disk scheduling for multimedia presentation servers. ICON Sindhu Emilda, Lillykutty Jacob, Ovidiu Daescu, B. Prabhakaran
2002	Misc	`conf`	Improved Optimal Weighted Links Algorithms. International Conference on Computational Science (3) Ovidiu Daescu
2001	J	`jnl`	Determining an Optimal Penetration Among Weighted Regions in Two and Three Dimensions. J. Comb. Optim. Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Xiaodong Wu, Jinhui Xu
2001	J	`jnl`	On Geometric Path Query Problems. Int. J. Comput. Geom. Appl. Danny Z. Chen, Ovidiu Daescu, Kevin S. Klenk
2001	Misc	`conf`	Parallel Optimal Weighted Links. International Conference on Computational Science (1) Ovidiu Daescu
2001	A*	`conf`	Polygonal path approximation with angle constraints. SODA Danny Z. Chen, Ovidiu Daescu, John Hershberger, Peter M. Kogge, Jack Snoeyink
2000	A*	`conf`	Optimizing the sum of linear fractional functions and applications. SODA Danny Z. Chen, Ovidiu Daescu, Yang Dai, Naoki Katoh, Xiaodong Wu, Jinhui Xu
1999	—	`conf`	Determining an Optimal Penetration Among Weighted Regions in Two and Three Dimensions. SCG Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Xiaodong Wu, Jinhui Xu
1998	—	`conf`	Efficiently Approximating Polygonal Paths in Three and Higher Dimensions. SCG Gill Barequet, Michael T. Goodrich, Danny Z. Chen, Ovidiu Daescu, Jack Snoeyink
1998	A	`conf`	Finding an Optimal Path without Growing the Tree. ESA Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
1998	J	`jnl`	Maintaining Visibility of a Polygon with a Moving Point of View. Inf. Process. Lett. Danny Z. Chen, Ovidiu Daescu
1998	Misc	`conf`	Space-Efficient Algorithms for Approximating Polygonal Curves in Two Dimensional Space. COCOON Danny Z. Chen, Ovidiu Daescu
1997	B	`conf`	On Geometric Path Query Problems. WADS Danny Z. Chen, Ovidiu Daescu, Kevin S. Klenk
1996	—	`conf`	Maintaining Visibility of a Polygon with a Moving Point of View. CCCG Danny Z. Chen, Ovidiu Daescu