Saleh Soltan, Mihalis Yannakakis, Gil Zussman. Doubly Balanced Connected Graph Partitioning. In Philip N. Klein, editor, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19. pages 1939-1950, SIAM, 2017. [doi]
@inproceedings{SoltanYZ17,
title = {Doubly Balanced Connected Graph Partitioning},
author = {Saleh Soltan and Mihalis Yannakakis and Gil Zussman},
year = {2017},
doi = {10.1137/1.9781611974782.126},
url = {http://dx.doi.org/10.1137/1.9781611974782.126},
researchr = {https://researchr.org/publication/SoltanYZ17},
cites = {0},
citedby = {0},
pages = {1939-1950},
booktitle = {Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19},
editor = {Philip N. Klein},
publisher = {SIAM},
isbn = {978-1-61197-478-2},
}