Kang, Ross J.Ross J.KangMnich, MatthiasMatthiasMnichMüller, TobiasTobiasMüller2020-10-212020-10-212010-11-2218th Annual European Symposium on Algorithms (ESA 2010)http://hdl.handle.net/11420/7626We present a linear-time algorithm that, given a planar graph with m edges and maximum degree 3, finds an induced matching of size at least m/9. This is best possible.enInformatikConference Paper10.1007/978-3-642-15781-3_10Other