On Mining Proportional Fault-Tolerant Frequent Itemsets. - Shengxin Liu; Chung Keung Poon (DASFAA (1), 2014)

Optimal Algorithms for Running Max and Min Filters on Random Inputs. - Hongyu Liang; Shengxin Liu; Hao Yuan (COCOON, 2015)

A Simple Greedy Algorithm for the Profit-Aware Social Team Formation Problem. - Shengxin Liu; Chung Keung Poon (COCOA (2), 2017)

On mining approximate and exact fault-tolerant frequent itemsets. - Shengxin Liu; Chung Keung Poon (Knowl. Inf. Syst., 2018)

Asymptotically Optimal Algorithms for Running Max and Min Filters on Random Inputs. - Minming Li; Hongyu Liang; Shengxin Liu; Chung Keung Poon; Hao Yuan (IEEE Trans. Signal Process., 2018)

Consistent dynamic map labeling with fairness and importance. - Xiao Zhang 006; Sheung-Hung Poon; Shengxin Liu; Minming Li; Victor C. S. Lee (Comput. Aided Geom. Des., 2020)

Economic Viability of a Virtual ISP. - Shengxin Liu; Carlee Joe-Wong; Jiasi Chen; Christopher G. Brinton; Chee-Wei Tan 001; Liang Zheng 002 (IEEE/ACM Trans. Netw., 2020)

Maximin fairness with mixed divisible and indivisible goods. - Xiaohui Bei; Shengxin Liu; Xinhang Lu; Hongao Wang (Auton. Agents Multi Agent Syst., 2021)

Fair division of mixed divisible and indivisible goods. - Xiaohui Bei; Zihao Li 002; Jinyan Liu; Shengxin Liu; Xinhang Lu (Artif. Intell., 2021)

Minimizing energy on homogeneous processors with shared memory. - Vincent Chau; Chi Kit Ken Fong; Shengxin Liu; Elaine Yinling Wang; Yong Zhang 001 (Theor. Comput. Sci., 2021)

EFX Under Budget Constraint. - Sijia Dai; Guichen Gao; Shengxin Liu; Boon-Han Lim; Li Ning 001; Yicheng Xu; Yong Zhang 001 (FAW, 2022)

Cost-Aware and Distance-Constrained Collective Spatial Keyword Query (Extended Abstract). - Harry Kai-Ho Chan; Shengxin Liu; Cheng Long 001; Raymond Chi-Wing Wong (ICDE, 2022)

Efficient Algorithms for Maximal k-Biplex Enumeration. - Kaiqiang Yu; Cheng Long 001; Shengxin Liu; Da Yan 001 (SIGMOD Conference, 2022)

Candidate selections with proportional fairness constraints. - Xiaohui Bei; Shengxin Liu; Chung Keung Poon; Hongao Wang (Auton. Agents Multi Agent Syst., 2022)

On the Complexity of Maximizing Social Welfare within Fair Allocations of Indivisible Goods. - Xiaolin Bu; Zihao Li 002; Shengxin Liu; Jiaxin Song; Biaoshuai Tao (CoRR, 2022)

Greedy algorithms for the profit-aware social team formation problem. - Shengxin Liu; Chung Keung Poon (J. Comb. Optim., 2022)

Fair Division with Prioritized Agents. - Xiaolin Bu; Zihao Li 002; Shengxin Liu; Jiaxin Song; Biaoshuai Tao (AAAI, 2023)

Efficient Exact Minimum k-Core Search in Real-World Graphs. - Qifan Zhang 001; Shengxin Liu (CIKM, 2023)

Truthful Fair Mechanisms for Allocating Mixed Divisible and Indivisible Goods. - Zihao Li 002; Shengxin Liu; Xinhang Lu; Biaoshuai Tao (IJCAI, 2023)

Fair Division with Allocator's Preference. - Xiaolin Bu; Zihao Li 002; Shengxin Liu; Jiaxin Song; Biaoshuai Tao (WINE, 2023)

Cost-Aware and Distance-Constrained Collective Spatial Keyword Query. - Harry Kai-Ho Chan; Shengxin Liu; Cheng Long 001; Raymond Chi-Wing Wong (IEEE Trans. Knowl. Data Eng., 2023)

