Mudabir Kabir Asathulla, Sanjeev Khanna, Nathaniel Lahn, Sharath Raghvendra. A Faster Algorithm for Minimum-Cost Bipartite Perfect Matching in Planar Graphs. In Artur Czumaj, editor, Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018. pages 457-476, SIAM, 2018. [doi]
@inproceedings{AsathullaKLR18,
title = {A Faster Algorithm for Minimum-Cost Bipartite Perfect Matching in Planar Graphs},
author = {Mudabir Kabir Asathulla and Sanjeev Khanna and Nathaniel Lahn and Sharath Raghvendra},
year = {2018},
doi = {10.1137/1.9781611975031.31},
url = {https://doi.org/10.1137/1.9781611975031.31},
researchr = {https://researchr.org/publication/AsathullaKLR18},
cites = {0},
citedby = {0},
pages = {457-476},
booktitle = {Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018},
editor = {Artur Czumaj},
publisher = {SIAM},
isbn = {978-1-61197-503-1},
}