default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHuaming Zhang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j28]Xin He
, Huaming Zhang, Yijie Han:
On Petrie cycle and Petrie tour partitions of 3- and 4-regular plane graphs. Math. Struct. Comput. Sci. 32(2): 240-256 (2022)- 2021
- [j27]Yuan Li, Frank Ingram, Huaming Zhang:
Certificate complexity and symmetry of nested canalizing functions. Discret. Math. Theor. Comput. Sci. 23(3) (2021) - [j26]Deepak Bhaskar Acharya, Huaming Zhang:
Data Points Clustering via Gumbel Softmax. SN Comput. Sci. 2(4): 311 (2021) - [c26]Huaming Zhang, Qiang Li, Yijin Zhang, Xun Li:
Game Theory Based Power Allocation Method for Inter-satellite Links in LEO/MEO Two-layered Satellite Networks. ICCC 2021: 398-403 - [i5]Deepak Bhaskar Acharya, Huaming Zhang:
Weighted Graph Nodes Clustering via Gumbel Softmax. CoRR abs/2102.10775 (2021) - 2020
- [j25]Deepak Bhaskar Acharya, Huaming Zhang:
Community Detection Clustering via Gumbel Softmax. SN Comput. Sci. 1(5): 262 (2020) - [c25]Deepak Bhaskar Acharya, Huaming Zhang:
Feature Selection and Extraction for Graph Neural Networks. ACM Southeast Regional Conference 2020: 252-255 - [c24]Xin He, Huaming Zhang:
On Characterization of Petrie Partitionable Plane Graphs. TAMC 2020: 313-326 - [i4]Yuan Li, Frank Ingram, Huaming Zhang:
Results of nested canalizing functions. CoRR abs/2001.09094 (2020) - [i3]Deepak Bhaskar Acharya, Huaming Zhang:
Community Detection Clustering via Gumbel Softmax. CoRR abs/2005.02372 (2020)
2010 – 2019
- 2019
- [i2]Deepak Bhaskar Acharya, Huaming Zhang:
Feature Selection and Extraction for Graph Neural Networks. CoRR abs/1910.10682 (2019) - 2018
- [j24]Youhuan Li, Lei Zou, Huaming Zhang, Dongyan Zhao:
Longest Increasing Subsequence Computation over Streaming Sequences. IEEE Trans. Knowl. Data Eng. 30(6): 1036-1049 (2018) - 2016
- [j23]Huaming Zhang, Xiang-Zhi Kong:
On k-greedy routing algorithms. Comput. Geom. 52: 9-17 (2016) - [j22]Youhuan Li, Lei Zou, Huaming Zhang, Dongyan Zhao:
Computing Longest Increasing Subsequences over Sequential Data Streams. Proc. VLDB Endow. 10(3): 181-192 (2016) - [i1]Youhuan Li, Lei Zou, Huaming Zhang, Dongyan Zhao:
Computing Longest Increasing Subsequence Over Sequential Data Streams. CoRR abs/1604.02552 (2016) - 2014
- [j21]Xin He, Huaming Zhang:
On Succinct Greedy Drawings of Plane Triangulations and 3-Connected Plane Graphs. Algorithmica 68(2): 531-544 (2014) - [j20]Xiong Wan, Peng Wang, Zhimin Zhang, Huaming Zhang:
Fused Entropy Algorithm in Optical Computed Tomography. Entropy 16(2): 943-952 (2014) - [j19]Weiguo Zheng, Lei Zou, Xiang Lian, Huaming Zhang, Wei Wang, Dongyan Zhao:
SQBC: An efficient subgraph matching method over large and dense graphs. Inf. Sci. 261: 116-131 (2014) - 2013
- [j18]Omkar Kulkarni, Huaming Zhang:
An optimal greedy routing algorithm for triangulated polygons. Comput. Geom. 46(6): 640-647 (2013) - [j17]Xin He, Huaming Zhang:
A simple routing algorithm based on Schnyder coordinates. Theor. Comput. Sci. 494: 112-121 (2013) - [j16]Huaming Zhang, Swetha Govindaiah:
Greedy routing via embedding graphs onto semi-metric spaces. Theor. Comput. Sci. 508: 26-34 (2013) - 2012
- [j15]Xin He, Jiun-Jie Wang, Huaming Zhang:
Compact visibility representation of 4-connected plane graphs. Theor. Comput. Sci. 447: 62-73 (2012) - 2011
- [j14]Sadish Sadasivam, Huaming Zhang:
Closed rectangle-of-influence drawings for irreducible triangulations. Comput. Geom. 44(1): 9-19 (2011) - [j13]Huaming Zhang, Sadish Sadasivam:
Improved floor-planning of graphs via adjacency-preserving transformations. J. Comb. Optim. 22(4): 726-746 (2011) - [c23]Huaming Zhang, Swetha Govindaiah:
Greedy Routing via Embedding Graphs onto Semi-metric Spaces. FAW-AAIM 2011: 58-69 - [c22]Xin He, Huaming Zhang:
On Succinct Convex Greedy Drawing of 3-Connected Plane Graphs. SODA 2011: 1477-1486 - 2010
- [j12]Huaming Zhang:
Planar Polyline Drawings via Graph Transformations. Algorithmica 57(2): 381-397 (2010) - [j11]Sadish Sadasivam, Huaming Zhang:
NP-Completeness of st-orientations for plane graphs. Theor. Comput. Sci. 411(7-9): 995-1003 (2010) - [j10]Huaming Zhang, Xin He:
A generalized greedy routing algorithm for 2-connected graphs. Theor. Comput. Sci. 411(49): 4242-4252 (2010) - [c21]Xin He, Jiun-Jie Wang, Huaming Zhang:
Compact Visibility Representation of 4-Connected Plane Graphs. COCOA (1) 2010: 339-353 - [c20]Xin He, Huaming Zhang:
Schnyder Greedy Routing Algorithm. TAMC 2010: 271-283 - [c19]Sadish Sadasivam, Huaming Zhang:
Closed Rectangle-of-Influence Drawings for Irreducible Triangulations. TAMC 2010: 409-418
2000 – 2009
- 2009
- [j9]Huaming Zhang, Milind Vaidya:
On Open Rectangle-of-Influence and Rectangular Dual Drawings of Plane Graphs. Discret. Math. Algorithms Appl. 1(3): 319-334 (2009) - [j8]Huaming Zhang, Xin He:
Optimal st -orientations for plane triangulations. J. Comb. Optim. 17(4): 367-377 (2009) - [c18]Huaming Zhang, Milind Vaidya:
On Open Rectangle-of-Influence Drawings of Planar Graphs. COCOA 2009: 123-134 - [c17]Huaming Zhang:
On Minimizing One Dimension of Some Two-Dimensional Geometric Representations of Plane Graphs. FAW 2009: 163-172 - [c16]Sadish Sadasivam, Huaming Zhang:
NP-Completeness of st-Orientations for Plane Graphs. FCT 2009: 298-309 - 2008
- [j7]Xin He, Huaming Zhang:
Nearly Optimal Visibility Representations of Plane Graphs. SIAM J. Discret. Math. 22(4): 1364-1380 (2008) - [c15]Sadish Sadasivam, Huaming Zhang:
On Representation of Planar Graphs by Segments. AAIM 2008: 304-315 - [c14]Lei Zou, Lei Chen, Huaming Zhang, Yansheng Lu, Qiang Lou:
Summarization Graph Indexing: Beyond Frequent Structure-Based Approach. DASFAA 2008: 141-155 - 2007
- [c13]Huaming Zhang, Xin He:
Optimal st -Orientations for Plane Triangulations. AAIM 2007: 296-305 - [c12]Huaming Zhang, Sadish Sadasivam:
On Planar Polyline Drawings. GD 2007: 213-218 - 2006
- [j6]Huaming Zhang, Xin He:
An Application of Well-orderly Trees in Graph Drawing. Int. J. Found. Comput. Sci. 17(5): 1129-1142 (2006) - [j5]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) - [c11]Xin He, Huaming Zhang:
Nearly Optimal Visibility Representations of Plane Graphs. ICALP (1) 2006: 407-418 - [c10]Lei Zou, Yansheng Lu, Huaming Zhang, Rong Hu:
Mining Frequent Induced Subtree Patterns with Subtree-Constraint. ICDM Workshops 2006: 3-7 - [c9]Wei Li, Huaming Zhang, Raed Shatnawi:
A Graph-Based Representation of Object-Oriented Designs. Software Engineering Research and Practice 2006: 198-204 - [c8]Raed Shatnawi, Wei Li, Huaming Zhang:
Predicting Error Probability in the Eclipse Project. Software Engineering Research and Practice 2006: 422-428 - [c7]Lei Zou, Yansheng Lu, Huaming Zhang, Rong Hu:
PrefixTreeESpan: A Pattern Growth Algorithm for Mining Embedded Subtrees. WISE 2006: 499-505 - 2005
- [j4]Huaming Zhang, Xin He:
Improved visibility representation of plane graphs. Comput. Geom. 30(1): 29-39 (2005) - [j3]Huaming Zhang, Xin He:
Canonical Ordering Trees and Their Applications in Graph Drawing. Discret. Comput. Geom. 33(2): 321-344 (2005) - [j2]Huaming Zhang, Xin He:
Visibility representation of plane graphs via canonical ordering tree, . Inf. Process. Lett. 96(2): 41-48 (2005) - [j1]Huaming Zhang, Xin He:
On Even Triangulations of 2-Connected Embedded Graphs. SIAM J. Comput. 34(3): 683-696 (2005) - [c6]Huaming Zhang, Xin He:
An Application of Well-Orderly Trees in Graph Drawing. GD 2005: 458-467 - 2004
- [c5]Huaming Zhang, Xin He:
New Theoretical Bounds of Visibility Representation of Plane Graphs. GD 2004: 425-430 - [c4]Huaming Zhang, Xin He:
On Visibility Representation of Plane Graphs. STACS 2004: 477-488 - 2003
- [c3]Huaming Zhang, Xin He:
On Even Triangulations of 2-Connected Embedded Graphs. COCOON 2003: 139-148 - [c2]Huaming Zhang, Xin He:
Compact Visibility Representation and Straight-Line Grid Embedding of Plane Graphs. WADS 2003: 493-504 - 2002
- [c1]Huaming Zhang, Xin He:
A Simple Linear Time Algorithm for Finding Even Triangulations of 2-Connected Bipartite Plane Graphs. ESA 2002: 902-914
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
