Before revision:  We study the maximal independent set (MIS) and maximum independent set ( MAX-IS ) problems on dynamic sets of O(n) axis-parallel rectangles, which can be modeled as dynamic rectangle intersection graphs. We consider the fully dynamic vertex update (insertion/deletion ) modelfor two types of rectangles: (i) uniform height and width and (ii) uniform height and arbitrary width .
After revision:  We study the maximal independent set (MIS) and maximum independent set ( MAX-IS ) problems on fully dynamic (insertion/deletion ) modelfor two types of rectangles: (i) uniform height and width and (ii) uniform height and arbitrary width .