Xiaowei Wu
Xiaowei Wu
IOTSC, University of Macau
Verified email at - Homepage
Cited by
Cited by
How to match when all vertices arrive online
Z Huang, N Kang, ZG Tang, X Wu, Y Zhang, X Zhu
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of computing …, 2018
Fair division of indivisible goods: A survey
G Amanatidis, G Birmpas, A Filos-Ratsikas, AA Voudouris
arXiv preprint arXiv:2202.07551, 2022
Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals
Z Huang, ZG Tang, X Wu, Y Zhang
ACM Transactions on Algorithms (TALG) 15 (3), 1-15, 2019
Tight competitive ratios of classic matching algorithms in the fully online model
Z Huang, B Peng, ZG Tang, R Tao, X Wu, Y Zhang
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
Querying minimal steiner maximum-connected subgraphs in large graphs
J Hu, X Wu, R Cheng, S Luo, Y Fang
Proceedings of the 25th ACM International on Conference on Information and …, 2016
Algorithmic fair allocation of indivisible items: A survey and new questions
H Aziz, B Li, H Moulin, X Wu
ACM SIGecom Exchanges 20 (1), 24-40, 2022
Maintaining densest subsets efficiently in evolving hypergraphs
S Hu, X Wu, THH Chan
Proceedings of the 2017 ACM on Conference on Information and Knowledge …, 2017
On minimal steiner maximum-connected subgraph queries
J Hu, X Wu, R Cheng, S Luo, Y Fang
IEEE Transactions on Knowledge and Data Engineering 29 (11), 2455-2469, 2017
Fair division of indivisible goods: Recent progress and open questions
G Amanatidis, H Aziz, G Birmpas, A Filos-Ratsikas, B Li, H Moulin, ...
Artificial Intelligence, 103965, 2023
Fully online matching
Z Huang, N Kang, ZG Tang, X Wu, Y Zhang, X Zhu
Journal of the ACM (JACM) 67 (3), 1-25, 2020
Fully online matching ii: Beating ranking and water-filling
Z Huang, ZG Tang, X Wu, Y Zhang
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
Almost (Weighted) Proportional Allocations for Indivisible Chores✱✱
B Li, Y Li, X Wu
Proceedings of the ACM Web Conference 2022, 122-131, 2022
Maximin-aware allocations of indivisible goods
H Chan, J Chen, B Li, X Wu
arXiv preprint arXiv:1905.09969, 2019
Approximately EFX allocations for indivisible chores
S Zhou, X Wu
Artificial Intelligence 326, 104037, 2024
Diffusion operator and spectral analysis for directed hypergraph Laplacian
THH Chan, ZG Tang, X Wu, C Zhang
Theoretical Computer Science 784, 46-64, 2019
Strategyproof and approximately maxmin fair share allocation of chores
H Aziz, B Li, X Wu
arXiv preprint arXiv:1905.08925, 2019
Ranking on arbitrary graphs: Rematch via continuous lp with monotone and boundary condition constraints
THH Chan, F Chen, X Wu, Z Zhao
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
Approximate and strategyproof maximin share allocation of chores with ordinal preferences
H Aziz, B Li, X Wu
Mathematical Programming 203 (1), 319-345, 2024
Budget-feasible maximum nash social welfare is almost envy-free
X Wu, B Li, J Gan
International Joint Conferences on Artificial Intelligence Organization, 2021
Dynamic set cover: Improved amortized and worst-case update time
S Bhattacharya, M Henzinger, D Nanongkai, X Wu
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
The system can't perform the operation now. Try again later.
Articles 1–20