b'@inproceedings{Bernstein_FOCS24,'b'\nTITLE = {Maximum Flow by Augmenting Paths in $n^{2+o(1)}$ Time},\nAUTHOR = {Bernstein, Aaron and Blikstad, Joakim and Saranurak, Thatchaphol and Tu, Ta-Wei},\nLANGUAGE = {eng},\nISBN = {979-8-3315-1674-1},\nDOI = {10.1109/FOCS61266.2024.00123},\nPUBLISHER = {IEEE},\nYEAR = {2024},\nMARGINALMARK = {$\\bullet$},\nDATE = {2024},\nBOOKTITLE = {IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS 2024)},\nPAGES = {2056--2077},\nADDRESS = {Chicago, IL, USA},\n}\n'