Author:
Ashok Pradeesha,Kolay Sudeshna,Saurabh Saket
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. J. Comput. Syst. Sci. 75(8), 423–434 (2009)
2. Carr, R.D., Doddi, S., Konjevod, G., Marathe, M.V.: On the red-blue set cover problem. In: SODA, vol. 9, pp. 345–353 (2000)
3. Chan, T.M., Hu, N.: Geometric red-blue set cover for unit squares and related problems. In: CCCG (2013)
4. Ying Cheng, S., Iyengar, S., Kashyap, R.L.: A new method of image compression using irreducible covers of maximal rectangles. IEEE Trans. Software Eng. 14(5), 651–658 (1988)
5. Dom, M., Guo, J., Niedermeier, R., Wernicke, S.: Red-blue covering problems and the consecutive ones property. J. Discrete Algorithms 6(3), 393–407 (2008)