Marc Demange Tinaz Ekim Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs. 364-374 2008 TAMC http://dx.doi.org/10.1007/978-3-540-79228-4_32 conf/tamc/2008 db/conf/tamc/tamc2008.html#DemangeE08