The Parameterized Complexity of the Induced Matching Problem in Planar Graphs.

Hannes Moser, Somnath Sikdar

Browse the full FAW paper archive.