Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    Optimal algorithms for circle partitioning

    Given a set of n points F on a circle and an integer k, we would like to find a size k subset of F such that these points are “evenly distributed” on the circle. We define two different criteria to capture the in...

    Kuo-Hui Tsai, Da-Wei Wang in Computing and Combinatorics (1997)

  2. No Access

    Chapter and Conference Paper

    Fast algorithms for the dominating set problem on permutation graphs

    Kuo-Hui Tsai, Wen-Lian Hsu in Algorithms (1990)