| General-Demand Disjoint Path Covers In A Graph With Faulty Elements | 7 | 0.46 | 2012 |
| Disjoint path covers in recursive circulants G(2m,4) with faulty elements | 13 | 0.60 | 2011 |
| Improved gossipings by short messages in 2-dimensional meshes | 0 | 0.34 | 2005 |
| Equivalence of Search Capability Among Mobile Guards with Various Visibilities | 1 | 0.36 | 2004 |
| Online deadline scheduling: multiple machines and randomization | 4 | 0.51 | 2003 |
| Online Deadline Scheduling: Team Adversary and Restart | 0 | 0.34 | 2003 |
| 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 |
| 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 |
| 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 |
| 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 |
| Visibility-based pursuit-evasion in a polygonal room with a door | 27 | 1.82 | 1999 |
| New competitive strategies for searching in unknown star-shaped polygons | 4 | 0.69 | 1997 |
| Directed Hamiltonian Packing in d-Dimensional Meshes and Its Application (Extended Abstract) | 2 | 0.47 | 1996 |
