Parallel Recognitions and Decomposition of Two Terminal Series Parallel Graphs - Xin He 005; Yaacov Yesha (Inf. Comput., 1987)

Binary Tree Algebraic Computation and Parallel Algorithms for Simple Graphs. - Xin He 005; Yaacov Yesha (J. Algorithms, 1988)

A Nearly Optimal Parallel Algorithm for Constructing Depth First Spanning Trees in Planar Graphs. - Xin He 005; Yaacov Yesha (SIAM J. Comput., 1988)

Efficient Parallel and Sequential Algorithms for 4-Coloring Perfect Planar Graphs. - Xin He 005 (Algorithmica, 1990)

Efficient Parallel Algorithms for r-Dominating Set and p-Center Problems on Trees. - Xin He 005; Yaacov Yesha (Algorithmica, 1990)

An Efficient Algorithm for Edge Coloring Planar Graphs with Delta Colors. - Xin He 005 (Theor. Comput. Sci., 1990)

A P-Complete Graph Partition Problem. - R. Sarnath; Xin He 005 (Theor. Comput. Sci., 1990)

An Efficient Parallel Algorithm for Finding Minimum Weight Matching for Points on a Convex Polygon. - Xin He 005 (Inf. Process. Lett., 1991)

An Improved Algorithm for the Planar 3-Cut Problem. - Xin He 005 (J. Algorithms, 1991)

Efficient Parallel Algorithms for Series Parallel Graphs. - Xin He 005 (J. Algorithms, 1991)

O(n log log n)-Work Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs. - Martin Fürer; Xin He 005; Ming-Yang Kao; Balaji Raghavachari (SPAA, 1992)

Parallel Algorithm for Cograph Recognition with Applications. - Xin He 005 (SWAT, 1992)

Parallel Construction of Canonical Ordering and Convex Drawing of Triconnected Planar Graphs. - Xin He 005; Ming-Yang Kao (ISAAC, 1993)

Two Algorithms for Finding Rectangular Duals of Planar Graphs. - Goos Kant; Xin He 005 (WG, 1993)

Regular Edge Labelings and Drawings of Planar Graphs. - Xin He 005; Ming-Yang Kao (GD, 1994)

Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs. - Ming-Yang Kao; Martin Fürer; Xin He 005; Balaji Raghavachari (SIAM J. Discret. Math., 1994)

NC Algorithms for Partitioning Planar Graphs into Induced Forests and Approximating NP-Hard Problems. - Zhi-Zhong Chen; Xin He 005 (WG, 1995)

An Efficient Parallel Algorithm for Finding Rectangular Duals of Plane Triangular Graphs. - Xin He 005 (Algorithmica, 1995)

on Determining Non-isotopic Configurations of Points on a Circle. - Xin He 005; David B. Sher (Discret. Appl. Math., 1995)

Fast RNC and NC Algorithms for Finding a Maximal Set of Paths with an Application. - Ryuhei Uehara; Zhi-Zhong Chen; Xin He 005 (COCOON, 1996)

An NC Algorithm for Finding a Minimum Weighted Completion Time Schedule on Series Parallel Graphs. - Sivaprakasam Sunder; Xin He 005 (Algorithmica, 1996)

Parallel Complexity of Partitioning a Planar Graph Into Vertex-induced Forests. - Zhi-Zhong Chen; Xin He 005 (Discret. Appl. Math., 1996)

On Distances between Phylogenetic Trees (Extended Abstract). - Bhaskar DasGupta; Xin He 005; Tao Jiang 001; Ming Li 001; John Tromp; Louxin Zhang (SODA, 1997)

Shortest Path in Complete Bipartite Digraph Problem and its Applications. - Xin He 005; Zhi-Zhong Chen (SODA, 1997)

On Floorplans of Planar Graphs. - Xin He 005 (STOC, 1997)

Parallel Algorithms for Maximal Acyclic Sets. - Zhi-Zhong Chen; Xin He 005 (Algorithmica, 1997)

