A. Abboud and V. V. Williams, Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems, FOCS, pp.434-443, 2014.

A. Abboud, A. Backurs, K. Bringmann, and M. Künnemann, Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-and-Solve, FOCS, pp.192-203, 2017.

A. Abboud, A. Backurs, and V. Williams, If the Current Clique Algorithms are Optimal, So is Valiant's Parser, FOCS, pp.98-117, 2015.

A. Abboud, R. Krauthgamer, and O. Trabelsi, New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs, 2019.

A. Abboud, V. V. Williams, and H. Yu, Matching Triangles and Basing Hardness on an Extremely Popular Conjecture, SIAM J. Comput, vol.47, issue.3, pp.1098-1122, 2018.

S. Srinivasa-r-arikati, C. D. Chaudhuri, and . Zaroliagis, All-Pairs Min-Cut in Sparse Networks, Journal of Algorithms, vol.29, issue.1, pp.82-110, 1998.

A. Bernáth and G. Pap, Blocking unions of arborescences. CoRR, 2015.

, Faster Algorithms for All-Pairs Bounded Min-Cuts

A. Bhalgat, R. Hariharan, T. Kavitha, and D. Panigrahi, AnÕ(mn) Gomory-Hu Tree Construction Algorithm for Unweighted Graphs, STOC, pp.605-614, 2007.

K. Bringmann, A. Grønlund, and K. Larsen, A Dichotomy for Regular Expression Membership Testing, FOCS, pp.307-318, 2017.

K. Bringmann and P. Wellnitz, Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars, CPM, vol.12, pp.1-12, 2017.

T. M. Chan, All-Pairs Shortest Paths with Real Weights in O(n 3 / log n) Time. Algorithmica, vol.50, pp.236-243, 2008.

Y. Chang, Conditional Lower Bound for RNA Folding Problem, 2015.

. Ho-yee-cheung, C. Lap, K. M. Lau, and . Leung, Graph Connectivities, Network Coding, and Expander Graphs, SIAM Journal on Computing, vol.42, issue.3, pp.733-751, 2013.

D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, Journal of Symbolic Computation, vol.9, issue.3, pp.251-280, 1990.

F. Eisenbrand and F. Grandoni, On the complexity of fixed parameter clique and dominating set, Theor. Comput. Sci, vol.326, issue.1-3, pp.57-67, 2004.

M. J. Fischer and A. R. Meyer, Boolean matrix multiplication and transitive closure, SWAT, pp.129-131, 1971.

J. Lester-randolph-ford and D. Fulkerson, Flows in Networks, 1962.

L. Georgiadis, D. Graf, G. F. Italiano, N. Parotsidis, and P. Uzna?ski, All-Pairs 2-Reachability in O(n ? log n) Time, ICALP, vol.80, pp.1-74, 2017.

R. E. Gomory and T. C. Hu, Multi-Terminal Network Flows, Journal of the Society for Industrial and Applied Mathematics, vol.9, issue.4, pp.551-570, 1961.

R. Hariharan, T. Kavitha, and D. Panigrahi, Efficient Algorithms for Computing All Low s-t Edge Connectivities and Related Problems, SODA, pp.127-136, 2007.

R. Krauthgamer and O. Trabelsi, Conditional Lower Bounds for All-Pairs Max-Flow, ACM Trans. Algorithms, vol.14, issue.4, 2018.

J. ??cki, Y. Nussbaum, P. Sankowski, and C. Wulff-nilsen, Single Source -All Sinks Max Flows in Planar Digraphs, FOCS, pp.599-608, 2012.

F. and L. Gall, Powers of Tensors and Fast Matrix Multiplication, ISSAC, pp.296-303, 2014.

Y. T. Lee and A. Sidford, Path Finding Methods for Linear Programming: Solving Linear Programs in O( ? rank) Iterations and Faster Algorithms for Maximum Flow, FOCS, pp.424-433, 2014.

A. Lincoln, V. V. Williams, and R. Williams, Tight Hardness for Shortest Cycles and Paths in Sparse Graphs, SODA, pp.1236-1252, 2018.

A. M?dry, Computing Maximum Flow with Augmenting Electrical Flows, FOCS, pp.593-602, 2016.

D. Marx, Parameterized graph separation problems, Theoretical Computer Science, vol.351, issue.3, pp.394-406, 2006.

K. Menger, Zur allgemeinen Kurventheorie. Fundamenta Mathematicae, vol.10, issue.1, pp.96-115, 1927.

H. Nagamochi and Y. Kamidoi, Minimum cost subpartitions in graphs, Inf. Process. Lett, vol.102, issue.2-3, pp.79-84, 2007.

J. Ne?et?il and S. Poljak, On the complexity of the subgraph problem. Commentationes Mathematicae Universitatis Carolinae, vol.26, pp.415-419, 1985.

D. Panigrahi, Gomory-Hu trees, Encyclopedia of Algorithms, pp.858-861, 2016.

V. Vassilevska, Efficient algorithms for clique problems, Inf. Process. Lett, vol.109, issue.4, pp.254-257, 2009.

V. Williams, Multiplying Matrices Faster Than Coppersmith-Winograd, STOC, pp.887-898, 2012.

V. Vassilevska-williams and R. Williams, Subcubic Equivalences Between Path, Matrix, and Triangle Problems, J. ACM, vol.65, issue.5, 2018.

H. Yu, An improved combinatorial algorithm for Boolean matrix multiplication, Inf. Comput, vol.261, pp.240-247, 2018.