Dong, Sally, Gao, Yu, Goranci, Gramoz, Lee, Yin Tat, Peng, Richard, Sachdeva, Sushant, and Ye Guanghao. Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time. Retrieved from https://par.nsf.gov/biblio/10335266. Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) . Web. doi:10.1137/1.9781611977073.7.

Dong, Sally, Gao, Yu, Goranci, Gramoz, Lee, Yin Tat, Peng, Richard, Sachdeva, Sushant, & Ye Guanghao. Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time. Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), (). Retrieved from https://par.nsf.gov/biblio/10335266. https://doi.org/10.1137/1.9781611977073.7

Dong, Sally, Gao, Yu, Goranci, Gramoz, Lee, Yin Tat, Peng, Richard, Sachdeva, Sushant, and Ye Guanghao. "Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time". Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (). Country unknown/Code not available. https://doi.org/10.1137/1.9781611977073.7. https://par.nsf.gov/biblio/10335266.

@article{osti_10335266,
place = {Country unknown/Code not available}, title = {Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time}, url = {https://par.nsf.gov/biblio/10335266}, DOI = {10.1137/1.9781611977073.7}, abstractNote = {}, journal = {Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)}, author = {Dong, Sally and Gao, Yu and Goranci, Gramoz and Lee, Yin Tat and Peng, Richard and Sachdeva, Sushant and Ye Guanghao}, editor = {Joseph} }