Hannes Moser, Somnath Sikdar. The Parameterized Complexity of the Induced Matching Problem in Planar Graphs. In Franco P. Preparata, Qizhi Fang, editors, Frontiers in Algorithmics, First Annual International Workshop, FAW 2007, Lanzhou, China, August 1-3, 2007, Proceedings. Volume 4613 of Lecture Notes in Computer Science, pages 325-336, Springer, 2007. [doi]
Abstract is missing.