Xiaowei Wu
Xiaowei Wu
IOTSC, University of Macau
Verified email at um.edu.mo - 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
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
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
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
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
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
Diffusion operator and spectral analysis for directed hypergraph laplacian
THH Chan, ZG Tang, X Wu, C Zhang
Theoretical Computer Science 784, 46-64, 2019
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
Beating ratio 0.5 for weighted oblivious matching problems
M Abolhassani, THH Chan, F Chen, H Esfandiari, MT Hajiaghayi, ...
24th annual European symposium on algorithms (ESA 2016), 2016
Fully online matching ii: Beating ranking and water-filling
Z Huang, ZG Tang, X Wu, Y Zhang
arXiv preprint arXiv:2005.06311, 2020
Finding k most influential edges on flow graphs
P Wong, C Sun, E Lo, ML Yiu, X Wu, Z Zhao, THH Chan, B Kao
Information Systems 65, 93-105, 2017
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
Strategyproof and approximately maxmin fair share allocation of chores
H Aziz, B Li, X Wu
arXiv preprint arXiv:1905.08925, 2019
Towards a better understanding of randomized greedy matching
ZG Tang, X Wu, Y Zhang
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
Maximin-aware allocations of indivisible goods
H Chan, J Chen, B Li, X Wu
arXiv preprint arXiv:1905.09969, 2019
Online submodular maximization problem with vector packing constraint
TH Chan, SHC Jiang, ZG Tang, X Wu
arXiv preprint arXiv:1706.06922, 2017
An improved algorithm for dynamic set cover
S Bhattacharya, M Henzinger, D Nanongkai, X Wu
arXiv preprint arXiv:2002.11171, 2020
Decentralized p2p protocol for video-on-demand streaming: Simple and efficient
W Tang, X Wu
2015 IEEE 12th International Conference on Networking, Sensing and Control …, 2015
MPR—A Partitioning-Replication Framework for Multi-Processing kNN Search on Road Networks
S Luo, B Kao, X Wu, R Cheng
2019 IEEE 35th International Conference on Data Engineering (ICDE), 1310-1321, 2019
Analyzing node-weighted oblivious matching problem via continuous LP with jump discontinuity
THH Chan, F Chen, X Wu
ACM Transactions on Algorithms (TALG) 14 (2), 1-25, 2018
The system can't perform the operation now. Try again later.
Articles 1–20