J. Alber, H. Bodlaender, H. Fernau, and R. Niedermeier, Fixed parameter algorithms for planar dominating set and related problems, Proc. of the 7th Scandinavian Workshop on Algorithm Theory (SWAT), volume 1851 of LNCS, pp.97-110, 2000.

J. Alber, M. Fellows, and R. Niedermeier, Polynomial-time data reduction for dominating set, Journal of the ACM, vol.51, issue.3, pp.363-384, 2004.
DOI : 10.1145/990308.990309

F. V. Fomin, D. Lokshtanov, S. Saurabh, and D. M. Thilikos, Bidimensionality and Kernels, Proc. of the 21st ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.503-510, 2010.
DOI : 10.1137/1.9781611973075.43

V. Garnero and I. Sau, A linear kernel for planar total dominating set. Manuscript available at arxiv.org/abs, 1211.

Q. Gu and N. Imani, Connectivity Is Not a Limit for Kernelization: Planar Connected Dominating Set, Proc. of the 9th Latin American Symposium on Theoretical Informatics (LATIN), pp.26-37, 2010.
DOI : 10.1007/978-3-642-12200-2_4

J. Guo and R. Niedermeier, Linear Problem Kernels for NP-Hard Problems on Planar Graphs, Proc. of the 34th International Colloquium on Automata, Languages and Programming (ICALP), pp.375-386, 2007.
DOI : 10.1007/978-3-540-73420-8_34

E. J. Kim, A. Langer, C. Paul, F. Reidl, P. Rossmanith et al., Linear kernels and single-exponential algorithms via protrusion decompositions. Manuscript available at arxiv.org, Proc. of ICALP'13, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01383776

T. Kloks, C. Lee, and J. Liu, New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k-Disjoint Cycles on Plane and Planar Graphs, Proc. of 28th International Workshop on Graph- Theoretic Concepts in Computer Science (WG), volume 2573 of LNCS, pp.282-295, 2002.
DOI : 10.1007/3-540-36379-3_25

D. Lokshtanov, M. Mnich, and S. Saurabh, A linear kernel for planar connected dominating set, Theoretical Computer Science, vol.23, issue.412, pp.2536-2543, 2011.