Sheung-Hung Poon

According to our database1, Sheung-Hung Poon authored at least 78 papers between 2000 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Special Issue on Selected Papers from the 11th International Conference and Workshops on Algorithms and Computation (WALCOM 2017).
Theor. Comput. Sci., 2019

Guest Editors' Foreword.
J. Graph Algorithms Appl., 2019

2018
Line segment covering of cells in arrangements.
Inf. Process. Lett., 2018

Online Uniformly Inserting Points on the Sphere.
Algorithms, 2018

Approximation and Competitive Algorithms for Single-Minded Selling Problem.
Proceedings of the Algorithmic Aspects in Information and Management, 2018

2017
Line Segment Covering of Cells in Arrangements.
CoRR, 2017

Online Inserting Points Uniformly on the Sphere.
Proceedings of the WALCOM: Algorithms and Computation, 2017

Scale-Adaptive Placement of Hierarchical Map Labels.
Proceedings of the Eurographics Conference on Visualization, 2017

On Complexity of Total Vertex Cover on Subcubic Graphs.
Proceedings of the Theory and Applications of Models of Computation, 2017

Scheduling Tasks to Minimize Active Time on a Processor with Unlimited Capacity.
Proceedings of the Theory and Applications of Models of Computation, 2017

2016
Approximation algorithms on consistent dynamic map labeling.
Theor. Comput. Sci., 2016

On the edge crossing properties of Euclidean minimum weight Laman graphs.
Comput. Geom., 2016

2015
Independent dominating set problem revisited.
Theor. Comput. Sci., 2015

Optimally bracing grid frameworks with holes.
Theor. Comput. Sci., 2015

On maximum independent set of categorical product and ultimate categorical ratios of graphs.
Theor. Comput. Sci., 2015

On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs.
J. Discrete Algorithms, 2015

Straight-line Drawability of a Planar Graph Plus an Edge.
CoRR, 2015

Straight-Line Drawability of a Planar Graph Plus an Edge.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Algorithms and Hardness for Signed Domination.
Proceedings of the Theory and Applications of Models of Computation, 2015

Designing and Annotating Metro Maps with Loop Lines.
Proceedings of the 19th International Conference on Information Visualisation, 2015

Algorithmic Aspect of Minus Domination on Small-Degree Graphs.
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

Line Segment Covering of Cells in Arrangements.
Proceedings of the Combinatorial Optimization and Applications, 2015

2014
Non-planar square-orthogonal drawing with few-bend edges.
Theor. Comput. Sci., 2014

On the complexity of the black-and-white coloring problem on some classes of perfect graphs.
Theor. Comput. Sci., 2014

Boundary Labeling with Flexible Label Positions.
Proceedings of the Algorithms and Computation - 8th International Workshop, 2014

Results on Independent Sets in Categorical Products of Graphs, the Ultimate Categorical Independence Ratio and the Ultimate Categorical Independent Domination Ratio.
Proceedings of the Algorithms and Computation - 8th International Workshop, 2014

Approximation Algorithms on Consistent Dynamic Map Labeling.
Proceedings of the Frontiers in Algorithmics - 8th International Workshop, 2014

On Edge-Unfolding One-Layer Lattice Polyhedra with Cubic Holes.
Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

Optimally Bracing Grid Frameworks with Holes.
Proceedings of the Combinatorial Optimization and Applications, 2014

2013
New parameterized algorithms for the edge dominating set problem.
Theor. Comput. Sci., 2013

Algorithmic aspect of stratified domination in graphs.
Inf. Process. Lett., 2013

Independent set in categorical products of cographs and splitgraphs
CoRR, 2013

On independence domination
CoRR, 2013

Results on independent sets in categorical products of graphs, the ultimate categorical independence ratio and the ultimate categorical independent domination ratio.
CoRR, 2013

Triangle-Partitioning Edges of Planar Graphs, Toroidal Graphs and k-Planar Graphs.
Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

