| Approximation algorithms for the Weighted t-Uniform Sparsest Cut and some other graph partitioning problems. | 0 | 0.34 | 2016 |
| Paired many-to-many disjoint path covers in faulty hypercubes | 2 | 0.36 | 2013 |
| Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs. | 13 | 0.58 | 2013 |
| Guest Editorial: Special Issue on Algorithms and Computation. | 0 | 0.34 | 2012 |
| Farthest Voronoi Diagrams under Travel Time Metrics - (Extended Abstract). | 0 | 0.34 | 2012 |
| The Balloon Popping Problem Revisited: Lower and Upper Bounds | 1 | 0.38 | 2011 |
| Computing minimum-area rectilinear convex hull and L-shape | 3 | 0.40 | 2009 |
| The geodesic farthest-site Voronoi diagram in a polygonal domain with holes | 3 | 0.48 | 2009 |
| Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs | 0 | 0.34 | 2009 |
| A 6.55 factor primal-dual approximation algorithm for the connected facility location problem | 3 | 0.39 | 2009 |
| Casting an Object with a Core | 1 | 0.37 | 2009 |
| Approximation algorithms for connected facility location problems | 7 | 0.52 | 2008 |
| Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem | 8 | 0.50 | 2008 |
| Maintaining extremal points and its applications to deciding optimal orientations | 4 | 0.52 | 2007 |
| Optimal construction of the city voronoi diagram | 12 | 0.78 | 2006 |
| Voronoi Diagrams For A Transportation Network On The Euclidean Plane | 9 | 0.66 | 2006 |
| Optimal broadcasting with universal lists based on competitive analysis | 3 | 0.49 | 2005 |
| Shortest paths and voronoi diagrams with transportation networks under general distances | 10 | 0.71 | 2005 |
| Improved gossipings by short messages in 2-dimensional meshes | 0 | 0.34 | 2005 |
| Guarding art galleries by guarding witnesses | 2 | 0.39 | 2004 |
| Voronoi diagrams with a transportation network on the euclidean plane | 7 | 0.57 | 2004 |
| Hamiltonian properties on the class of hypercube-like networks | 44 | 1.66 | 2004 |
| Labeling points with given rectangles | 3 | 0.41 | 2004 |
| Equivalence of Search Capability Among Mobile Guards with Various Visibilities | 1 | 0.36 | 2004 |
| Online deadline scheduling on faster machines | 0 | 0.34 | 2003 |
| Non-clairvoyant scheduling for weighted flow time | 2 | 0.47 | 2003 |
| Scheduling broadcasts with deadlines | 1 | 0.40 | 2003 |
| Approximation algorithms for general parallel task scheduling | 0 | 0.34 | 2002 |
| Simple algorithms for searching a polygon with flashlights | 13 | 1.18 | 2002 |
| Searching A Room By Two Guards | 6 | 0.58 | 2002 |
| Optimization Algorithms for Sweeping a Polygonal Region with Mobile Guards | 0 | 0.34 | 2001 |
| On-Line Deadline Scheduling on Multiple Resources | 3 | 0.42 | 2001 |
| Broadcasting with Universal Lists Revisited: Using Competitive Analysis | 0 | 0.34 | 2001 |
| Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher | 20 | 1.30 | 2001 |
| Carrying Umbrellas: an Online Relocation Game on a Graph | 0 | 0.34 | 2001 |
| Approximation of Curvature-Constrained Shortest Paths through a Sequence of Points | 10 | 0.62 | 2000 |
| Three-Dimensional Topological Sweep For Computing Rotational Swept Volumes Of Polyhedral Objects | 1 | 0.35 | 2000 |
| Recursive circulants and their embeddings among hypercubes | 46 | 2.51 | 2000 |
| Searching A Polygonal Room With One Door By A 1-Searcher | 27 | 2.06 | 2000 |
| Optimal embedding of multiple directed Hamiltonian rings into d-dimensional meshes | 0 | 0.34 | 2000 |
| Characterization of Rooms Searchable by Two Guards | 1 | 0.36 | 2000 |
| Area-efficient algorithms for straight-line tree drawings | 19 | 1.14 | 2000 |
| Tight analysis of a self-approaching strategy for the online kernel-search problem | 6 | 0.73 | 1999 |
| Carrying Umbrellas: An Online Relocation Problem on Graphs | 0 | 0.34 | 1999 |
| Online Scheduling of Parallel Communications with Individual Deadlines | 3 | 0.42 | 1999 |
| Scheduling parallel tasks with individual deadlines | 13 | 0.74 | 1999 |
| Visibility-based pursuit-evasion in a polygonal room with a door | 27 | 1.82 | 1999 |
| On Computing Translational Swept Volumes | 1 | 0.37 | 1999 |
| Multiple graph embeddings into a processor array with spanning buses | 0 | 0.34 | 1998 |
| Two-Center Problems for a Convex Polygon (Extended Abstract) | 3 | 0.44 | 1998 |
