A Faster Algorithm for Minimum-Cost Bipartite Matching in Minor-Free Graphs.

Nathaniel Lahn, Sharath Raghvendra

Browse the full SODA paper archive.