| 2025 | TAMC | A Space-Partition Based Approach to the 2-Center Problem in Three and Higher Dimensions. | Xuehou Tan, Rong Chen |
| 2024 | AAIM | Revisiting the Stretch Factor of Delaunay Triangulations of Points in Convex Position. | Xuehou Tan, Rong Chen, Qing Jiang |
| 2024 | CVPR | SPU-PMD: Self-Supervised Point Cloud Upsampling via Progressive Mesh Deformation. | Yanzhe Liu, Rong Chen, Yushi Li, Yixi Li, Xuehou Tan |
| 2024 | TAMC | An Optimal and Practical Algorithm for the Planar 2-Center Problem. | Xuehou Tan |
| 2022 | TAMC | Largest Convex Hulls for Constant Size, Convex-Hull Disjoint Clusters. | Xuehou Tan, Rong Chen |
| 2020 | AAIM | Polynomial-Time Algorithms for the Touring Rays and Related Problems. | Xuehou Tan |
| 2019 | COCOA | Improved Stretch Factor of Delaunay Triangulations of Points in Convex Position. | Xuehou Tan, Charatsanyakul Sakthip, Bo Jiang |
| 2017 | COCOON | Simple O(n~log^2~n) Algorithms for the Planar 2-Center Problem. | Xuehou Tan, Bo Jiang |
| 2017 | TAMC | On the Conjecture of the Smallest 3-Cop-Win Planar Graph. | Photchchara Pisantechakool, Xuehou Tan |
| 2017 | TAMC | Efficient Algorithms for Touring a Sequence of Convex Polygons and Related Problems. | Xuehou Tan, Bo Jiang |
| 2016 | COCOA | On the Capture Time of Cops and Robbers Game on a Planar Graph. | Photchchara Pisantechakool, Xuehou Tan |
| 2015 | COCOA | An Improved On-line Strategy for Exploring Unknown Polygons. | Xuehou Tan, Qi Wei |
| 2015 | FAW | A New Distributed Algorithm for Computing a Dominating Set on Grids. | Photchchara Pisantechakool, Xuehou Tan |
| 2014 | COCOA | On-Line Strategies for Evacuating from a Convex Region in the Plane. | Qi Wei, Xuehou Tan, Bo Jiang, Lijuan Wang |
| 2014 | FAW | Finding Simple Paths on Given Points in a Polygonal Region. | Xuehou Tan, Bo Jiang |
| 2013 | COCOA | A New Approach to the Upper Bound on the Average Distance from the Fermat-Weber Center of a Convex Body. | Xuehou Tan, Bo Jiang |
| 2012 | AAIM | Minimization of the Maximum Distance between the Two Guards Patrolling a Polygonal Region. | Xuehou Tan, Bo Jiang |
| 2012 | ISAAC | Optimal Point Movement for Covering Circular Regions. | Danny Z. Chen, Xuehou Tan, Haitao Wang, Gangshan Wu |
| 2011 | AAIM | Approximation Algorithms for Cutting a Convex Polyhedron Out of a Sphere. | Xuehou Tan, Gangshan Wu |
| 2010 | FAW | Optimum Sweeps of Simple Polygons with Two Guards. | Xuehou Tan, Bo Jiang |
| 2010 | FAW | New Algorithms for Barrier Coverage with Mobile Sensors. | Xuehou Tan, Gangshan Wu |
| 2009 | TAMC | Searching a Circular Corridor with Two Flashlights. | Bo Jiang, Xuehou Tan |
| 2007 | TAMC | Searching a Polygonal Region by Two Guards. | Xuehou Tan |
| 2006 | TAMC | Linear-Time 2-Approximation Algorithm for the Watchman Route Problem. | Xuehou Tan |
| 2005 | COCOON | Approximation Algorithms for Cutting Out Polygons with Lines and Rays. | Xuehou Tan |
| 2004 | ISAAC | The Two-Guard Problem Revisited and Its Generalization. | Xuehou Tan |
| 2001 | COCOON | Finding an Optimal Bridge between Two Polygons. | Xuehou Tan |
| 2001 | COCOON | Approximation Algorithms for the Watchman Route and Zookeeper's Problems. | Xuehou Tan |
| 2000 | ISAAC | Searching a Simple Polygon by a | Xuehou Tan |
| 1997 | COCOON | Hexagonal Routings of Multiterminal Nets. | Xuehou Tan, Xiaoyu Song |
| 1996 | COCOON | Two-Guarding a Rectilinear Polygon. | Xuehou Tan, Binhai Zhu |
| 1994 | ISAAC | Shortest Safari Routes in Simple Polygon. | Xuehou Tan, Tomio Hirata |
| 1993 | ISAAC | Constructing Shortest Watchman Routes by Divide-and-Conquer. | Xuehou Tan, Tomio Hirata |