Xin He - RankMe

94 papers A* 7A 9B 7C 5Misc 5Journal 53Unranked 6

Year	Rank	Type	Title / Venue / Authors
2022	J	`jnl`	More Efficient Parallel Integer Sorting. Int. J. Found. Comput. Sci. Yijie Han, Xin He
2022	J	`jnl`	On Petrie cycle and Petrie tour partitions of 3- and 4-regular plane graphs. Math. Struct. Comput. Sci. Xin He, Huaming Zhang, Yijie Han
2020	C	`conf`	On Characterization of Petrie Partitionable Plane Graphs. TAMC Xin He, Huaming Zhang
2016	—	`ch.`	Nearest Neighbor Interchange and Related Distances. Encyclopedia of Algorithms Bhaskar DasGupta, Xin He, Ming Li, John Tromp, Louxin Zhang
2016	J	`jnl`	Nearly optimal monotone drawing of trees. Theor. Comput. Sci. Dayu He, Xin He
2015	C	`conf`	A Linear Time Algorithm for Determining Almost Bipartite Graphs. TAMC Dayu He, Xin He
2015	Misc	`conf`	Compact Monotone Drawing of Trees. COCOON Xin He, Dayu He
2015	A	`conf`	Monotone Drawings of 3-Connected Plane Graphs. ESA Xin He, Dayu He
2015	C	`conf`	Star Shaped Orthogonal Drawing. TAMC Xin He, Dayu He
2014	J	`jnl`	On Succinct Greedy Drawings of Plane Triangulations and 3-Connected Plane Graphs. Algorithmica Xin He, Huaming Zhang
2014	J	`jnl`	Succinct strictly convex greedy drawing of 3-connected plane graphs. Theor. Comput. Sci. Jiun-Jie Wang, Xin He
2013	J	`jnl`	A simple routing algorithm based on Schnyder coordinates. Theor. Comput. Sci. Xin He, Huaming Zhang
2012	J	`jnl`	Compact visibility representation of 4-connected plane graphs. Theor. Comput. Sci. Xin He, Jiun-Jie Wang, Huaming Zhang
2012	—	`conf`	More Efficient Parallel Integer Sorting. FAW-AAIM Yijie Han, Xin He
2012	—	`conf`	Succinct Strictly Convex Greedy Drawing of 3-Connected Plane Graphs. FAW-AAIM Jiun-Jie Wang, Xin He
2012	J	`jnl`	Visibility Representation of Plane Graphs with Simultaneous Bound for Both Width and Height. J. Graph Algorithms Appl. Jiun-Jie Wang, Xin He
2011	A*	`conf`	On Succinct Convex Greedy Drawing of 3-Connected Plane Graphs. SODA Xin He, Huaming Zhang
2010	J	`jnl`	A generalized greedy routing algorithm for 2-connected graphs. Theor. Comput. Sci. Huaming Zhang, Xin He
2010	—	`conf`	Compact Visibility Representation of 4-Connected Plane Graphs. COCOA (1) Xin He, Jiun-Jie Wang, Huaming Zhang
2010	C	`conf`	Schnyder Greedy Routing Algorithm. TAMC Xin He, Huaming Zhang
2009	J	`jnl`	Optimal J. Comb. Optim. Huaming Zhang, Xin He
2008	—	`ch.`	Nearest Neighbor Interchange and Related Distances. Encyclopedia of Algorithms Bhaskar DasGupta, Xin He, Tao Jiang, Ming Li, John Tromp, Louxin Zhang
2008	J	`jnl`	Nearly Optimal Visibility Representations of Plane Graphs. SIAM J. Discret. Math. Xin He, Huaming Zhang
2007	C	`conf`	Optimal AAIM Huaming Zhang, Xin He
2006	J	`jnl`	An Application of Well-orderly Trees in Graph Drawing. Int. J. Found. Comput. Sci. Huaming Zhang, Xin He
2006	J	`jnl`	Communication-optimal parallel parenthesis matching. Parallel Comput. Chun-Hsi Huang, Xin He, Min Qian
2006	J	`jnl`	Finding Hamiltonian paths in tournaments on clusters. Clust. Comput. Chun-Hsi Huang, Sanguthevar Rajasekaran, Laurence Tianruo Yang, Xin He
2006	—	`conf`	Nearly Optimal Visibility Representations of Plane Graphs. ICALP (1) Xin He, Huaming Zhang
2006	J	`jnl`	On simultaneous straight-line grid embedding of a planar graph and its dual. Inf. Process. Lett. Huaming Zhang, Xin He
2005	A	`conf`	An Application of Well-Orderly Trees in Graph Drawing. GD Huaming Zhang, Xin He
2005	J	`jnl`	Canonical Ordering Trees and Their Applications in Graph Drawing. Discret. Comput. Geom. Huaming Zhang, Xin He
2005	J	`jnl`	Improved visibility representation of plane graphs. Comput. Geom. Huaming Zhang, Xin He
2005	J	`jnl`	On Even Triangulations of 2-Connected Embedded Graphs. SIAM J. Comput. Huaming Zhang, Xin He
2005	J	`jnl`	Visibility representation of plane graphs via canonical ordering tree Inf. Process. Lett. Huaming Zhang, Xin He
2004	J	`jnl`	Disk Embeddings of Planar Graphs. Algorithmica Zhi-Zhong Chen, Xin He
2004	A	`conf`	New Theoretical Bounds of Visibility Representation of Plane Graphs. GD Huaming Zhang, Xin He
2004	A	`conf`	On Visibility Representation of Plane Graphs. STACS Huaming Zhang, Xin He
2003	J	`jnl`	Common-Face Embeddings of Planar Graphs. SIAM J. Comput. Zhi-Zhong Chen, Xin He, Ming-Yang Kao
2003	B	`conf`	Compact Visibility Representation and Straight-Line Grid Embedding of Plane Graphs. WADS Huaming Zhang, Xin He
2003	Misc	`conf`	On Even Triangulations of 2-Connected Embedded Graphs. COCOON Huaming Zhang, Xin He
2002	A	`conf`	A Simple Linear Time Algorithm for Finding Even Triangulations of 2-Connected Bipartite Plane Graphs. ESA Huaming Zhang, Xin He
2002	B	`conf`	Average-Case Communication-Optimal Parallel Parenthesis Matching. ISAAC Chun-Hsi Huang, Xin He
2002	J	`jnl`	Finding Double Euler Trails of Planar Graphs in Linear Time. SIAM J. Comput. Zhi-Zhong Chen, Xin He, Chun-Hsi Huang
2001	J	`jnl`	A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs CoRR Xin He, Ming-Yang Kao, Hsueh-I Lu
2001	B	`conf`	A Simple Linear Time Algorithm for Proper Box Rectangular Drawings of Plane Graphs. WADS Xin He
2001	J	`jnl`	A Simple Linear Time Algorithm for Proper Box Rectangular Drawings of Plane Graphs. J. Algorithms Xin He
2001	J	`jnl`	Common-Face Embeddings of Planar Graphs CoRR Zhi-Zhong Chen, Xin He, Ming-Yang Kao
2001	J	`jnl`	Communication Efficient BSP Algorithm for All Nearest Smaller Values Problem. J. Parallel Distributed Comput. Xin He, Chun-Hsi Huang
2001	J	`jnl`	Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses CoRR Richie Chih-Nan Chuang, Ashim Garg, Xin He, Ming-Yang Kao, Hsueh-I Lu
2001	Misc	`conf`	Finding a hamiltonian paths in tournaments on clusters - a provably communication-efficient approach. SAC Chun-Hsi Huang, Xin He
2001	J	`jnl`	Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings CoRR Xin He, Ming-Yang Kao, Hsueh-I Lu
2000	J	`jnl`	A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs. SIAM J. Comput. Xin He, Ming-Yang Kao, Hsueh-I Lu
2000	Misc	`conf`	Hierarchical Topological Inference on Planar Disc Maps. COCOON Zhi-Zhong Chen, Xin He
1999	A	`conf`	A Fast General Methodology for Information - Theoretically Optimal Encodings of Graphs. ESA Xin He, Ming-Yang Kao, Hsueh-I Lu
1999	J	`jnl`	An Algorithm for Shortest Paths in Bipartite Digraphs with Concave Weight Matrices and its Applications. SIAM J. Comput. Xin He, Zhi-Zhong Chen
1999	J	`jnl`	Fast Theor. Comput. Sci. Ryuhei Uehara, Zhi-Zhong Chen, Xin He
1999	A*	`conf`	Finding Double Euler Trails of Planar Graphs in Linear Time. FOCS Zhi-Zhong Chen, Xin He, Chun-Hsi Huang
1999	J	`jnl`	Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings. SIAM J. Discret. Math. Xin He, Ming-Yang Kao, Hsueh-I Lu
1999	A*	`conf`	Nonplanar Topological Inference and Political-Map Graphs. SODA Zhi-Zhong Chen, Xin He, Ming-Yang Kao
1999	—	`conf`	On computing the nearest neighbor interchange distance. Discrete Mathematical Problems with Medical Applications Bhaskar DasGupta, Xin He, Tao Jiang, Ming Li, John Tromp, Louxin Zhang
1999	J	`jnl`	On the Linear-Cost Subtree-Transfer Distance between Phylogenetic Trees. Algorithmica Bhaskar DasGupta, Xin He, Tao Jiang, Ming Li, John Tromp
1998	A*	`conf`	Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses. ICALP Richie Chih-Nan Chuang, Ashim Garg, Xin He, Ming-Yang Kao, Hsueh-I Lu
1998	J	`jnl`	Scheduling Interval Ordered Tasks in Parallel. J. Algorithms Sivaprakasam Sunder, Xin He
1997	J	`jnl`	Grid Embedding of 4-Connected Plane Graphs. Discret. Comput. Geom. Xin He
1997	A*	`conf`	On Distances between Phylogenetic Trees (Extended Abstract). SODA Bhaskar DasGupta, Xin He, Tao Jiang, Ming Li, John Tromp, Louxin Zhang
1997	A*	`conf`	On Floorplans of Planar Graphs. STOC Xin He
1997	J	`jnl`	On Parallel Selection and Searching in Partial Orders: Sorted Matrices. J. Parallel Distributed Comput. R. Sarnath, Xin He
1997	J	`jnl`	Parallel Algorithms for Maximal Acyclic Sets. Algorithmica Zhi-Zhong Chen, Xin He
1997	J	`jnl`	Regular Edge Labeling of 4-Connected Plane Graphs and Its Applications in Graph Drawing Problems. Theor. Comput. Sci. Goos Kant, Xin He
1997	A*	`conf`	Shortest Path in Complete Bipartite Digraph Problem and its Applications. SODA Xin He, Zhi-Zhong Chen
1996	J	`jnl`	An NC Algorithm for Finding a Minimum Weighted Completion Time Schedule on Series Parallel Graphs. Algorithmica Sivaprakasam Sunder, Xin He
1996	Misc	`conf`	Fast RNC and NC Algorithms for Finding a Maximal Set of Paths with an Application. COCOON Ryuhei Uehara, Zhi-Zhong Chen, Xin He
1996	J	`jnl`	Parallel Complexity of Partitioning a Planar Graph Into Vertex-induced Forests. Discret. Appl. Math. Zhi-Zhong Chen, Xin He
1995	J	`jnl`	An Efficient Parallel Algorithm for Finding Rectangular Duals of Plane Triangular Graphs. Algorithmica Xin He
1995	A	`conf`	Grid Embedding of 4-Connected Plane Graphs. GD Xin He
1995	B	`conf`	NC Algorithms for Partitioning Planar Graphs into Induced Forests and Approximating NP-Hard Problems. WG Zhi-Zhong Chen, Xin He
1995	J	`jnl`	on Determining Non-isotopic Configurations of Points on a Circle. Discret. Appl. Math. Xin He, David B. Sher
1994	J	`jnl`	Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs. SIAM J. Discret. Math. Ming-Yang Kao, Martin Fürer, Xin He, Balaji Raghavachari
1994	A	`conf`	Regular Edge Labelings and Drawings of Planar Graphs. GD Xin He, Ming-Yang Kao
1993	B	`conf`	Parallel Construction of Canonical Ordering and Convex Drawing of Triconnected Planar Graphs. ISAAC Xin He, Ming-Yang Kao
1993	A	`conf`	Scheduling Interval Ordered Tasks in Parallel. STACS Sivaprakasam Sunder, Xin He
1993	B	`conf`	Two Algorithms for Finding Rectangular Duals of Planar Graphs. WG Goos Kant, Xin He
1992	B	`conf`	O(n log log n)-Work Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs. SPAA Martin Fürer, Xin He, Ming-Yang Kao, Balaji Raghavachari
1992	—	`conf`	Parallel Algorithm for Cograph Recognition with Applications. SWAT Xin He
1991	J	`jnl`	An Efficient Parallel Algorithm for Finding Minimum Weight Matching for Points on a Convex Polygon. Inf. Process. Lett. Xin He
1991	J	`jnl`	An Improved Algorithm for the Planar 3-Cut Problem. J. Algorithms Xin He
1991	J	`jnl`	Efficient Parallel Algorithms for Series Parallel Graphs. J. Algorithms Xin He
1990	J	`jnl`	A P-Complete Graph Partition Problem. Theor. Comput. Sci. R. Sarnath, Xin He
1990	J	`jnl`	An Efficient Algorithm for Edge Coloring Planar Graphs with Delta Colors. Theor. Comput. Sci. Xin He
1990	J	`jnl`	Efficient Parallel Algorithms for r-Dominating Set and p-Center Problems on Trees. Algorithmica Xin He, Yaacov Yesha
1990	J	`jnl`	Efficient Parallel and Sequential Algorithms for 4-Coloring Perfect Planar Graphs. Algorithmica Xin He
1988	J	`jnl`	A Nearly Optimal Parallel Algorithm for Constructing Depth First Spanning Trees in Planar Graphs. SIAM J. Comput. Xin He, Yaacov Yesha
1988	J	`jnl`	Binary Tree Algebraic Computation and Parallel Algorithms for Simple Graphs. J. Algorithms Xin He, Yaacov Yesha
1987	J	`jnl`	Parallel Recognitions and Decomposition of Two Terminal Series Parallel Graphs Inf. Comput. Xin He, Yaacov Yesha