The following pages link to Huaming Zhang (Q283867):
Displaying 45 items.
- On \(k\)-greedy routing algorithms (Q283869) (← links)
- Greedy routing via embedding graphs onto semi-metric spaces (Q388089) (← links)
- A simple routing algorithm based on Schnyder coordinates (Q391094) (← links)
- Improved floor-planning of graphs via adjacency-preserving transformations (Q411253) (← links)
- Compact visibility representation of 4-connected plane graphs (Q443715) (← links)
- On succinct greedy drawings of plane triangulations and 3-connected plane graphs (Q476437) (← links)
- A generalized greedy routing algorithm for 2-connected graphs (Q606989) (← links)
- Improved visibility representation of plane graphs (Q706721) (← links)
- Closed rectangle-of-influence drawings for irreducible triangulations (Q709065) (← links)
- On simultaneous straight-line grid embedding of a planar graph and its dual (Q845659) (← links)
- SQBC: an efficient subgraph matching method over large and dense graphs (Q903609) (← links)
- Optimal \(st\)-orientations for plane triangulations (Q1029266) (← links)
- Visibility representation of plane graphs via canonical ordering tree (Q1044700) (← links)
- Canonical ordering trees and their applications in graph drawing (Q1772134) (← links)
- An optimal greedy routing algorithm for triangulated polygons (Q1947976) (← links)
- On characterization of Petrie partitionable plane graphs (Q2110728) (← links)
- NP-completeness of st-orientations for plane graphs (Q2268858) (← links)
- Planar polyline drawings via graph transformations (Q2379928) (← links)
- Greedy Routing via Embedding Graphs onto Semi-metric Spaces (Q3004656) (← links)
- INVESTIGATIONS OF THE SPIN HAMILTONIAN PARAMETERS AND THE LOCAL STRUCTURE FOR THE RHOMBIC<font>Cu</font><sup>2+</sup>CENTER IN RUTILE (Q3062639) (← links)
- Compact Visibility Representation of 4-Connected Plane Graphs (Q3066169) (← links)
- On Even Triangulations of 2-Connected Embedded Graphs (Q3082921) (← links)
- NP-Completeness of st-Orientations for Plane Graphs (Q3183620) (← links)
- On Representation of Planar Graphs by Segments (Q3511438) (← links)
- Schnyder Greedy Routing Algorithm (Q3569082) (← links)
- Closed Rectangle-of-Influence Drawings for Irreducible Triangulations (Q3569094) (← links)
- On Open Rectangle-of-Influence Drawings of Planar Graphs (Q3637057) (← links)
- ON OPEN RECTANGLE-OF-INFLUENCE AND RECTANGULAR DUAL DRAWINGS OF PLANE GRAPHS (Q3646203) (← links)
- (Q4232856) (← links)
- (Q4347356) (← links)
- (Q4411421) (← links)
- Certificate complexity and symmetry of nested canalizing functions (Q5024675) (← links)
- On Petrie cycle and Petrie tour partitions of 3- and 4-regular plane graphs (Q5048013) (← links)
- STACS 2004 (Q5309724) (← links)
- On Even Triangulations of 2-Connected Embedded Graphs (Q5317169) (← links)
- On Minimizing One Dimension of Some Two-Dimensional Geometric Representations of Plane Graphs (Q5321707) (← links)
- (Q5365133) (← links)
- Optimal st-Orientations for Plane Triangulations (Q5434448) (← links)
- On Planar Polyline Drawings (Q5452225) (← links)
- AN APPLICATION OF WELL-ORDERLY TREES IN GRAPH DRAWING (Q5493898) (← links)
- Graph Drawing (Q5711632) (← links)
- Graph Drawing (Q5897653) (← links)
- Algorithms and Data Structures (Q5900779) (← links)
- Nearly Optimal Visibility Representations of Plane Graphs (Q5901485) (← links)
- Nearly Optimal Visibility Representations of Plane Graphs (Q5902291) (← links)
