Searching a Polygonal Region by Two Guards. - Xuehou Tan; Bo Jiang 004 (J. Comput. Sci. Technol., 2008)

Searching a Circular Corridor with Two Flashlights. - Bo Jiang 004; Xuehou Tan (TAMC, 2009)

Simple Characterization of LR-visibility Polygons. - Xuehou Tan; Jing Zhang; Bo Jiang 004 (CGGA, 2010)

Searching for mobile intruders in circular corridors by two 1-searchers. - Bo Jiang 004; Xuehou Tan (Discret. Appl. Math., 2011)

A New Approach to the Upper Bound on the Average Distance from the Fermat-Weber Center of a Convex Body. - Xuehou Tan; Bo Jiang 004 (COCOA, 2013)

A Characterization of Link-2 LR-visibility Polygons with Applications. - Xuehou Tan; Jing Zhang; Bo Jiang 004 (JCDCGG, 2013)

On-Line Strategies for Evacuating from a Convex Region in the Plane. - Qi Wei 005; Xuehou Tan; Bo Jiang 004; Lijuan Wang (COCOA, 2014)

Finding Simple Paths on Given Points in a Polygonal Region. - Xuehou Tan; Bo Jiang 004 (FAW, 2014)

Strategies for Evacuating from an Affected Area with One or Two Groups. - Qi Wei 005; Yuan Shi; Bo Jiang 004; Lijuan Wang (ICA3PP (1), 2014)

Characterizing and recognizing LR-visibility polygons. - Xuehou Tan; Bo Jiang 004; Jing Zhang (Discret. Appl. Math., 2014)

Optimum sweeps of simple polygons with two guards. - Xuehou Tan; Bo Jiang 004 (Inf. Process. Lett., 2014)

Minimization of the maximum distance between the two guards patrolling a polygonal region. - Xuehou Tan; Bo Jiang 004 (Theor. Comput. Sci., 2014)

Searching a Circular Corridor with Three Flashlights. - Jiandong Liu; Bo Jiang 004; Lijuan Wang (BDCloud, 2015)

Competitive Strategies for Evacuating from an Unknown Affected Area. - Qi Wei 005; Xuehou Tan; Bo Jiang 004 (IEICE Trans. Inf. Syst., 2016)

Evacuating from an Unknown Affected Area. - Qi Wei 005; Xuehou Tan; Bo Jiang 004; Lijuan Wang (Int. J. Pattern Recognit. Artif. Intell., 2016)

Simple O(n log^2 n) Algorithms for the Planar 2-Center Problem. - Xuehou Tan; Bo Jiang 004 (COCOON, 2017)

Efficient Algorithms for Touring a Sequence of Convex Polygons and Related Problems. - Xuehou Tan; Bo Jiang 004 (TAMC, 2017)

An Efficient Algorithm for Finding the Minimum Perimeter Convex Hull of Disjoint Segments. - Nan Li; Bo Jiang 004; Nannan Li 002 (CSAE, 2018)

The Touring Polygons Problem Revisited. - Xuehou Tan; Bo Jiang 004 (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018)

An improved algorithm for computing a shortest watchman route for lines. - Xuehou Tan; Bo Jiang 004 (Inf. Process. Lett., 2018)

Improved Stretch Factor of Delaunay Triangulations of Points in Convex Position. - Xuehou Tan; Charatsanyakul Sakthip; Bo Jiang 004 (COCOA, 2019)

Computing simple paths from given points inside a polygon. - Xuehou Tan; Bo Jiang 004 (Discret. Appl. Math., 2019)

Characterizing Link-2 LR-Visibility Polygons and Related Problems. - Xuehou Tan; Bo Jiang 004 (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019)

Adaptive and Feature-Preserving Bilateral Filters for Three-Dimensional Models. - Nannan Li 002; Shaoyang Yue; Bo Jiang 004 (Traitement du Signal, 2020)

On the upper bound on the average distance from the Fermat-Weber center of a convex body. - Xuehou Tan; Bo Jiang 004 (Comput. Geom., 2021)

Improved stretch factor of Delaunay triangulations of points in convex position. - Xuehou Tan; Charatsanyakul Sakthip; Bo Jiang 004; Shimao Liu (J. Comb. Optim., 2023)