Ovidiu Daescu

Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

2020

Two-dimensional closest pair problem: A closer look.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Trajectory planning for an articulated probe.

[BibT_eX]

[DOI]

Kyle Fox

Comput. Geom., 2020

Guarding Disjoint Orthogonal Polygons in the Plane.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2020

City Guarding with Limited Field of View.

[BibT_eX]

Mohamedelfatih Eltigani Osman Abaker

Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

Rhabdomyosarcoma Histology Classification using Ensemble of Deep Learning Networks.

[BibT_eX]

[DOI]

Saloni Agarwal

Proceedings of the BCB '20: 11th ACM International Conference on Bioinformatics, 2020

2019

Dynamic minimum bichromatic separating circle.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Altitude terrain guarding and guarding uni-monotone polygons.

[BibT_eX]

[DOI]

Comput. Geom., 2019

k-Maximum Subarrays for Small k: Divide-and-Conquer Made Simpler.

[BibT_eX]

[DOI]

Proceedings of the Analysis of Experimental Algorithms - Special Event, 2019

Deep learning based face recognition system with smart glasses.

[BibT_eX]

[DOI]

Hongyao Huang

Maxwell A. Weinzierl

Proceedings of the 12th ACM International Conference on PErvasive Technologies Related to Assistive Environments, 2019

Computing Feasible Trajectories for an Articulated Probe in Three Dimensions.

[BibT_eX]

Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

2018

Convolutional Neural Network for Histopathological Analysis of Osteosarcoma.

[BibT_eX]

[DOI]

J. Comput. Biol., 2018

Improved line facility location in weighted subdivisions.

[BibT_eX]

[DOI]

Proceedings of the 3rd International Workshop on Interactive and Spatial Computing, 2018

Image Based Detection of Craniofacial Abnormalities using Feature Extraction by Classical Convolutional Neural Network.

[BibT_eX]

[DOI]

Proceedings of the 8th IEEE International Conference on Computational Advances in Bio and Medical Sciences, 2018

Does a Robot Path Have Clearance C?

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2018

2017

Computer Aided Image Segmentation and Classification for Viable and Non-Viable Tumor Identification in Osteosarcoma.

[BibT_eX]

[DOI]

Harish Babu Arunachalam

Molly Ni'suilleabhain

Proceedings of the Biocomputing 2017: Proceedings of the Pacific Symposium, 2017

Interactive Assistive Framework for Maximum Profit Routing in Public Transportation in Smart Cities.

[BibT_eX]

[DOI]

Proceedings of the 10th International Conference on PErvasive Technologies Related to Assistive Environments, 2017

Histopathological Diagnosis for Viable and Non-viable Tumor Prediction for Osteosarcoma Using Convolutional Neural Network.

[BibT_eX]

[DOI]

Proceedings of the Bioinformatics Research and Applications - 13th International Symposium, 2017

2D Closest Pair Problem: A Closer Look.

[BibT_eX]

Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

Deep learning for skin lesion segmentation.

[BibT_eX]

[DOI]

Rashika Mishra

Proceedings of the 2017 IEEE International Conference on Bioinformatics and Biomedicine, 2017

2016

Approximation Algorithms for the Maximum Profit Pick-up Problem with Time Windows and Capacity Constraint.

[BibT_eX]

[DOI]

CoRR, 2016

Approximation algorithms for the Vehicle Routing Problem with Time Windows, Capacity Constraint and Unlimited Number of Vehicles: Poster Paper.

[BibT_eX]

[DOI]

Proceedings of the 9th ACM International Conference on PErvasive Technologies Related to Assistive Environments, 2016

Maximum Area Rectangle Separating Red and Blue Points.

[BibT_eX]

Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015

Algorithms for fair partitioning of convex polygons.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Smallest Maximum-Weight Circle for Weighted Points in the Plane.

[BibT_eX]

[DOI]

Proceedings of the Computational Science and Its Applications - ICCSA 2015, 2015

Whole slide images stitching for osteosarcoma detection.

[BibT_eX]

[DOI]

Harish Babu Arunachalam

Proceedings of the 5th IEEE International Conference on Computational Advances in Bio and Medical Sciences, 2015

2014

Improving healthcare cost transparency through mobile application development.

[BibT_eX]

[DOI]

Proceedings of the 7th International Conference on PErvasive Technologies Related to Assistive Environments, 2014

Optimization of IMRT treatment plan with Kinetic Data Structures.

[BibT_eX]

[DOI]

Proceedings of the IEEE 4th International Conference on Computational Advances in Bio and Medical Sciences, 2014

2013

Largest area convex hull of imprecise data based on axis-aligned squares.

[BibT_eX]

[DOI]

J. Comb. Optim., 2013

On some geometric problems of color-spanning sets.

[BibT_eX]

[DOI]

J. Comb. Optim., 2013

A comprehensive system for locating medical services.

[BibT_eX]

[DOI]

Proceedings of the 6th International Conference on PErvasive Technologies Related to Assistive Environments, 2013

