| Approximate majority analyses using tri-molecular chemical reaction networks | 0 | 0.34 | 2020 |
| Optimal Collusion-Free Teaching. | 0 | 0.34 | 2019 |
| Minimizing Interference Potential Among Moving Entities. | 0 | 0.34 | 2019 |
| Swapping Colored Tokens on Graphs. | 2 | 0.37 | 2018 |
| Space-Efficient And Output-Sensitive Implementations Of Greedy Algorithms On Intervals | 0 | 0.34 | 2017 |
| Preference-based Teaching of Unions of Geometric Objects. | 0 | 0.34 | 2017 |
| Foreword | 0 | 0.34 | 2016 |
| Characterizing minimum-length coordinated motions for two discs. | 0 | 0.34 | 2016 |
| Minimizing Co-location Potential of Moving Entities. | 1 | 0.37 | 2016 |
| Progressive Alignment of Shapes. | 0 | 0.34 | 2016 |
| Computational Aspects of M.C. Escher's Ribbon Patterns. | 0 | 0.34 | 2014 |
| Õ(√n)-Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability. | 7 | 0.51 | 2014 |
| O(sqrt(n))-Space and Polynomial-time Algorithm for the Planar Directed Graph Reachability Problem. | 2 | 0.40 | 2014 |
| Multi-Path Algorithms for minimum-colour path problems with applications to approximating barrier resilience | 1 | 0.37 | 2014 |
| A Polynomial-Time Algorithm for Computing the Resilience of Arrangements of Ray Sensors. | 2 | 0.44 | 2014 |
| Closing a Long-Standing Complexity Gap for Selection: V 3(42) = 50. | 3 | 0.40 | 2013 |
| On k-Guarding Polygons. | 1 | 0.40 | 2013 |
| M.C. escher wrap artist: aesthetic coloring of ribbon patterns | 1 | 0.40 | 2012 |
| Discrete Dubins Paths | 0 | 0.34 | 2012 |
| Approximating Barrier Resilience for Arrangements of Non-identical Disk Sensors. | 2 | 0.39 | 2012 |
| Can nearest neighbor searching be simple and always fast? | 0 | 0.34 | 2011 |
| Hardness Results for Two-Dimensional Curvature-Constrained Motion Planning. | 1 | 0.36 | 2011 |
| On routing with guaranteed delivery in three-dimensional ad hoc wireless networks | 41 | 1.97 | 2010 |
| Multi-guard covers for polygonal regions | 0 | 0.34 | 2010 |
| Determining the robustness of sensor barriers | 0 | 0.34 | 2010 |
| Hyperbolic Dovetailing | 5 | 0.55 | 2009 |
| Bounded-Velocity Approximation Of Mobile Euclidean 2-Centres | 9 | 0.65 | 2008 |
| Optimally scheduling video-on-demand to minimize delay when sender and receiver bandwidth may differ | 8 | 0.53 | 2006 |
| On the Spanning Ratio of Gabriel Graphs and beta-Skeletons. | 1 | 0.35 | 2006 |
| The Steiner Centre Of A Set Of Points: Stability, Eccentricity, And Applications To Mobile Facility Location | 1 | 0.36 | 2006 |
| The Projection Median of a Set of Points in R2 | 5 | 0.49 | 2005 |
| Computing The Set Of All The Distant Horizons Of A Terrain | 1 | 0.36 | 2005 |
| Computing the set of all distant horizons of a terrain | 2 | 0.38 | 2004 |
| The gaussian centre and the projection centre of a set of points in r3 | 0 | 0.34 | 2004 |
| Minimizing the trace length of a rod endpoint in the presence of polygonal obstacles is NP-hard | 2 | 0.37 | 2003 |
| The Gaussian Centre of a Set of Mobile Points | 0 | 0.34 | 2003 |
| On the hardness of turn-angle-restricted rectilinear cycle cover problems | 1 | 0.38 | 2002 |
| Lower and Upper Bounds for Tracking Mobile Users | 2 | 0.37 | 2002 |
| An exact algebraic predicate for maintaining the topology of the voronoi diagram for circles | 0 | 0.34 | 2002 |
| Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons | 20 | 1.04 | 2002 |
| Mobile facility location | 20 | 1.61 | 2000 |
| Separation Sensitive Kinetic Separation Structures for Convex Polygons | 7 | 0.64 | 2000 |
| Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs | 5 | 0.52 | 2000 |
| Guarding Alcove-Free Galleries | 0 | 0.34 | 2000 |
| Rectilinear 2-center problems | 6 | 0.58 | 1999 |
| Unit disk graph recognition is NP-hard | 134 | 8.69 | 1998 |
| Parallel Construction of Binary Trees with Near Optimal Weighted Path Lengt | 6 | 0.61 | 1996 |
| Approximating Shortest Paths in Arrangements of Lines | 7 | 0.88 | 1996 |
| Determining bar-representability for ordered weighted graphs | 4 | 0.44 | 1996 |
| Efficient Algorithms for Guarding or Illuminating the Surface of a Polyhedral Terrain | 2 | 0.44 | 1996 |
