The following pages link to Sheung-Hung Poon (Q392034):
Displaying 50 items.
- New parameterized algorithms for the edge dominating set problem (Q392035) (← links)
- Independent dominating set problem revisited (Q476836) (← links)
- Complexity analysis of balloon drawing for rooted trees (Q620957) (← links)
- Non-planar square-orthogonal drawing with few-bend edges (Q744098) (← links)
- Optimally bracing grid frameworks with holes (Q896115) (← links)
- On the edge crossing properties of Euclidean minimum weight Laman graphs (Q902420) (← links)
- Kinetic collision detection for convex fat objects (Q1016518) (← links)
- Hierarchy of surface models and irreducible triangulations. (Q1428114) (← links)
- Curve reconstruction from noisy samples (Q1775779) (← links)
- Labeling points with weights (Q1889601) (← links)
- Offline and online algorithms for single-minded selling problem (Q2173298) (← links)
- Consistent dynamic map labeling with fairness and importance (Q2197926) (← links)
- On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs (Q2253902) (← links)
- Online uniformly inserting points on the sphere (Q2283824) (← links)
- On maximum independent set of categorical product and ultimate categorical ratios of graphs (Q2348262) (← links)
- Line segment covering of cells in arrangements (Q2410576) (← links)
- On the complexity of the black-and-white coloring problem on some classes of perfect graphs (Q2445872) (← links)
- Three-dimensional Delaunay mesh generation (Q2509091) (← links)
- Approximation algorithms on consistent dynamic map labeling (Q2629235) (← links)
- On Independence Domination (Q2842784) (← links)
- On the Edge Crossing Properties of Euclidean Minimum Weight Laman Graphs (Q2872069) (← links)
- The Black-and-White Coloring Problem on Distance-Hereditary Graphs and Strongly Chordal Graphs (Q2898008) (← links)
- Algorithms for the Strong Chromatic Index of Halin Graphs, Distance-Hereditary Graphs and Maximal Outerplanar Graphs (Q2914320) (← links)
- Fáry’s Theorem for 1-Planar Graphs (Q2914338) (← links)
- On Edge-Unfolding One-Layer Lattice Polyhedra with Cubic Holes (Q2920464) (← links)
- Optimally Bracing Grid Frameworks with Holes (Q2942420) (← links)
- Algorithms and Hardness for Signed Domination (Q2948490) (← links)
- Online Inserting Points Uniformly on the Sphere (Q2980913) (← links)
- Scheduling Tasks to Minimize Active Time on a Processor with Unlimited Capacity (Q2988826) (← links)
- On Complexity of Total Vertex Cover on Subcubic Graphs (Q2988847) (← links)
- Spanning Ratio and Maximum Detour of Rectilinear Paths in the L 1 Plane (Q3060767) (← links)
- Complexity of Finding Non-Planar Rectilinear Drawings of Graphs (Q3073681) (← links)
- New Parameterized Algorithms for the Edge Dominating Set Problem (Q3088075) (← links)
- Domatic Partition on Several Classes of Graphs (Q3167366) (← links)
- Minimal Locked Trees (Q3183441) (← links)
- Approximation Algorithms on Consistent Dynamic Map Labeling (Q3188846) (← links)
- Algorithmic Aspect of Minus Domination on Small-Degree Graphs (Q3196397) (← links)
- Straight-Line Drawability of a Planar Graph Plus an Edge (Q3449828) (← links)
- On Unfolding 3D Lattice Polygons and 2D Orthogonal Trees (Q3511349) (← links)
- On Rectilinear Drawing of Graphs (Q3557881) (← links)
- On Unfolding Lattice Polygons/Trees and Diameter-4 Trees (Q3591320) (← links)
- (Q4425963) (← links)
- (Q4471311) (← links)
- (Q4474126) (← links)
- COMPUTING THE STRETCH FACTOR AND MAXIMUM DETOUR OF PATHS, TREES, AND CYCLES IN THE NORMED SPACE (Q4650090) (← links)
- Triangle-Partitioning Edges of Planar Graphs, Toroidal Graphs and k-Planar Graphs (Q4914448) (← links)
- Square-Orthogonal Drawing with Few Bends per Edge (Q4925252) (← links)
- One-and-a-Half-Side Boundary Labeling (Q5199164) (← links)
- ON UNFOLDING LATTICE POLYGONS/TREES AND DIAMETER-4 TREES (Q5322317) (← links)
- Curve reconstruction from noisy samples (Q5361636) (← links)