Radiation therapy simulation and optimization using kinetic polygon modeling.

[BibT_eX]

[DOI]

Proceedings of the IEEE 14th International Conference on Information Reuse & Integration, 2013

2012

Preface.

[BibT_eX]

[DOI]

Weili Wu

Theor. Comput. Sci., 2012

The Voronoi diagram for graphs and its application in the Sickle Cell Disease research.

[BibT_eX]

[DOI]

J. Comput. Sci., 2012

Minimum-sum dipolar spanning tree in R3.

[BibT_eX]

[DOI]

Comput. Geom., 2012

Volume matching with application in medical treatment planning.

[BibT_eX]

[DOI]

Proceedings of the IEEE 2nd International Conference on Computational Advances in Bio and Medical Sciences, 2012

2011

Line facility location in weighted regions.

[BibT_eX]

[DOI]

J. Comb. Optim., 2011

Face It: 3D Facial Reconstruction from a Single 2D Image for Games and Simulations.

[BibT_eX]

[DOI]

J. Steven Kirtzic

Proceedings of the 2011 International Conference on Cyberworlds, 2011

Largest Area Convex Hull of Axis-Aligned Squares Based on Imprecise Data.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

Kinetic Red-Blue Minimum Separating Circle.

[BibT_eX]

[DOI]

Marko Zivanic

Proceedings of the Combinatorial Optimization and Applications, 2011

Rigid region pairwise sequence alignment.

[BibT_eX]

[DOI]

Marko Zivanic

Proceedings of the 2011 IEEE International Conference on Bioinformatics and Biomedicine Workshops, 2011

Optimal delivery of volumetric modulated arc therapy (VMAT) for moving target.

[BibT_eX]

[DOI]

Sairam Behera

Lech Papiez

Proceedings of the 2011 IEEE International Conference on Bioinformatics and Biomedicine Workshops, 2011

Volume matching with application in medical treatment planning.

[BibT_eX]

[DOI]

Lech Papiez

Proceedings of the ACM International Conference on Bioinformatics, 2011

2010

FréChet Distance Problems in Weighted Regions.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2010

Minimum Sum Dipolar Spanning Tree in R^3

[BibT_eX]

[DOI]

CoRR, 2010

Approximate Point-to-Face Shortest Paths in R^3

[BibT_eX]

[DOI]

CoRR, 2010

Guarding a Terrain by Two Watchtowers.

[BibT_eX]

[DOI]

Algorithmica, 2010

Applying Parallel Design Techniques to Template Matching with GPUs.

[BibT_eX]

[DOI]

Robert Finis Anderson

J. Steven Kirtzic

Proceedings of the High Performance Computing for Computational Science - VECPAR 2010, 2010

Visiting a Sequence of Points with a Bevel-Tip Needle.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

Minimum Separating Circle for Bichromatic Points in the Plane.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Symposium on Voronoi Diagrams in Science and Engineering, 2010

NP-Completeness of Spreading Colored Points.

[BibT_eX]

[DOI]

Wenqi Ju

Proceedings of the Combinatorial Optimization and Applications, 2010

2009

Parallel Optimal Weighted Links.

[BibT_eX]

[DOI]

Trans. Comput. Sci., 2009

Towards an optimal algorithm for recognizing Laman graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2009

Farthest segments and extremal triangles spanned by points in R3.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

Minimum Separation in Weighted Subdivisions.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2009

Stabbing balls and simplifying proteins.

[BibT_eX]

[DOI]

Int. J. Bioinform. Res. Appl., 2009

A PTAS for Cutting Out Polygons with Lines.

[BibT_eX]

[DOI]

Sergey Bereg

Minghui Jiang

Algorithmica, 2009

Polygonal chain simplification for flight simulation systems.

[BibT_eX]

[DOI]

Proceedings of the 2009 Spring Simulation Multiconference, SpringSim 2009, 2009

Line Segment Facility Location in Weighted Subdivisions.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2009

2008

Modeling Optimal Beam Treatment with Weighted Regions for Bio-medical Applications.

[BibT_eX]

[DOI]

Proceedings of the Generalized Voronoi Diagram: A Geometry-Based Approach to Computational Intelligence, 2008

Finding a Minimum-Sum Dipolar Spanning Tree in R3.

[BibT_eX]

[DOI]

Proceedings of the 41st Hawaii International International Conference on Systems Science (HICSS-41 2008), 2008

On Some City Guarding Problems.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

Polygonal Chain Simplification with Small Angle Constraints.

[BibT_eX]

Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

A New Modeling for Finding Optimal Weighted Distances.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Biocomputation, 2008

2007

Computing Simple Paths on Points in Simple Polygons.

[BibT_eX]

[DOI]

Proceedings of the Computational Geometry and Graph Theory, 2007

Minimum-sum Dipolar Spanning Tree for Points in R3.

[BibT_eX]

[DOI]

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

Finding Segments and Triangles Spanned by Points in R3.

[BibT_eX]

[DOI]

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006

GARA: a geometry aided routing algorithm.

[BibT_eX]

