On the approximability of the maximum induced matching problem

Optimization, approximation, and complexity classes

Christos H. Papadimitriou, Mihalis Yannakakis · Journal of Computer and System Sciences · 1991 · 1.6K citations

Engineering, Complexity Classes, Analysis Of Algorithm +5

Approximation algorithms for NP-complete problems on planar graphs

Brenda S. Baker · Journal of the ACM · 1994 · 959 citations · Full text

Some APX-completeness results for cubic graphs

Paola Alimonti, Viggo Kann · Theoretical Computer Science · 2000 · 359 citations

Graph Theory, Algebraic Graph Theory, Topological Graph Theory +4

NP-completeness of some generalizations of the maximum matching problem

Larry J. Stockmeyer, Vijay V. Vazirani · Information Processing Letters · 1982 · 225 citations

Mathematical Programming, Engineering, Matching Technique +6

Induced matchings

Kathie Cameron · Discrete Applied Mathematics · 1989 · 217 citations