7 citations · 14 across the 12 of their papers we have counts for
13 papers
Line Segment Covering of Cells in Arrangements
Matias Korman, Sheung-Hung Poon, Marcel Roeloffzen
Given a collection of line segments, we consider its arrangement and study the problem of covering all cells with line segments of . That is, we want to find a minimum-size…
Straight-line Drawability of a Planar Graph Plus an Edge
Peter Eades, Seok-Hee Hong, Giuseppe Liotta +2
We investigate straight-line drawings of topological graphs that consist of a planar graph plus one edge, also called almost-planar graphs. We present a characterization of such gr…
Results on independent sets in categorical products of graphs, the ultimate categorical independence ratio and the ultimate categorical independent domination ratio
Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu +2
We show that there are polynomial-time algorithms to compute maximum independent sets in the categorical products of two cographs and two splitgraphs. The ultimate categorical inde…
Independent set in categorical products of cographs and splitgraphs
W. Hon, T. Kloks, S. Liu +2
We show that there are polynomial-time algorithms to compute maximum independent sets in the categorical products of two cographs and two splitgraphs. We show that the ultimate cat…
On independence domination
Wing-Kai Hon, Ton Kloks, Hsiang Hsuan Liu +2
Let G be a graph. The independence-domination number is the maximum over all independent sets I in G of the minimal number of vertices needed to dominate I. In this paper we invest…
The black-and-white coloring problem on circle graphs
Ton Kloks, Sheung-Hung Poon, Yue-Li Wang
Given a graph G and integers b and w. The black-and-white coloring problem asks if there exist disjoint sets of vertices B and W with |B|=b and |W|=w such that no two vertices x in…