Shengxin Liu

Orcid: 0000-0001-5786-6938

According to our database1, Shengxin Liu authored at least 32 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Dynamic time window based full-view coverage maximization in CSNs.
J. Comb. Optim., December, 2024

Maximum Nash Social Welfare Under Budget-Feasible EFX.
IEEE Trans. Netw. Sci. Eng., 2024

Mixed Fair Division: A Survey.
J. Artif. Intell. Res., 2024

Best-of-Both-Worlds Fair Allocation of Indivisible and Mixed Goods.
CoRR, 2024

Maximum <i>k</i>-Plex Search: An Alternated Reduction-and-Bound Method.
CoRR, 2024

Fair Division of Indivisible Goods with Comparison-Based Queries.
CoRR, 2024

Portrait Shadow Removal via Self-Exemplar Illumination Equalization.
Proceedings of the 32nd ACM International Conference on Multimedia, MM 2024, Melbourne, VIC, Australia, 28 October 2024, 2024

Allocating Mixed Goods with Customized Fairness and Indivisibility Ratio.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

On Searching Maximum Directed (k, 𝓁)-Plex.
Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

A Complete Landscape for the Price of Envy-Freeness.
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

2023
Cost-Aware and Distance-Constrained Collective Spatial Keyword Query.
IEEE Trans. Knowl. Data Eng., 2023

Fair Division with Subjective Divisibility.
CoRR, 2023

Fair Division with Allocator's Preference.
Proceedings of the Web and Internet Economics - 19th International Conference, 2023

Truthful Fair Mechanisms for Allocating Mixed Divisible and Indivisible Goods.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Efficient Exact Minimum k-Core Search in Real-World Graphs.
Proceedings of the 32nd ACM International Conference on Information and Knowledge Management, 2023

Fair Division with Prioritized Agents.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Greedy algorithms for the profit-aware social team formation problem.
J. Comb. Optim., 2022

On the Complexity of Maximizing Social Welfare within Fair Allocations of Indivisible Goods.
CoRR, 2022

Candidate selections with proportional fairness constraints.
Auton. Agents Multi Agent Syst., 2022

Efficient Algorithms for Maximal k-Biplex Enumeration.
Proceedings of the SIGMOD '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

Cost-Aware and Distance-Constrained Collective Spatial Keyword Query (Extended Abstract).
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

EFX Under Budget Constraint.
Proceedings of the Frontiers of Algorithmic Wisdom, 2022

2021
Minimizing energy on homogeneous processors with shared memory.
Theor. Comput. Sci., 2021

Fair division of mixed divisible and indivisible goods.
Artif. Intell., 2021

Maximin fairness with mixed divisible and indivisible goods.
Auton. Agents Multi Agent Syst., 2021

2020
Economic Viability of a Virtual ISP.
IEEE/ACM Trans. Netw., 2020

Consistent dynamic map labeling with fairness and importance.
Comput. Aided Geom. Des., 2020

2018
Asymptotically Optimal Algorithms for Running Max and Min Filters on Random Inputs.
IEEE Trans. Signal Process., 2018

On mining approximate and exact fault-tolerant frequent itemsets.
Knowl. Inf. Syst., 2018

2017
A Simple Greedy Algorithm for the Profit-Aware Social Team Formation Problem.
Proceedings of the Combinatorial Optimization and Applications, 2017

2015
Optimal Algorithms for Running Max and Min Filters on Random Inputs.
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2014
On Mining Proportional Fault-Tolerant Frequent Itemsets.
Proceedings of the Database Systems for Advanced Applications, 2014


  Loading...