| 2007 |
|---|
| 103 | EE | Huaming Zhang,
Xin He:
Optimal st -Orientations for Plane Triangulations.
AAIM 2007: 296-305 |
| 102 | EE | Xin He,
Ling Guo,
Xianzhong Zhou,
Wen Luo:
Hybrid Support Vector Machine and General Model Approach for Audio Classification.
ISNN (3) 2007: 434-440 |
| 101 | EE | Xin He,
Eric C. Frey:
An Optimal Three-Class Linear Observer Derived From Decision Theory.
IEEE Trans. Med. Imaging 26(1): 77-83 (2007) |
| 100 | EE | Xu Ling,
Jing Jiang,
Xin He,
Qiaozhu Mei,
Chengxiang Zhai,
Bruce R. Schatz:
Generating gene summaries from biomedical literature: A study of semi-structured summarization.
Inf. Process. Manage. 43(6): 1777-1791 (2007) |
| 99 | EE | Yue Lu,
Xin He,
Sheng Zhong:
Cross-species microarray analysis with the OSCAR system suggests an INSR->Pax6->NQO1 neuro-protective pathway in aging and Alzheimer's disease.
Nucleic Acids Research 35(Web-Server-Issue): 105-114 (2007) |
| 2006 |
|---|
| 98 | EE | Xin He,
Huaming Zhang:
Nearly Optimal Visibility Representations of Plane Graphs.
ICALP (1) 2006: 407-418 |
| 97 | EE | Xu Ling,
Jing Jiang,
Xin He,
Qiaozhu Mei,
ChengXiang Zhai,
Bruce R. Schatz:
Automatically Generating Gene Summaries from Biomedical Literature.
Pacific Symposium on Biocomputing 2006: 40-51 |
| 96 | EE | Chun-Hsi Huang,
Sanguthevar Rajasekaran,
Laurence Tianruo Yang,
Xin He:
Finding Hamiltonian paths in tournaments on clusters.
Cluster Computing 9(3): 345-353 (2006) |
| 95 | EE | Jing Nie,
Jiangchua Wen,
Ji Luo,
Xin He,
Zheng Zhou:
An adaptive fuzzy logic based secure routing protocol in mobile ad hoc networks.
Fuzzy Sets and Systems 157(12): 1704-1712 (2006) |
| 94 | EE | Xin He,
C. E. Metz,
Benjamin M. W. Tsui,
J. M. Links,
Eric C. Frey:
Three-class ROC analysis-a decision theoretic approach under the ideal observer framework.
IEEE Trans. Med. Imaging 25(5): 571-581 (2006) |
| 93 | EE | Xin He,
Eric C. Frey:
Three-Class ROC Analysis - The Equal Error Utility Assumption and the Optimality of Three-Class ROC Surface Using the Ideal Observer.
IEEE Trans. Med. Imaging 25(8): 979-986 (2006) |
| 92 | EE | Dahai Xu,
Yang Chen,
Yizhi Xiong,
Chunming Qiao,
Xin He:
On the complexity of and algorithms for finding the shortest path with a disjoint counterpart.
IEEE/ACM Trans. Netw. 14(1): 147-158 (2006) |
| 91 | EE | Huaming Zhang,
Xin He:
On simultaneous straight-line grid embedding of a planar graph and its dual.
Inf. Process. Lett. 99(1): 1-6 (2006) |
| 90 | EE | Huaming Zhang,
Xin He:
An Application of Well-orderly Trees in Graph Drawing.
Int. J. Found. Comput. Sci. 17(5): 1129-1142 (2006) |
| 89 | EE | Chun-Hsi Huang,
Xin He,
Min Qian:
Communication-optimal parallel parenthesis matching.
Parallel Computing 32(1): 14-23 (2006) |
| 2005 |
|---|
| 88 | EE | Xiaochun Cheng,
Xin He,
Xiaoqi Ma,
Dongdai Zhou,
Peijun Duan,
Shaochun Zhong:
An Agent Based Education Resource Purvey System.
CIS (1) 2005: 381-386 |
| 87 | EE | Huaming Zhang,
Xin He:
An Application of Well-Orderly Trees in Graph Drawing.
Graph Drawing 2005: 458-467 |
| 86 | | Xin He,
YiPing Zhong,
Shiyong Zhang:
Performance Analysis of a Novel MAC Protocol For Service Differentiation In Wireless Network.
ICWN 2005: 148-154 |
| 85 | | Dennis Kira,
Raafat Saade,
Xin He:
Identifying Factors Impacting Online Learning.
WEBIST 2005: 457-465 |
| 84 | EE | Huaming Zhang,
Xin He:
Improved visibility representation of plane graphs.
Comput. Geom. 30(1): 29-39 (2005) |
| 83 | EE | Huaming Zhang,
Xin He:
Canonical Ordering Trees and Their Applications in Graph Drawing.
Discrete & Computational Geometry 33(2): 321-344 (2005) |
| 82 | EE | Huaming Zhang,
Xin He:
Visibility representation of plane graphs via canonical ordering tree, .
Inf. Process. Lett. 96(2): 41-48 (2005) |
| 81 | EE | Xin He,
Michael H. Goldwasser:
Identifying Conserved Gene Clusters in the Presence of Homology Families.
Journal of Computational Biology 12(6): 638-656 (2005) |
| 80 | EE | Huaming Zhang,
Xin He:
On Even Triangulations of 2-Connected Embedded Graphs.
SIAM J. Comput. 34(3): 683-696 (2005) |
| 2004 |
|---|
| 79 | EE | Huaming Zhang,
Xin He:
New Theoretical Bounds of Visibility Representation of Plane Graphs.
Graph Drawing 2004: 425-430 |
| 78 | EE | Dahai Xu,
Yang Chen,
Yizhi Xiong,
Chunming Qiao,
Xin He:
On finding disjoint paths in single and dual link cost networks.
INFOCOM 2004 |
| 77 | EE | Xin He,
Michael H. Goldwasser:
Identifying conserved gene clusters in the presence of orthologous groups.
RECOMB 2004: 272-280 |
| 76 | EE | Huaming Zhang,
Xin He:
On Visibility Representation of Plane Graphs.
STACS 2004: 477-488 |
| 75 | EE | Zhi-Zhong Chen,
Xin He:
Disk Embeddings of Planar Graphs.
Algorithmica 38(4): 539-576 (2004) |
| 74 | EE | Xin He:
Guest Editor's Foreword.
J. Graph Algorithms Appl. 8(2): 133-134 (2004) |
| 2003 |
|---|
| 73 | EE | Huaming Zhang,
Xin He:
On Even Triangulations of 2-Connected Embedded Graphs.
COCOON 2003: 139-148 |
| 72 | EE | Huaming Zhang,
Xin He:
Compact Visibility Representation and Straight-Line Grid Embedding of Plane Graphs.
WADS 2003: 493-504 |
| 71 | EE | Zhi-Zhong Chen,
Xin He,
Ming-Yang Kao:
Common-Face Embeddings of Planar Graphs.
SIAM J. Comput. 32(2): 408-434 (2003) |
| 70 | EE | Marcelo Arenas,
Leopoldo E. Bertossi,
Jan Chomicki,
Xin He,
Vijay Raghavan,
Jeremy Spinrad:
Scalar aggregation in inconsistent databases.
Theor. Comput. Sci. 3(296): 405-434 (2003) |
| 2002 |
|---|
| 69 | EE | Huaming Zhang,
Xin He:
A Simple Linear Time Algorithm for Finding Even Triangulations of 2-Connected Bipartite Plane Graphs.
ESA 2002: 902-914 |
| 68 | EE | Chun-Hsi Huang,
Xin He:
Average-Case Communication-Optimal Parallel Parenthesis Matching.
ISAAC 2002: 308-319 |
| 67 | EE | Sukumar Ghosh,
Xin He:
Scalable Self-Stabilization.
J. Parallel Distrib. Comput. 62(5): 945-960 (2002) |
| 66 | EE | Zhi-Zhong Chen,
Xin He,
Chun-Hsi Huang:
Finding Double Euler Trails of Planar Graphs in Linear Time.
SIAM J. Comput. 31(4): 1255-1285 (2002) |
| 2001 |
|---|
| 65 | | Chun-Hsi Huang,
Xin He:
Communication-Efficient Bulk Synchronous Parallel Algorithm for Parentheses Matching.
PPSC 2001 |
| 64 | | Chun-Hsi Huang,
Xin He:
Parallel Range Searching in Large Databases Based on General Parallel Prefix Computation.
PPSC 2001 |
| 63 | EE | Chun-Hsi Huang,
Xin He:
Finding a hamiltonian paths in tournaments on clusters - a provably communication-efficient approach.
SAC 2001: 549-553 |
| 62 | EE | Xin He:
A Simple Linear Time Algorithm for Proper Box Rectangular Drawings of Plane Graphs.
WADS 2001: 234-245 |
| 61 | EE | Xin He,
Ming-Yang Kao,
Hsueh-I Lu:
A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs
CoRR cs.DS/0101021: (2001) |
| 60 | EE | Xin He,
Ming-Yang Kao,
Hsueh-I Lu:
Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings
CoRR cs.DS/0101033: (2001) |
| 59 | EE | Richie Chih-Nan Chuang,
Ashim Garg,
Xin He,
Ming-Yang Kao,
Hsueh-I Lu:
Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses
CoRR cs.DS/0102005: (2001) |
| 58 | EE | Zhi-Zhong Chen,
Xin He,
Ming-Yang Kao:
Common-Face Embeddings of Planar Graphs
CoRR cs.DS/0102007: (2001) |
| 57 | | Xin He:
A Simple Linear Time Algorithm for Proper Box Rectangular Drawings of Plane Graphs.
J. Algorithms 40(1): 82-101 (2001) |
| 56 | EE | Xin He,
Chun-Hsi Huang:
Communication Efficient BSP Algorithm for All Nearest Smaller Values Problem.
J. Parallel Distrib. Comput. 61(10): 1425-1438 (2001) |
| 2000 |
|---|
| 55 | EE | Zhi-Zhong Chen,
Xin He:
Hierarchical Topological Inference on Planar Disc Maps.
COCOON 2000: 115-125 |
| 54 | | Chun-Hsi Huang,
Xin He:
Communication Efficient Coarse-Grained Parallel Algorithm for All Nearest Smaller Values Problem and its Applications.
PDPTA 2000 |
| 53 | | Xin He,
Chun-Hsi Huang:
Scalable Coarse Grained Parallel Interval Graph Algorithms.
PDPTA 2000 |
| 52 | EE | Sukumar Ghosh,
Xin He:
Fault-containing self-stabilization using priority scheduling.
Inf. Process. Lett. 73(3-4): 145-151 (2000) |
| 51 | EE | Xin He,
Ming-Yang Kao,
Hsueh-I Lu:
A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs.
SIAM J. Comput. 30(3): 838-846 (2000) |
| 1999 |
|---|
| 50 | EE | Xin He,
Ming-Yang Kao,
Hsueh-I Lu:
A Fast General Methodology for Information - Theoretically Optimal Encodings of Graphs.
ESA 1999: 540-549 |
| 49 | EE | Zhi-Zhong Chen,
Xin He,
Chun-Hsi Huang:
Finding Double Euler Trails of Planar Graphs in Linear Time.
FOCS 1999: 319-329 |
| 48 | EE | Zhi-Zhong Chen,
Xin He,
Ming-Yang Kao:
Nonplanar Topological Inference and Political-Map Graphs.
SODA 1999: 195-204 |
| 47 | | Sukumar Ghosh,
Xin He:
Scalable self-stabilization.
WSS 1999: 18-24 |
| 46 | EE | Bhaskar DasGupta,
Xin He,
Tao Jiang,
Ming Li,
John Tromp:
On the Linear-Cost Subtree-Transfer Distance between Phylogenetic Trees.
Algorithmica 25(2-3): 176-195 (1999) |
| 45 | | Xin He:
On Floor-Plan of Plane Graphs.
SIAM J. Comput. 28(6): 2150-2167 (1999) |
| 44 | | Xin He,
Zhi-Zhong Chen:
An Algorithm for Shortest Paths in Bipartite Digraphs with Concave Weight Matrices and its Applications.
SIAM J. Comput. 29(1): 65-80 (1999) |
| 43 | EE | Xin He,
Ming-Yang Kao,
Hsueh-I Lu:
Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings.
SIAM J. Discrete Math. 12(3): 317-325 (1999) |
| 42 | EE | Ryuhei Uehara,
Zhi-Zhong Chen,
Xin He:
Fast RNC and NC Algorithms for Maximal Path Sets.
Theor. Comput. Sci. 215(1-2): 89-98 (1999) |
| 1998 |
|---|
| 41 | EE | Richie Chih-Nan Chuang,
Ashim Garg,
Xin He,
Ming-Yang Kao,
Hsueh-I Lu:
Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses.
ICALP 1998: 118-129 |
| 40 | | Sivaprakasam Sunder,
Xin He:
Scheduling Interval Ordered Tasks in Parallel.
J. Algorithms 26(1): 34-47 (1998) |
| 1997 |
|---|
| 39 | | Xin He,
Zhi-Zhong Chen:
Shortest Path in Complete Bipartite Digraph Problem and its Applications.
SODA 1997: 230-238 |
| 38 | | Bhaskar DasGupta,
Xin He,
Tao Jiang,
Ming Li,
John Tromp,
Louxin Zhang:
On Distances between Phylogenetic Trees (Extended Abstract).
SODA 1997: 427-436 |
| 37 | EE | Xin He:
On Floorplans of Planar Graphs.
STOC 1997: 426-435 |
| 36 | | Zhi-Zhong Chen,
Xin He:
Parallel Algorithms for Maximal Acyclic Sets.
Algorithmica 19(3): 354-368 (1997) |
| 35 | EE | Xin He:
Grid Embedding of 4-Connected Plane Graphs.
Discrete & Computational Geometry 17(3): 339-358 (1997) |
| 34 | | R. Sarnath,
Xin He:
On Parallel Selection and Searching in Partial Orders: Sorted Matrices.
J. Parallel Distrib. Comput. 40(2): 242-247 (1997) |
| 33 | EE | Goos Kant,
Xin He:
Regular Edge Labeling of 4-Connected Plane Graphs and Its Applications in Graph Drawing Problems.
Theor. Comput. Sci. 172(1-2): 175-193 (1997) |
| 1996 |
|---|
| 32 | | Ryuhei Uehara,
Zhi-Zhong Chen,
Xin He:
Fast RNC and NC Algorithms for Finding a Maximal Set of Paths with an Application.
COCOON 1996: 209-218 |
| 31 | | Sivaprakasam Sunder,
Xin He:
An NC Algorithm for Finding a Minimum Weighted Completion Time Schedule on Series Parallel Graphs.
Algorithmica 16(3): 243-262 (1996) |
| 30 | EE | Zhi-Zhong Chen,
Xin He:
Parallel Complexity of Partitioning a Planar Graph Into Vertex-induced Forests.
Discrete Applied Mathematics 69(1-2): 183-198 (1996) |
| 1995 |
|---|
| 29 | | Xin He:
Grid Embedding of 4-Connected Plane Graphs.
Graph Drawing 1995: 287-299 |
| 28 | | Zhi-Zhong Chen,
Xin He:
NC Algorithms for Partitioning Planar Graphs into Induced Forests and Approximating NP-Hard Problems.
WG 1995: 275-289 |
| 27 | | Xin He:
An Efficient Parallel Algorithm for Finding Rectangular Duals of Plane Triangular Graphs.
Algorithmica 13(6): 553-572 (1995) |
| 26 | EE | Xin He,
David B. Sher:
on Determining Non-isotopic Configurations of Points on a Circle.
Discrete Applied Mathematics 59(1): 33-50 (1995) |
| 1994 |
|---|
| 25 | | Xin He,
Ming-Yang Kao:
Regular Edge Labelings and Drawings of Planar Graphs.
Graph Drawing 1994: 96-103 |
| 24 | | Susanne E. Hambrusch,
Xin He,
Russ Miller:
Parallel Algorithms for Gray-Scale Digitized Picture Component Labeling on a Mesh-Connected Computer.
J. Parallel Distrib. Comput. 20(1): 56-68 (1994) |
| 23 | EE | Ming-Yang Kao,
Martin Fürer,
Xin He,
Balaji Raghavachari:
Optimal Parallel Algorithms forStraight-Line Grid Embeddings of Planar Graphs.
SIAM J. Discrete Math. 7(4): 632-646 (1994) |
| 1993 |
|---|
| 22 | | Xin He,
Ming-Yang Kao:
Parallel Construction of Canonical Ordering and Convex Drawing of Triconnected Planar Graphs.
ISAAC 1993: 303-312 |
| 21 | | Sivaprakasam Sunder,
Xin He:
Scheduling Interval Ordered Tasks in Parallel.
STACS 1993: 100-109 |
| 20 | | Goos Kant,
Xin He:
Two Algorithms for Finding Rectangular Duals of Planar Graphs.
WG 1993: 396-410 |
| 19 | | Xin He:
Parallel Algorithm for Cograph Recognition with Applications.
J. Algorithms 15(2): 284-313 (1993) |
| 18 | | Xin He:
On Finding the Rectangular Duals of Planar Triangular Graphs.
SIAM J. Comput. 22(6): 1218-1226 (1993) |
| 1992 |
|---|
| 17 | | R. Sarnath,
Xin He:
Efficient Parallel Algorithms for Selection and Searching on Sorted Matrices.
IPPS 1992: 108-111 |
| 16 | EE | Susanne E. Hambrusch,
Xin He,
Russ Miller:
Parallel Algorithms for Gray-Scale Image Component Labeling on a Mesh-Connected Computer.
SPAA 1992: 100-108 |
| 15 | EE | Martin Fürer,
Xin He,
Ming-Yang Kao,
Balaji Raghavachari:
O(n log log n)-Work Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs.
SPAA 1992: 410-419 |
| 14 | | Sivaprakasam Sunder,
Xin He:
An NC Algorithm for Finding Minimum Weighted Completion Time Schedule on Series Parallel Graphs.
SPDP 1992: 120-127 |
| 13 | | Xin He:
Parallel Algorithm for Cograph Recognition with Applications.
SWAT 1992: 94-105 |
| 1991 |
|---|
| 12 | EE | Sreejit Chakravarty,
Xin He,
S. S. Ravi:
Minimum area layout of series-parallel transistor networks is NP-hard.
IEEE Trans. on CAD of Integrated Circuits and Systems 10(7): 943-949 (1991) |
| 11 | | Xin He:
An Efficient Parallel Algorithm for Finding Minimum Weight Matching for Points on a Convex Polygon.
Inf. Process. Lett. 37(2): 111-116 (1991) |
| 10 | | Xin He:
An Improved Algorithm for the Planar 3-Cut Problem.
J. Algorithms 12(1): 23-37 (1991) |
| 9 | | Xin He:
Efficient Parallel Algorithms for Series Parallel Graphs.
J. Algorithms 12(3): 409-430 (1991) |
| 1990 |
|---|
| 8 | | Xin He,
Yaacov Yesha:
Efficient Parallel Algorithms for r-Dominating Set and p-Center Problems on Trees.
Algorithmica 5(1): 129-145 (1990) |
| 7 | | Xin He:
Efficient Parallel and Sequential Algorithms for 4-Coloring Perfect Planar Graphs.
Algorithmica 5(4): 545-559 (1990) |
| 6 | | Xin He:
An Efficient Algorithm for Edge Coloring Planar Graphs with Delta Colors.
Theor. Comput. Sci. 74(3): 299-312 (1990) |
| 5 | | R. Sarnath,
Xin He:
A P-Complete Graph Partition Problem.
Theor. Comput. Sci. 76(2-3): 343-351 (1990) |
| 1988 |
|---|
| 4 | | Xin He,
Yaacov Yesha:
Binary Tree Algebraic Computation and Parallel Algorithms for Simple Graphs.
J. Algorithms 9(1): 92-113 (1988) |
| 3 | | Xin He,
Yaacov Yesha:
A Nearly Optimal Parallel Algorithm for Constructing Depth First Spanning Trees in Planar Graphs.
SIAM J. Comput. 17(3): 486-491 (1988) |
| 2 | | Xin He:
A Nearly Optimal Parallel Algorithm for Constructing Maximal Independent Set in Planar Graphs.
Theor. Comput. Sci. 61: 33-47 (1988) |
| 1987 |
|---|
| 1 | | Xin He,
Yaacov Yesha:
Parallel Recognitions and Decomposition of Two Terminal Series Parallel Graphs
Inf. Comput. 75(1): 15-38 (1987) |
