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

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

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

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

Distributed approximate k-core decomposition and min-max edge orientation: Breaking the diameter barrier. - T.-H. Hubert Chan; Mauro Sozio; Bintao Sun (J. Parallel Distributed Comput., 2021)

Sample Augmentation for Intelligent Milling Tool Wear Condition Monitoring Using Numerical Simulation and Generative Adversarial Network. - Qinsong Zhu; Bintao Sun; Yuqing Zhou; Weifang Sun; Jiawei Xiang (IEEE Trans. Instrum. Meas., 2021)

Tool wear condition monitoring based on a two-layer angle kernel extreme learning machine using sound sensor for milling process. - Yuqing Zhou; Bintao Sun; Weifang Sun; Zhi Lei (J. Intell. Manuf., 2022)

Novel tool condition identification based on finite element modelling and support vector machine. - Jicai Wang; Bintao Sun; Huan Zhang (Int. J. Manuf. Res., 2023)