Skip to main content

1 Result(s)

within Chapter Remove this filter Payam Khanteimouri Remove this filter Algorithm Analysis and Problem Complexity Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Computing the Smallest Color-Spanning Axis-Parallel Square

    For a given set of n colored points with k colors in the plane, we study the problem of computing the smallest color-spanning axis-parallel square. First, for a dynamic set of colored points on the real line, we ...

    Payam Khanteimouri, Ali Mohades, Mohammad Ali Abam… in Algorithms and Computation (2013)