Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems G Kant, X He Theoretical Computer Science 172 (1-2), 175-193, 1997 | 202 | 1997 |

Scalar aggregation in inconsistent databases M Arenas, L Bertossi, J Chomicki, X He, V Raghavan, J Spinrad Theoretical Computer Science 296 (3), 405-434, 2003 | 169 | 2003 |

On the linear-cost subtree-transfer distance between phylogenetic trees B DasGupta, X He, T Jiang, M Li, J Tromp Algorithmica 25, 176-195, 1999 | 152 | 1999 |

Compact encodings of planar graphs via canonical orderings and multiple parentheses RCN Chuang, A Garg, X He, MY Kao, HI Lu Automata, Languages and Programming: 25th International Colloquium, ICALP'98 …, 1998 | 142 | 1998 |

On finding disjoint paths in single and dual link cost networks D Xu, Y Chen, Y Xiong, C Qiao, X He IEEE INFOCOM 2004 1, 2004 | 120 | 2004 |

On finding the rectangular duals of planar triangular graphs X He SIAM Journal on Computing 22 (6), 1218-1226, 1993 | 117 | 1993 |

On computing the nearest neighbor interchange distance JTLZ Bhaskar DasGupta, Xin He, Tao Jiang, Ming Li DIMACS Series in Discrete Mathematics and Theoretical Computer Science 55 …, 2000 | 94* | 2000 |

On the complexity of and algorithms for finding the shortest path with a disjoint counterpart D Xu, Y Chen, Y Xiong, C Qiao, X He IEEE/ACM Transactions on Networking 14 (1), 147-158, 2006 | 92 | 2006 |

Linear-time succinct encodings of planar graphs via canonical orderings X He, MY Kao, HI Lu SIAM Journal on Discrete Mathematics 12 (3), 317-325, 1999 | 79 | 1999 |

Parallel recognition and decomposition of two terminal series parallel graphs X He, Y Yesha Information and Computation 75 (1), 15-38, 1987 | 77 | 1987 |

Two Algorithms for Finding Rectangular Duals of Planar Graphs G Kant, X He | 75 | 1992 |

A Fast General Methodology for Information—Theoretically Optimal Encodings of Graphs MYKHIL Xin He The 7th Annual European Symposium on Algorithms (ESA'99), Lecture Notes in …, 1999 | 70 | 1999 |

On floor-plan of plane graphs X He SIAM Journal on Computing 28 (6), 2150-2167, 1999 | 69 | 1999 |

Grid embedding of 4-connected plane graphs X He Graph Drawing. GD 1995, Lecture Notes in Computer Science 1027, 287-299, 1995 | 64 | 1995 |

Binary tree algebraic computation and parallel algorithms for simple graphs X He, Y Yesha Journal of Algorithms 9 (1), 92-113, 1988 | 56 | 1988 |

Efficient parallel algorithms for series parallel graphs X He Journal of Algorithms 12 (3), 409-430, 1991 | 53 | 1991 |

Compact visibility representation and straight-line grid embedding of plane graphs H Zhang, X He Workshop on Algorithms and Data Structures, 493-504, 2003 | 45 | 2003 |

A nearly optimal parallel algorithm for constructing depth first spanning trees in planar graphs X He, Y Yesha SIAM Journal on Computing 17 (3), 486-491, 1988 | 38 | 1988 |

Efficient parallel algorithms for solving some tree problems X He 24th Allerton Conference on Communication, Control and Computing, 1986, 1986 | 35 | 1986 |

Minimum area layout of series-parallel transistor networks is NP-hard S Chakravarty, X He, SS Ravi IEEE transactions on computer-aided design of integrated circuits and …, 1991 | 33 | 1991 |