On the Edge Crossing Properties of Euclidean Minimum Weight Laman Graphs.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

On Independence Domination.
Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013

Square-Orthogonal Drawing with Few Bends per Edge.
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

On Edge-Independent Sets.
Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013

2012
Computing the Stretch factor and Maximum Detour of Paths, Trees, and cycles in the normed Space.
Int. J. Comput. Geometry Appl., 2012

Independent sets in edge-clique graphs II
CoRR, 2012

Algorithms for the Strong Chromatic Index of Halin Graphs, Distance-Hereditary Graphs and Maximal Outerplanar Graphs.
Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

Fáry's Theorem for 1-Planar Graphs.
Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

Domatic Partition on Several Classes of Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2012

Towards a hybrid approach to SoC estimation for a smart Battery Management System (BMS) and battery supported Cyber-Physical Systems (CPS).
Proceedings of the 2nd Baltic Congress on Future Internet Communications, 2012

The Black-and-White Coloring Problem on Distance-Hereditary Graphs and Strongly Chordal Graphs.
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012

2011
Complexity analysis of balloon drawing for rooted trees.
Theor. Comput. Sci., 2011

The black-and-white coloring problem on distance hereditary graphs and strongly chordal graphs
CoRR, 2011

Algorithms for the strong chromatic index of Halin graphs, distance-hereditary graphs and maximal outerplanar graphs
CoRR, 2011

New parameterized algorithms for edge dominating set
CoRR, 2011

New Parameterized Algorithms for the Edge Dominating Set Problem.
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

One-and-a-Half-Side Boundary Labeling.
Proceedings of the Combinatorial Optimization and Applications, 2011

2010
Complexity Analysis of Balloon Drawing for Rooted Trees
CoRR, 2010

Optimizing active ranges for consistent dynamic map labeling.
Comput. Geom., 2010

Spanning Ratio and Maximum Detour of Rectilinear Paths in the L1 Plane.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Complexity of Finding Non-Planar Rectilinear Drawings of Graphs.
Proceedings of the Graph Drawing - 18th International Symposium, GD 2010, Konstanz, 2010

2009
On Unfolding Lattice Polygons/Trees and Diameter-4 Trees.
Int. J. Comput. Geometry Appl., 2009

Kinetic Collision Detection for Convex Fat Objects.
Algorithmica, 2009

Minimal Locked Trees.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

On Rectilinear Drawing of Graphs.
Proceedings of the Graph Drawing, 17th International Symposium, 2009

2008
Optimizing active ranges for consistent dynamic map labeling.
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

On Unfolding 3D Lattice Polygons and 2D Orthogonal Trees.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

Fault-Tolerant Conflict-Free Coloring.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

2007
On Unfolding Trees and Polygons on Various Lattices.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006
Three-Dimensional Delaunay Mesh Generation.
Discrete & Computational Geometry, 2006

Pants Decomposition of the Punctured Plane
CoRR, 2006

Kinetic Collision Detection for Convex Fat Objects.
Proceedings of the Algorithms, 2006

On Unfolding Lattice Polygons/Trees and Diameter-4 Trees.
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

2005
Curve reconstruction from noisy samples.
Comput. Geom., 2005

On Straightening Low-Diameter Unit Trees.
Proceedings of the Graph Drawing, 13th International Symposium, 2005

Adaptive Zooming in Point Set Labeling.
Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

2004
Hierarchy of surface models and irreducible triangulations.
Comput. Geom., 2004

Labeling Points with Weights.
Algorithmica, 2004

2003
Graded conforming Delaunay tetrahedralization with bounded radius-edge ratio.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Curve reconstruction from noisy samples.
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

2002
Hierarchy of Surface Models and Irreducible Triangulation.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

2001
Labeling Points with Weights.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

2000
Selecting Independent Chains on a Triangulated 2-Manifold.
Proceedings of the 12th Canadian Conference on Computational Geometry, 2000


  Loading...