Will Perkins 0001, Yuzhou Wang. On the hardness of finding balanced independent sets in random bipartite graphs. In David P. Woodruff, editor, Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7-10, 2024. pages 2376-2397, SIAM, 2024. [doi]
@inproceedings{PerkinsW24,
title = {On the hardness of finding balanced independent sets in random bipartite graphs},
author = {Will Perkins 0001 and Yuzhou Wang},
year = {2024},
doi = {10.1137/1.9781611977912.85},
url = {https://doi.org/10.1137/1.9781611977912.85},
researchr = {https://researchr.org/publication/PerkinsW24},
cites = {0},
citedby = {0},
pages = {2376-2397},
booktitle = {Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7-10, 2024},
editor = {David P. Woodruff},
publisher = {SIAM},
isbn = {978-1-61197-791-2},
}