Spatial Point Location and Its Applications. - Xuehou Tan; Tomio Hirata; Yasuyoshi Inagaki (SIGAL International Symposium on Algorithms, 1990)

The Intersection Searching Problem for c-Oriented Polygons. - Xuehou Tan; Tomio Hirata; Yasuyoshi Inagaki (Inf. Process. Lett., 1991)

Constructing Shortest Watchman Routes by Divide-and-Conquer. - Xuehou Tan; Tomio Hirata (ISAAC, 1993)

An incremental algorithm for constructing shortest watchman routes. - Xuehou Tan; Tomio Hirata; Yasuyoshi Inagaki (Int. J. Comput. Geom. Appl., 1993)

Shortest Safari Routes in Simple Polygon. - Xuehou Tan; Tomio Hirata (ISAAC, 1994)

Complexity of Projected Images of Convex Subdivisions. - Tomio Hirata; Jirí Matousek 001; Xuehou Tan; Takeshi Tokuyama (Comput. Geom., 1994)

An optimal channel-routing algorithm in the times square model. - Xiaoyu Song; Xuehou Tan (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1994)

Hexagonal Three-Layer Channel Routing. - Xuehou Tan; Xiaoyu Song (Inf. Process. Lett., 1995)

Two-Guarding a Rectilinear Polygon. - Xuehou Tan; Binhai Zhu (COCOON, 1996)

Hexagonal Routings of Multiterminal Nets. - Xuehou Tan; Xiaoyu Song (COCOON, 1997)

An Efficient Solution to the Corridor Search Problem. - Xuehou Tan (JCDCG, 1998)

Routing Multiterminal Nets on a Hexagonal Grid. - Xuehou Tan; Xiaoyu Song (Discret. Appl. Math., 1999)

Edge Guards in Straight Walkable Polygons. - Xuehou Tan (Int. J. Comput. Geom. Appl., 1999)

Corrigendum to "An Incremental Algorithm for Constructing Shortest Watchman Routes". - Xuehou Tan; Tomio Hirata; Yasuyoshi Inagaki (Int. J. Comput. Geom. Appl., 1999)

Searching a Simple Polygon by a k-Searcher. - Xuehou Tan (ISAAC, 2000)

Efficient Algorithms for Searching a Polygonal Room with a Door. - Xuehou Tan (JCDCG, 2000)

On optimal bridges between two convex regions. - Xuehou Tan (Inf. Process. Lett., 2000)

Shortest zookeeper's routes in simple polygons. - Xuehou Tan (Inf. Process. Lett., 2001)

Fast computation of shortest watchman routes in simple polygons. - Xuehou Tan (Inf. Process. Lett., 2001)

Optimal computation of the Voronoi diagram of disjoint clusters. - Xuehou Tan (Inf. Process. Lett., 2001)

Finding an Optimal Bridge Between Two Polygons. - Xuehou Tan (Int. J. Comput. Geom. Appl., 2002)

A Characterization of Polygonal Regions Searchable from the Boundary. - Xuehou Tan (IJCCGGT, 2003)

Finding shortest safari routes in simple polygons. - Xuehou Tan; Tomio Hirata (Inf. Process. Lett., 2003)

The Two-Guard Problem Revisited and Its Generalization. - Xuehou Tan (ISAAC, 2004)

An Optimal Algorithm for the 1-Searchability of Polygonal Rooms. - Xuehou Tan (JCDCG, 2004)

Approximation algorithms for the watchman route and zookeeper's problems. - Xuehou Tan (Discret. Appl. Math., 2004)

Approximation Algorithms for Cutting Out Polygons with Lines and Rays. - Xuehou Tan (COCOON, 2005)

Linear-Time 2-Approximation Algorithm for the Watchman Route Problem. - Xuehou Tan (TAMC, 2006)

Editorial. - Jin Akiyama; Mikio Kano; Xuehou Tan (Comput. Geom., 2006)

A 2-approximation algorithm for the zookeeper's problem. - Xuehou Tan (Inf. Process. Lett., 2006)

Searching a Polygonal Region by Two Guards. - Xuehou Tan (TAMC, 2007)

Sweeping simple polygons with the minimum number of chain guards. - Xuehou Tan (Inf. Process. Lett., 2007)

A linear-time 2-approximation algorithm for the watchman route problem for simple polygons. - Xuehou Tan (Theor. Comput. Sci., 2007)

A unified and efficient solution to the room search problem. - Xuehou Tan (Comput. Geom., 2008)

An efficient algorithm for the three-guard problem. - Xuehou Tan (Discret. Appl. Math., 2008)

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)

New Algorithms for Barrier Coverage with Mobile Sensors. - Xuehou Tan; Gangshan Wu (FAW, 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)

Approximation algorithms for cutting a convex polyhedron out of a sphere. - Xuehou Tan; Gangshan Wu (Theor. Comput. Sci., 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)

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)

An Improved On-line Strategy for Exploring Unknown Polygons. - Xuehou Tan; Qi Wei 005 (COCOA, 2015)

A New Distributed Algorithm for Computing a Dominating Set on Grids. - Photchchara Pisantechakool; Xuehou Tan (FAW, 2015)

Optimal Point Movement for Covering Circular Regions. - Danny Ziyi Chen; Xuehou Tan; Haitao Wang 001; Gangshan Wu (Algorithmica, 2015)

On the Capture Time of Cops and Robbers Game on a Planar Graph. - Photchchara Pisantechakool; Xuehou Tan (COCOA, 2016)

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)

On the Conjecture of the Smallest 3-Cop-Win Planar Graph. - Photchchara Pisantechakool; Xuehou Tan (TAMC, 2017)

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

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)

The capture time of a planar graph. - Photchchara Pisantechakool; Xuehou Tan (J. Comb. Optim., 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)

Walking an Unknown Street with Limited Sensing. - Qi Wei 005; Xuehou Tan; Yonggong Ren (Int. J. Pattern Recognit. Artif. Intell., 2019)

Polynomial-Time Algorithms for the Touring Rays and Related Problems. - Xuehou Tan (AAIM, 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)

The simple grid polygon exploration problem. - Qi Wei 005; Jie Sun; Xuehou Tan; Xiaolin Yao; Yonggong Ren (J. Comb. Optim., 2021)

The touring rays and related problems. - Xuehou Tan (Theor. Comput. Sci., 2021)

Largest Convex Hulls for Constant Size, Convex-Hull Disjoint Clusters. - Xuehou Tan; Rong Chen (TAMC, 2022)

Simple Proof of the Lower Bound on the Average Distance from the Fermat-Weber Center of a Convex Body. - Xuehou Tan (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2022)

Improved exploration of unknown polygons. - Xuehou Tan; Qi Wei 005 (Theor. Comput. Sci., 2022)

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

Revisiting the Stretch Factor of Delaunay Triangulations of Points in Convex Position. - Xuehou Tan; Rong Chen; Qing Jiang (AAIM (1), 2024)

SPU-PMD: Self-Supervised Point Cloud Upsampling via Progressive Mesh Deformation. - Yanzhe Liu; Rong Chen; Yushi Li; Yixi Li; Xuehou Tan (CVPR, 2024)

Largest convex hulls for convex-hull disjoint clusters with bounded size. - Xuehou Tan; Rong Chen (Theor. Comput. Sci., 2025)

On-line exploration of an unbounded region with one obstacle. - Qi Wei 005; Xuehou Tan; Haonan Wu; Xiaolin Yao; Yonggong Ren (Theor. Comput. Sci., 2025)

An Optimal and Practical Algorithm for the Planar 2-center Problem. - Xuehou Tan (Theory Comput. Syst., 2025)