Grid Embedding of 4-Connected Plane Graphs. - Xin He 005 (Discret. Comput. Geom., 1997)

On Parallel Selection and Searching in Partial Orders: Sorted Matrices. - R. Sarnath; Xin He 005 (J. Parallel Distributed Comput., 1997)

Regular Edge Labeling of 4-Connected Plane Graphs and Its Applications in Graph Drawing Problems. - Goos Kant; Xin He 005 (Theor. Comput. Sci., 1997)

Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses. - Richie Chih-Nan Chuang; Ashim Garg; Xin He 005; Ming-Yang Kao; Hsueh-I Lu (ICALP, 1998)

Scheduling Interval Ordered Tasks in Parallel. - Sivaprakasam Sunder; Xin He 005 (J. Algorithms, 1998)

On computing the nearest neighbor interchange distance. - Bhaskar DasGupta; Xin He 005; Tao Jiang 001; Ming Li 001; John Tromp; Louxin Zhang (Discrete Mathematical Problems with Medical Applications, 1999)

Nonplanar Topological Inference and Political-Map Graphs. - Zhi-Zhong Chen; Xin He 005; Ming-Yang Kao (SODA, 1999)

On the Linear-Cost Subtree-Transfer Distance between Phylogenetic Trees. - Bhaskar DasGupta; Xin He 005; Tao Jiang 001; Ming Li 001; John Tromp (Algorithmica, 1999)

An Algorithm for Shortest Paths in Bipartite Digraphs with Concave Weight Matrices and its Applications. - Xin He 005; Zhi-Zhong Chen (SIAM J. Comput., 1999)

Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings. - Xin He 005; Ming-Yang Kao; Hsueh-I Lu (SIAM J. Discret. Math., 1999)

Fast RNC and NC Algorithms for Maximal Path Sets. - Ryuhei Uehara; Zhi-Zhong Chen; Xin He 005 (Theor. Comput. Sci., 1999)

Hierarchical Topological Inference on Planar Disc Maps. - Zhi-Zhong Chen; Xin He 005 (COCOON, 2000)

A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs. - Xin He 005; Ming-Yang Kao; Hsueh-I Lu (SIAM J. Comput., 2000)

Finding a hamiltonian paths in tournaments on clusters - a provably communication-efficient approach. - Chun-Hsi Huang; Xin He 005 (SAC, 2001)

A Simple Linear Time Algorithm for Proper Box Rectangular Drawings of Plane Graphs. - Xin He 005 (J. Algorithms, 2001)

Communication Efficient BSP Algorithm for All Nearest Smaller Values Problem. - Xin He 005; Chun-Hsi Huang (J. Parallel Distributed Comput., 2001)

A Simple Linear Time Algorithm for Finding Even Triangulations of 2-Connected Bipartite Plane Graphs. - Huaming Zhang; Xin He 005 (ESA, 2002)

Average-Case Communication-Optimal Parallel Parenthesis Matching. - Chun-Hsi Huang; Xin He 005 (ISAAC, 2002)

Finding Double Euler Trails of Planar Graphs in Linear Time. - Zhi-Zhong Chen; Xin He 005; Chun-Hsi Huang (SIAM J. Comput., 2002)

Compact Visibility Representation and Straight-Line Grid Embedding of Plane Graphs. - Huaming Zhang; Xin He 005 (WADS, 2003)

Common-Face Embeddings of Planar Graphs. - Zhi-Zhong Chen; Xin He 005; Ming-Yang Kao (SIAM J. Comput., 2003)

New Theoretical Bounds of Visibility Representation of Plane Graphs. - Huaming Zhang; Xin He 005 (GD, 2004)

On Visibility Representation of Plane Graphs. - Huaming Zhang; Xin He 005 (STACS, 2004)

Disk Embeddings of Planar Graphs. - Zhi-Zhong Chen; Xin He 005 (Algorithmica, 2004)

Improved visibility representation of plane graphs. - Huaming Zhang; Xin He 005 (Comput. Geom., 2005)

