A Faster Algorithm for Minimum-Cost Bipartite Perfect Matching in Planar Graphs.

Mudabir Kabir Asathulla, Sanjeev Khanna, Nathaniel Lahn, Sharath Raghvendra

Browse the full SODA paper archive.