Daniel Delling, Renato Fonseca F. Werneck. Better Bounds for Graph Bisection. In Leah Epstein, Paolo Ferragina, editors, Algorithms - ESA 2012 - 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings. Volume 7501 of Lecture Notes in Computer Science, pages 407-418, Springer, 2012. [doi]
@inproceedings{DellingW12,
title = {Better Bounds for Graph Bisection},
author = {Daniel Delling and Renato Fonseca F. Werneck},
year = {2012},
doi = {10.1007/978-3-642-33090-2_36},
url = {http://dx.doi.org/10.1007/978-3-642-33090-2_36},
researchr = {https://researchr.org/publication/DellingW12},
cites = {0},
citedby = {0},
pages = {407-418},
booktitle = {Algorithms - ESA 2012 - 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings},
editor = {Leah Epstein and Paolo Ferragina},
volume = {7501},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-33089-6},
}