Canonical Ordering Trees and Their Applications in Graph Drawing. - Huaming Zhang; Xin He 005 (Discret. Comput. Geom., 2005)

Visibility representation of plane graphs via canonical ordering tree, . - Huaming Zhang; Xin He 005 (Inf. Process. Lett., 2005)

On Even Triangulations of 2-Connected Embedded Graphs. - Huaming Zhang; Xin He 005 (SIAM J. Comput., 2005)

Finding Hamiltonian paths in tournaments on clusters. - Chun-Hsi Huang; Sanguthevar Rajasekaran; Laurence Tianruo Yang; Xin He 005 (Clust. Comput., 2006)

An Application of Well-orderly Trees in Graph Drawing. - Huaming Zhang; Xin He 005 (Int. J. Found. Comput. Sci., 2006)

On simultaneous straight-line grid embedding of a planar graph and its dual. - Huaming Zhang; Xin He 005 (Inf. Process. Lett., 2006)

Communication-optimal parallel parenthesis matching. - Chun-Hsi Huang; Xin He 005; Min Qian (Parallel Comput., 2006)

Nearly Optimal Visibility Representations of Plane Graphs. - Xin He 005; Huaming Zhang (SIAM J. Discret. Math., 2008)

Nearest Neighbor Interchange and Related Distances. - Bhaskar DasGupta; Xin He 005; Tao Jiang 001; Ming Li 001; John Tromp; Louxin Zhang (Encyclopedia of Algorithms, 2008)

Optimal st -orientations for plane triangulations. - Huaming Zhang; Xin He 005 (J. Comb. Optim., 2009)

Schnyder Greedy Routing Algorithm. - Xin He 005; Huaming Zhang (TAMC, 2010)

A generalized greedy routing algorithm for 2-connected graphs. - Huaming Zhang; Xin He 005 (Theor. Comput. Sci., 2010)

On Succinct Convex Greedy Drawing of 3-Connected Plane Graphs. - Xin He 005; Huaming Zhang (SODA, 2011)

Visibility Representation of Plane Graphs with Simultaneous Bound for Both Width and Height. - Jiun-Jie Wang; Xin He 005 (J. Graph Algorithms Appl., 2012)

Compact visibility representation of 4-connected plane graphs. - Xin He 005; Jiun-Jie Wang; Huaming Zhang (Theor. Comput. Sci., 2012)

A simple routing algorithm based on Schnyder coordinates. - Xin He 005; Huaming Zhang (Theor. Comput. Sci., 2013)

On Succinct Greedy Drawings of Plane Triangulations and 3-Connected Plane Graphs. - Xin He 005; Huaming Zhang (Algorithmica, 2014)

Succinct strictly convex greedy drawing of 3-connected plane graphs. - Jiun-Jie Wang; Xin He 005 (Theor. Comput. Sci., 2014)

Compact Monotone Drawing of Trees. - Xin He 005; Dayu He (COCOON, 2015)

Monotone Drawings of 3-Connected Plane Graphs. - Xin He 005; Dayu He (ESA, 2015)

Star Shaped Orthogonal Drawing. - Xin He 005; Dayu He (TAMC, 2015)

A Linear Time Algorithm for Determining Almost Bipartite Graphs. - Dayu He; Xin He 005 (TAMC, 2015)

Nearly optimal monotone drawing of trees. - Dayu He; Xin He 005 (Theor. Comput. Sci., 2016)

Nearest Neighbor Interchange and Related Distances. - Bhaskar DasGupta; Xin He 005; Ming Li 001; John Tromp; Louxin Zhang (Encyclopedia of Algorithms, 2016)

On Characterization of Petrie Partitionable Plane Graphs. - Xin He 005; Huaming Zhang (TAMC, 2020)

More Efficient Parallel Integer Sorting. - Yijie Han; Xin He 005 (Int. J. Found. Comput. Sci., 2022)

On Petrie cycle and Petrie tour partitions of 3- and 4-regular plane graphs. - Xin He 005; Huaming Zhang; Yijie Han (Math. Struct. Comput. Sci., 2022)