Huaming Zhang

According to our database1, Huaming Zhang authored at least 50 papers between 2002 and 2022.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
On Petrie cycle and Petrie tour partitions of 3- and 4-regular plane graphs.
Math. Struct. Comput. Sci., 2022

2021
Data Points Clustering via Gumbel Softmax.
SN Comput. Sci., 2021

Certificate complexity and symmetry of nested canalizing functions.
Discret. Math. Theor. Comput. Sci., 2021

Weighted Graph Nodes Clustering via Gumbel Softmax.
CoRR, 2021

Game Theory Based Power Allocation Method for Inter-satellite Links in LEO/MEO Two-layered Satellite Networks.
Proceedings of the 10th IEEE/CIC International Conference on Communications in China, 2021

2020
Community Detection Clustering via Gumbel Softmax.
SN Comput. Sci., 2020

Results of nested canalizing functions.
CoRR, 2020

On Characterization of Petrie Partitionable Plane Graphs.
Proceedings of the Theory and Applications of Models of Computation, 2020

Feature Selection and Extraction for Graph Neural Networks.
Proceedings of the 2020 ACM Southeast Conference, 2020

2018
Longest Increasing Subsequence Computation over Streaming Sequences.
IEEE Trans. Knowl. Data Eng., 2018

2016
Computing Longest Increasing Subsequences over Sequential Data Streams.
Proc. VLDB Endow., 2016

Computing Longest Increasing Subsequence Over Sequential Data Streams.
CoRR, 2016

On k-greedy routing algorithms.
Comput. Geom., 2016

2014
SQBC: An efficient subgraph matching method over large and dense graphs.
Inf. Sci., 2014

Fused Entropy Algorithm in Optical Computed Tomography.
Entropy, 2014

On Succinct Greedy Drawings of Plane Triangulations and 3-Connected Plane Graphs.
Algorithmica, 2014

2013
Greedy routing via embedding graphs onto semi-metric spaces.
Theor. Comput. Sci., 2013

A simple routing algorithm based on Schnyder coordinates.
Theor. Comput. Sci., 2013

An optimal greedy routing algorithm for triangulated polygons.
Comput. Geom., 2013

2012
Compact visibility representation of 4-connected plane graphs.
Theor. Comput. Sci., 2012

2011
Improved floor-planning of graphs via adjacency-preserving transformations.
J. Comb. Optim., 2011

Closed rectangle-of-influence drawings for irreducible triangulations.
Comput. Geom., 2011

On Succinct Convex Greedy Drawing of 3-Connected Plane Graphs.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2010
A generalized greedy routing algorithm for 2-connected graphs.
Theor. Comput. Sci., 2010

NP-Completeness of st-orientations for plane graphs.
Theor. Comput. Sci., 2010

Planar Polyline Drawings via Graph Transformations.
Algorithmica, 2010

Schnyder Greedy Routing Algorithm.
Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

2009
Optimal <i>st</i> -orientations for plane triangulations.
J. Comb. Optim., 2009

On Open Rectangle-of-Influence and Rectangular Dual Drawings of Plane Graphs.
Discret. Math. Algorithms Appl., 2009

NP-Completeness of <i>st</i>-Orientations for Plane Graphs.
Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009

On Minimizing One Dimension of Some Two-Dimensional Geometric Representations of Plane Graphs.
Proceedings of the Frontiers in Algorithmics, Third International Workshop, 2009

On Open Rectangle-of-Influence Drawings of Planar Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2009

2008
Nearly Optimal Visibility Representations of Plane Graphs.
SIAM J. Discret. Math., 2008

Summarization Graph Indexing: Beyond Frequent Structure-Based Approach.
Proceedings of the Database Systems for Advanced Applications, 2008

On Representation of Planar Graphs by Segments.
Proceedings of the Algorithmic Aspects in Information and Management, 2008

2007
On Planar Polyline Drawings.
Proceedings of the Graph Drawing, 15th International Symposium, 2007

2006
On simultaneous straight-line grid embedding of a planar graph and its dual.
Inf. Process. Lett., 2006

An Application of Well-orderly Trees in Graph Drawing.
Int. J. Found. Comput. Sci., 2006

PrefixTreeESpan: A Pattern Growth Algorithm for Mining Embedded Subtrees.
Proceedings of the Web Information Systems, 2006

Predicting Error Probability in the Eclipse Project.
Proceedings of the International Conference on Software Engineering Research and Practice & Conference on Programming Languages and Compilers, 2006

A Graph-Based Representation of Object-Oriented Designs.
Proceedings of the International Conference on Software Engineering Research and Practice & Conference on Programming Languages and Compilers, 2006

Mining Frequent Induced Subtree Patterns with Subtree-Constraint.
Proceedings of the Workshops Proceedings of the 6th IEEE International Conference on Data Mining (ICDM 2006), 2006

2005
On Even Triangulations of 2-Connected Embedded Graphs.
SIAM J. Comput., 2005

Visibility representation of plane graphs via canonical ordering tree<sup>, </sup>.
Inf. Process. Lett., 2005

Canonical Ordering Trees and Their Applications in Graph Drawing.
Discret. Comput. Geom., 2005

Improved visibility representation of plane graphs.
Comput. Geom., 2005

2004
On Visibility Representation of Plane Graphs.
Proceedings of the STACS 2004, 2004

New Theoretical Bounds of Visibility Representation of Plane Graphs.
Proceedings of the Graph Drawing, 12th International Symposium, 2004

2003
Compact Visibility Representation and Straight-Line Grid Embedding of Plane Graphs.
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

2002
A Simple Linear Time Algorithm for Finding Even Triangulations of 2-Connected Bipartite Plane Graphs.
Proceedings of the Algorithms, 2002


  Loading...