A Complete Landscape for the Price of Envy-Freeness. - Zihao Li 002; Shengxin Liu; Xinhang Lu; Biaoshuai Tao; Yichen Tao (AAMAS, 2024)

On Searching Maximum Directed (k, 𝓁)-Plex. - Shuohao Gao; Kaiqiang Yu; Shengxin Liu; Cheng Long 001; Zelong Qiu (ICDE, 2024)

Allocating Mixed Goods with Customized Fairness and Indivisibility Ratio. - Bo Li 037; Zihao Li 002; Shengxin Liu; Zekai Wu (IJCAI, 2024)

Portrait Shadow Removal via Self-Exemplar Illumination Equalization. - Qian Huang; Cheng Xu; Guiqing Li; Ziheng Wu; Shengxin Liu; Shengfeng He (ACM Multimedia, 2024)

Fair Division of Indivisible Goods with Comparison-Based Queries. - Xiaolin Bu; Zihao Li 002; Shengxin Liu; Jiaxin Song; Biaoshuai Tao (CoRR, 2024)

Maximum k-Plex Search: An Alternated Reduction-and-Bound Method. - Shuohao Gao; Kaiqiang Yu; Shengxin Liu; Cheng Long 001 (CoRR, 2024)

Best-of-Both-Worlds Fair Allocation of Indivisible and Mixed Goods. - Xiaolin Bu; Zihao Li 002; Shengxin Liu; Xinhang Lu; Biaoshuai Tao (CoRR, 2024)

Mixed Fair Division: A Survey. - Shengxin Liu; Xinhang Lu; Mashbat Suzuki; Toby Walsh (J. Artif. Intell. Res., 2024)

Maximum Nash Social Welfare Under Budget-Feasible EFX. - Sijia Dai; Guichen Gao; Shengxin Liu; Boon-Han Lim; Li Ning 001; Yicheng Xu; Yong Zhang 001 (IEEE Trans. Netw. Sci. Eng., 2024)

Maximum k-Plex Search: An Alternated Reduction-and-Bound Method. - Shuohao Gao; Kaiqiang Yu; Shengxin Liu; Cheng Long 001 (Proc. VLDB Endow., 2024)

Dynamic time window based full-view coverage maximization in CSNs. - Jingfang Su; Zeqing Li; Hongwei Du 001; Shengxin Liu (J. Comb. Optim., 2024)

Approximability Landscape of Welfare Maximization within Fair Allocations. - Xiaolin Bu; Zihao Li 002; Shengxin Liu; Jiaxin Song; Biaoshuai Tao (EC, 2025)

Fair division with subjective divisibility. - Xiaohui Bei; Shengxin Liu; Xinhang Lu (Games Econ. Behav., 2025)

ContX: Scene context prediction via context bank and layout perception. - Jingxin Liang; Yangyang Xu; Haorui Song; Yuqin Lu; Yuhui Deng; Yiyi Long; Yan Huang; Shengxin Liu; Jianbo Jiao; Shengfeng He (Pattern Recognit., 2025)

Efficient Maximum s-Bundle Search via Local Vertex Connectivity. - Yang Liu 227; Hejiao Huang; Kaiqiang Yu; Shengxin Liu; Cheng Long 001 (Proc. ACM Manag. Data, 2025)

Maximum Degree-Based Quasi-Clique Search via an Iterative Framework. - Hongbo Xia; Kaiqiang Yu; Shengxin Liu; Cheng Long 001; Xun Zhou 001 (CoRR, 2025)

Minimum $k$k-Vertex Connected Graph Search. - Yang Liu 227; Hejiao Huang; Kaiqiang Yu; Shengxin Liu; Cheng Long 001 (IEEE Trans. Knowl. Data Eng., 2025)

Temporal k-Core Query, Revisited. - Yinyu Liu; Kaiqiang Yu; Shengxin Liu; Cheng Long 001; Zhaoquan Gu (CoRR, 2025)

On Searching and Querying Maximum Directed $(k, ell )$(k,ℓ)-Plex. - Shuohao Gao; Kaiqiang Yu; Shengxin Liu; Cheng Long 001; Xun Zhou 001 (IEEE Trans. Knowl. Data Eng., 2025)