SDP Primal-Dual Approximation Algorithms for Directed Hypergraph Expansion and Sparsest Cut with Product Demands. - T.-H. Hubert Chan; Bintao Sun 001 (COCOON, 2018)

An SDP Primal-Dual Approximation Algorithm for Directed Hypergraph Expansion and Sparsest Cut with Product Demands. - T.-H. Hubert Chan; Bintao Sun 001 (CoRR, 2018)

Distributed Approximate k-Core Decomposition and Min-Max Edge Orientation: Breaking the Diameter Barrier. - T.-H. Hubert Chan; Mauro Sozio; Bintao Sun 001 (IPDPS, 2019)

KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs. - Bintao Sun 001; Maximilien Danisch; T.-H. Hubert Chan; Mauro Sozio (Proc. VLDB Endow., 2020)

Fully Dynamic Approximate k-Core Decomposition in Hypergraphs. - Bintao Sun 001; T.-H. Hubert Chan; Mauro Sozio (ACM Trans. Knowl. Discov. Data, 2020)