default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShengxin Liu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Shengxin Liu, Xinhang Lu, Mashbat Suzuki, Toby Walsh:
Mixed Fair Division: A Survey. J. Artif. Intell. Res. 80: 1373-1406 (2024)- [j11]Sijia Dai
, Guichen Gao, Shengxin Liu, Boon-Han Lim, Li Ning, Yicheng Xu, Yong Zhang:
Maximum Nash Social Welfare Under Budget-Feasible EFX. IEEE Trans. Netw. Sci. Eng. 11(2): 1810-1820 (2024) - [c19]Shengxin Liu, Xinhang Lu, Mashbat Suzuki, Toby Walsh:
Mixed Fair Division: A Survey. AAAI 2024: 22641-22649 - [c18]Zihao Li, Shengxin Liu, Xinhang Lu, Biaoshuai Tao, Yichen Tao:
A Complete Landscape for the Price of Envy-Freeness. AAMAS 2024: 1183-1191 - [c17]Shuohao Gao, Kaiqiang Yu, Shengxin Liu, Cheng Long, Zelong Qiu:
On Searching Maximum Directed (k, 𝓁)-Plex. ICDE 2024: 2570-2583 - [c16]Bo Li, Zihao Li, Shengxin Liu, Zekai Wu:
Allocating Mixed Goods with Customized Fairness and Indivisibility Ratio. IJCAI 2024: 2868-2876 - [c15]Qian Huang, Cheng Xu, Guiqing Li, Ziheng Wu, Shengxin Liu, Shengfeng He:
Portrait Shadow Removal via Self-Exemplar Illumination Equalization. ACM Multimedia 2024: 7474-7482 - [i13]Zihao Li, Shengxin Liu, Xinhang Lu, Biaoshuai Tao, Yichen Tao:
A Complete Landscape for the Price of Envy-Freeness. CoRR abs/2401.01516 (2024) - [i12]Bo Li, Zihao Li, Shengxin Liu, Zekai Wu:
Allocating Mixed Goods with Customized Fairness and Indivisibility Ratio. CoRR abs/2404.18132 (2024) - [i11]Xiaolin Bu, Zihao Li, Shengxin Liu, Jiaxin Song, Biaoshuai Tao:
Fair Division of Indivisible Goods with Comparison-Based Queries. CoRR abs/2404.18133 (2024) - [i10]Shuohao Gao, Kaiqiang Yu, Shengxin Liu, Cheng Long:
Maximum k-Plex Search: An Alternated Reduction-and-Bound Method. CoRR abs/2406.00617 (2024) - 2023
- [j10]Harry Kai-Ho Chan, Shengxin Liu, Cheng Long, Raymond Chi-Wing Wong:
Cost-Aware and Distance-Constrained Collective Spatial Keyword Query. IEEE Trans. Knowl. Data Eng. 35(2): 1324-1336 (2023) - [c14]Xiaolin Bu, Zihao Li, Shengxin Liu, Jiaxin Song, Biaoshuai Tao:
Fair Division with Prioritized Agents. AAAI 2023: 5540-5548 - [c13]Qifan Zhang, Shengxin Liu:
Efficient Exact Minimum k-Core Search in Real-World Graphs. CIKM 2023: 3391-3401 - [c12]Zihao Li, Shengxin Liu, Xinhang Lu, Biaoshuai Tao:
Truthful Fair Mechanisms for Allocating Mixed Divisible and Indivisible Goods. IJCAI 2023: 2808-2816 - [c11]Xiaolin Bu, Zihao Li, Shengxin Liu, Jiaxin Song, Biaoshuai Tao:
Fair Division with Allocator's Preference. WINE 2023: 77-94 - [i9]Zihao Li, Shengxin Liu, Xinhang Lu, Biaoshuai Tao:
Truthful Fair Mechanisms for Allocating Mixed Divisible and Indivisible Goods. CoRR abs/2305.09206 (2023) - [i8]Shengxin Liu, Xinhang Lu, Mashbat Suzuki, Toby Walsh:
Mixed Fair Division: A Survey. CoRR abs/2306.09564 (2023) - [i7]Xiaohui Bei, Shengxin Liu, Xinhang Lu:
Fair Division with Subjective Divisibility. CoRR abs/2310.00976 (2023) - [i6]Xiaolin Bu, Zihao Li, Shengxin Liu, Jiaxin Song, Biaoshuai Tao:
Fair Division with Allocator's Preference. CoRR abs/2310.03475 (2023) - 2022
- [j9]Xiaohui Bei, Shengxin Liu, Chung Keung Poon, Hongao Wang:
Candidate selections with proportional fairness constraints. Auton. Agents Multi Agent Syst. 36(1): 5 (2022) - [j8]Shengxin Liu, Chung Keung Poon:
Greedy algorithms for the profit-aware social team formation problem. J. Comb. Optim. 44(1): 94-118 (2022) - [c10]Sijia Dai, Guichen Gao, Shengxin Liu, Boon-Han Lim, Li Ning, Yicheng Xu, Yong Zhang:
EFX Under Budget Constraint. FAW 2022: 3-14 - [c9]Harry Kai-Ho Chan, Shengxin Liu, Cheng Long, Raymond Chi-Wing Wong:
Cost-Aware and Distance-Constrained Collective Spatial Keyword Query (Extended Abstract). ICDE 2022: 1505-1506 - [c8]Kaiqiang Yu, Cheng Long, Shengxin Liu, Da Yan:
Efficient Algorithms for Maximal k-Biplex Enumeration. SIGMOD Conference 2022: 860-873 - [i5]Xiaolin Bu, Zihao Li, Shengxin Liu, Jiaxin Song, Biaoshuai Tao:
On the Complexity of Maximizing Social Welfare within Fair Allocations of Indivisible Goods. CoRR abs/2205.14296 (2022) - [i4]Xiaolin Bu, Zihao Li, Shengxin Liu, Jiaxin Song, Biaoshuai Tao:
Fair Division with Prioritized Agents. CoRR abs/2211.16143 (2022) - 2021
- [j7]Xiaohui Bei, Shengxin Liu, Xinhang Lu, Hongao Wang:
Maximin fairness with mixed divisible and indivisible goods. Auton. Agents Multi Agent Syst. 35(2): 34 (2021) - [j6]Xiaohui Bei, Zihao Li, Jinyan Liu, Shengxin Liu, Xinhang Lu:
Fair division of mixed divisible and indivisible goods. Artif. Intell. 293: 103436 (2021) - [j5]Vincent Chau, Chi Kit Ken Fong, Shengxin Liu, Elaine Yinling Wang, Yong Zhang:
Minimizing energy on homogeneous processors with shared memory. Theor. Comput. Sci. 866: 160-170 (2021) - [c7]Xiaohui Bei, Shengxin Liu, Xinhang Lu, Hongao Wang:
Maximin Fairness with Mixed Divisible and Indivisible Goods. AAAI 2021: 5167-5175 - [i3]Kaiqiang Yu, Cheng Long, Shengxin Liu, Da Yan:
Efficient Algorithms for Maximal k-Biplex Enumeration. CoRR abs/2112.14414 (2021) - 2020
- [j4]Xiao Zhang, Sheung-Hung Poon, Shengxin Liu, Minming Li, Victor C. S. Lee:
Consistent dynamic map labeling with fairness and importance. Comput. Aided Geom. Des. 81: 101892 (2020) - [j3]Shengxin Liu, Carlee Joe-Wong, Jiasi Chen, Christopher G. Brinton, Chee-Wei Tan, Liang Zheng:
Economic Viability of a Virtual ISP. IEEE/ACM Trans. Netw. 28(2): 902-916 (2020) - [c6]Xiaohui Bei, Zihao Li, Jinyan Liu, Shengxin Liu, Xinhang Lu:
Fair Division of Mixed Divisible and Indivisible Goods. AAAI 2020: 1814-1821 - [c5]Xiaohui Bei, Shengxin Liu, Chung Keung Poon, Hongao Wang:
Candidate Selections with Proportional Fairness Constraints. AAMAS 2020: 150-158 - [c4]Vincent Chau, Chi Kit Ken Fong, Shengxin Liu, Elaine Yinling Wang, Yong Zhang:
Minimizing Energy on Homogeneous Processors with Shared Memory. FAW 2020: 83-95 - [i2]Xiaohui Bei, Shengxin Liu, Xinhang Lu, Hongao Wang:
Maximin Fairness with Mixed Divisible and Indivisible Goods. CoRR abs/2002.05245 (2020)
2010 – 2019
- 2019
- [i1]Xiaohui Bei, Zihao Li, Jinyan Liu, Shengxin Liu, Xinhang Lu:
Fair Division of Mixed Divisible and Indivisible Goods. CoRR abs/1911.07048 (2019) - 2018
- [j2]Shengxin Liu, Chung Keung Poon:
On mining approximate and exact fault-tolerant frequent itemsets. Knowl. Inf. Syst. 55(2): 361-391 (2018) - [j1]Minming Li, Hongyu Liang, Shengxin Liu, Chung Keung Poon, Hao Yuan:
Asymptotically Optimal Algorithms for Running Max and Min Filters on Random Inputs. IEEE Trans. Signal Process. 66(13): 3421-3435 (2018) - 2017
- [c3]Shengxin Liu, Chung Keung Poon:
A Simple Greedy Algorithm for the Profit-Aware Social Team Formation Problem. COCOA (2) 2017: 379-393 - 2015
- [c2]Hongyu Liang, Shengxin Liu, Hao Yuan:
Optimal Algorithms for Running Max and Min Filters on Random Inputs. COCOON 2015: 507-520 - 2014
- [c1]Shengxin Liu, Chung Keung Poon:
On Mining Proportional Fault-Tolerant Frequent Itemsets. DASFAA (1) 2014: 342-356
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
