Hannes Moser Somnath Sikdar The Parameterized Complexity of the Induced Matching Problem in Planar Graphs. 325-336 2007 conf/faw/2007 FAW http://dx.doi.org/10.1007/978-3-540-73814-5_32 db/conf/faw/faw2007.html#MoserS07