Paraphrasing invariance coefficient: measuring para-query invariance of search engines. - Tomasz Imielinski; Jinyun Yan; Yihan Fang; Kurt Eldridge; Huiwen Yu; Peter Kelly (SEMSEARCH@WWW, 2010)

Packing-Based Approximation Algorithm for the k-Set Cover Problem. - Martin Fürer; Huiwen Yu (ISAAC, 2011)

Iterative Graph Feature Mining for Graph Indexing. - Dayu Yuan; Prasenjit Mitra; Huiwen Yu; C. Lee Giles (ICDE, 2012)

Set Coverage Problems in a One-Pass Data Stream. - Huiwen Yu; Dayu Yuan (SDM, 2013)

Approximate the k-Set Packing Problem by Local Improvements. - Martin Fürer; Huiwen Yu (CoRR, 2013)

Space Saving by Dynamic Algebraization. - Martin Fürer; Huiwen Yu (CSR, 2014)

Approximating the k -Set Packing Problem by Local Improvements. - Martin Fürer; Huiwen Yu (ISCO, 2014)

Subgraph Search in Large Graphs with Result Diversification. - Huiwen Yu; Dayu Yuan (SDM, 2014)

Updating Graph Indices with a One-Pass Algorithm. - Dayu Yuan; Prasenjit Mitra; Huiwen Yu; C. Lee Giles (SIGMOD Conference, 2015)

Space Saving by Dynamic Algebraization Based on Tree-Depth. - Martin Fürer; Huiwen Yu (Theory Comput. Syst., 2017)

Adaptive multi-region prediction strategy for dynamic multi-objective optimization. - Tao Zhang; Linjun Yu; Huiwen Yu (Appl. Soft Comput., 2025)

Improved proximal policy optimization for UAV tracking in complex environments. - Tao Zhang 120; Qingyan Zhou; Yue Zheng; Huiwen Yu (Knowl. Based Syst., 2025)