[DOI]

Gheorghe Fasui

Karthik Haridoss

Wirel. Commun. Mob. Comput., 2006

Cutting out Polygons with Lines and Rays.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2006

Farthest-point queries with geometric and combinatorial constraints.

[BibT_eX]

[DOI]

Comput. Geom., 2006

Proximity problems on line segments spanned by points.

[BibT_eX]

[DOI]

David M. Mount

Comput. Geom., 2006

Load-balanced agent activation for value-added network services.

[BibT_eX]

[DOI]

Comput. Commun., 2006

An Experimental Study of Weighted k-Link Shortest Path Algorithms.

[BibT_eX]

[DOI]

Joseph S. B. Mitchell

Simeon C. Ntafos

Chee-Keng Yap

Proceedings of the Algorithmic Foundation of Robotics VII, 2006

Approximating minimum-cost polygonal paths of bounded number of links in weighted subdivisions.

[BibT_eX]

[DOI]

Joseph S. B. Mitchell

Simeon C. Ntafos

Chee-Keng Yap

Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

Finding optimal weighted bridges with applications.

[BibT_eX]

[DOI]

Proceedings of the 44st Annual Southeast Regional Conference, 2006

2005

Flexible Strategies for Disk Scheduling in Multimedia Presentation Servers.

[BibT_eX]

[DOI]

Multim. Tools Appl., 2005

Efficient Algorithms and Implementations for Optimizing the Sum of Linear Fractional Functions, with Applications.

[BibT_eX]

[DOI]

J. Comb. Optim., 2005

Extremal point queries with lines and line segments and related problems.

[BibT_eX]

[DOI]

Robert Serfling

Comput. Geom., 2005

Polygonal chain approximation: a query based approach.

[BibT_eX]

[DOI]

Ningfang Mi

Comput. Geom., 2005

Polygonal path simplification with angle constraints.

[BibT_eX]

[DOI]

Comput. Geom., 2005

k-Link Shortest Paths in Weighted Subdivisions.

[BibT_eX]

[DOI]

Joseph S. B. Mitchell

Simeon C. Ntafos

Chee-Keng Yap

Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

1-link shortest paths in weighted regions.

[BibT_eX]

[DOI]

Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

Guarding a terrain by two watchtowers.

[BibT_eX]

[DOI]

Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

Cutting Out Polygons.

[BibT_eX]

[DOI]

Ramaswamy Chandrasekaran

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

Stabbing Balls and Simplifying proteins.

[BibT_eX]

[DOI]

J. Luo

Proceedings of the Advances in Bioinformatics and Its Applications, 2005

2004

New Results on Path Approximation.

[BibT_eX]

[DOI]

Algorithmica, 2004

Optimal placement of NAK-suppressing agents for reliable multicast: a partial deployment case.

[BibT_eX]

[DOI]

Proceedings of the 2004 ACM Symposium on Applied Computing (SAC), 2004

Load balancing for reliable multicast.

[BibT_eX]

Proceedings of the IASTED International Conference on Communications, Internet, and Information Technology, November 22, 2004

2003

Finding an optimal path without growing the tree.

[BibT_eX]

[DOI]

J. Algorithms, 2003

Space-Efficient Algorithms for Approximating Polygonal Curves in Two-Dimensional Space.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2003

Efficient Parallel Algorithms for Planar st-Graphs.

[BibT_eX]

[DOI]

Mikhail J. Atallah

Algorithmica, 2003

Polygonal Path Approximation: A Query Based Approach.

[BibT_eX]

[DOI]

Ningfang Mi

Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

Task planning with transportation constraints: approximation bounds, implementation and experiments.

[BibT_eX]

[DOI]

Derek Soeder

R. N. Uma

Proceedings of the 2003 IEEE International Conference on Robotics and Automation, 2003

2002

Efficiently Approximating Polygonal Paths in Three and Higher Dimensions.

[BibT_eX]

[DOI]

Algorithmica, 2002

Flexible disk scheduling for multimedia presentation servers.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 10th IEEE International Conference on Networks: Towards Network Superiority, 2002

Computing Optimal Trajectories for Medical Treatment Planning and Optimization.

[BibT_eX]

[DOI]

Ashish Bhatia

Proceedings of the Computational Science - ICCS 2002, 2002

Improved Optimal Weighted Links Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Computational Science - ICCS 2002, 2002

2001

Determining an Optimal Penetration Among Weighted Regions in Two and Three Dimensions.

[BibT_eX]

[DOI]

J. Comb. Optim., 2001

On Geometric Path Query Problems.

[BibT_eX]

[DOI]

Kevin S. Klenk

Int. J. Comput. Geom. Appl., 2001

Polygonal path approximation with angle constraints.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Parallel Optimal Weighted Links.

[BibT_eX]

[DOI]

Proceedings of the Computational Science - ICCS 2001, 2001

2000

Optimizing the sum of linear fractional functions and applications.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1998

Maintaining Visibility of a Polygon with a Moving Point of View.

[BibT_eX]

[DOI]