| Year |
Citation |
Score |
| 2018 |
Li Y, Zou L, Zhang H, Zhao D. Longest Increasing Subsequence Computation over Streaming Sequences Ieee Transactions On Knowledge and Data Engineering. 30: 1036-1049. DOI: 10.1109/Tkde.2017.2761345 |
0.312 |
|
| 2016 |
Zhang H, Kong XZ. On k-greedy routing algorithms Computational Geometry: Theory and Applications. 52: 9-17. DOI: 10.1016/J.Comgeo.2015.10.008 |
0.545 |
|
| 2014 |
Zheng W, Zou L, Lian X, Zhang H, Wang W, Zhao D. SQBC: An efficient subgraph matching method over large and dense graphs Information Sciences. 261: 116-131. DOI: 10.1016/J.Ins.2013.10.003 |
0.48 |
|
| 2013 |
He X, Zhang H. A simple routing algorithm based on Schnyder coordinates Theoretical Computer Science. 494: 112-121. DOI: 10.1016/J.Tcs.2013.01.017 |
0.503 |
|
| 2013 |
Zhang H, Govindaiah S. Greedy routing via embedding graphs onto semi-metric spaces Theoretical Computer Science. 508: 26-34. DOI: 10.1016/J.Tcs.2012.01.049 |
0.586 |
|
| 2013 |
Kulkarni O, Zhang H. An optimal greedy routing algorithm for triangulated polygons Computational Geometry: Theory and Applications. 46: 640-647. DOI: 10.1016/J.Comgeo.2013.02.002 |
0.647 |
|
| 2012 |
He X, Wang J, Zhang H. Compact visibility representation of 4-connected plane graphs Theoretical Computer Science. 447: 62-73. DOI: 10.1016/J.Tcs.2012.02.010 |
0.571 |
|
| 2011 |
Sadasivam S, Zhang H. Closed rectangle-of-influence drawings for irreducible triangulations Computational Geometry: Theory and Applications. 44: 9-19. DOI: 10.1016/J.Comgeo.2010.07.001 |
0.659 |
|
| 2011 |
Zhang H, Sadasivam S. Improved floor-planning of graphs via adjacency-preserving transformations Journal of Combinatorial Optimization. 22: 726-746. DOI: 10.1007/S10878-010-9324-8 |
0.671 |
|
| 2010 |
Zhang H, He X. A generalized greedy routing algorithm for 2-connected graphs Theoretical Computer Science. 411: 4242-4252. DOI: 10.1016/J.Tcs.2010.08.032 |
0.478 |
|
| 2010 |
Sadasivam S, Zhang H. NP-Completeness of s t-orientations for plane graphs Theoretical Computer Science. 411: 995-1003. DOI: 10.1016/J.Tcs.2009.11.006 |
0.627 |
|
| 2009 |
Zhang H, Vaidya M. On Open Rectangle-Of-Influence And Rectangular Dual Drawings Of Plane Graphs Discrete Mathematics, Algorithms and Applications. 1: 319-333. DOI: 10.1142/S1793830909000257 |
0.451 |
|
| 2009 |
Zhang H, He X. Optimal st-orientations for plane triangulations Journal of Combinatorial Optimization. 17: 367-377. DOI: 10.1007/S10878-007-9119-8 |
0.514 |
|
| 2008 |
He X, Zhang H. Nearly Optimal Visibility Representations of Plane Graphs Siam Journal On Discrete Mathematics. 22: 1364-1380. DOI: 10.1137/060651811 |
0.54 |
|
| 2006 |
Zhang H, He X. An Application Of Well-Orderly Trees In Graph Drawing International Journal of Foundations of Computer Science. 17: 1129-1141. DOI: 10.1142/S0129054106004303 |
0.526 |
|
| 2006 |
Zhang H, He X. On simultaneous straight-line grid embedding of a planar graph and its dual Information Processing Letters. 99: 1-6. DOI: 10.1016/J.Ipl.2006.02.010 |
0.544 |
|
| 2005 |
Zhang H, He X. On Even Triangulations of 2-Connected Embedded Graphs Siam Journal On Computing. 34: 683-696. DOI: 10.1137/S0097539702408247 |
0.594 |
|
| 2005 |
Zhang H, He X. Visibility representation of plane graphs via canonical ordering tree Information Processing Letters. 96: 41-48. DOI: 10.1016/J.Ipl.2005.05.024 |
0.576 |
|
| 2005 |
Zhang H, He X. Improved visibility representation of plane graphs Computational Geometry: Theory and Applications. 30: 29-39. DOI: 10.1016/J.Comgeo.2004.08.002 |
0.576 |
|
| 2005 |
Zhang H, He X. Canonical Ordering Trees and Their Applications in Graph Drawing Discrete and Computational Geometry. 33: 321-344. DOI: 10.1007/S00454-004-1154-Y |
0.544 |
|
| 1996 |
Zhang H. The connectivity of Z-transformation graphs of perfect matchings of polyominoes Discrete Mathematics. 158: 257-272. |
0.445 |
|
| 1990 |
Zhang H. Point-color-symmetric graphs with a prime number of vertices Graphs and Combinatorics. 6: 297-302. DOI: 10.1007/BF01787581 |
0.399 |
|
| Show low-probability matches. |