Xiaowei Wu

Navedeno

	Vse	Od leta 2018
Navedbe	827	792
indeks h	17	16
indeks i10	24	21

300

150

225

20142015201620172018201920202021202220234 7 6 16 34 64 114 97 188 291

Javni dostop

Prikaži vse

25 člankov

3 članki

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

Zhihao Gavin TangShanghai University of Finance and EconomicsPreverjeni e-poštni naslov na mail.shufe.edu.cn
T-H. Hubert ChanDepartment of Computer Science, The University of Hong KongPreverjeni e-poštni naslov na cs.hku.hk
Yuhao ZhangShanghai Jiao Tong UniversityPreverjeni e-poštni naslov na sjtu.edu.cn
Zhiyi HuangThe University of Hong KongPreverjeni e-poštni naslov na cs.hku.hk
Haris AzizUNSW Sydney - Scientia Associate ProfessorPreverjeni e-poštni naslov na unsw.edu.au
Fei ChenHuawei Noah's Ark LabPreverjeni e-poštni naslov na huawei.com
Siqiang LuoAssistant Professor of Nanyang Technological UniversityPreverjeni e-poštni naslov na ntu.edu.sg
Shengwei ZhouPh.D. Student, IOTSC, University of MacauPreverjeni e-poštni naslov na connect.um.edu.mo
Herve MoulinUniversity of GlasgowPreverjeni e-poštni naslov na glasgow.ac.uk
Reynold ChengProfessor of Computer Science, University of Hong KongPreverjeni e-poštni naslov na cs.hku.hk
Zhichao ZHAOThe University of Hong KongPreverjeni e-poštni naslov na cs.hku.hk
Jiarui GanUniversity of OxfordPreverjeni e-poštni naslov na cs.ox.ac.uk
Jiafeng HuGooglePreverjeni e-poštni naslov na google.com
Yixiang FangAssociate Professor, The Chinese University of Hong Kong, ShenzhenPreverjeni e-poštni naslov na cuhk.edu.cn
Monika HenzingerProfessor of Computer Science, Institute of Science and Technology Austria (ISTA)Preverjeni e-poštni naslov na ist.ac.at
Ben KaoThe University of Hong KongPreverjeni e-poštni naslov na cs.hku.hk
Minming LICity University of Hong KongPreverjeni e-poštni naslov na gapps.cityu.edu.hk
Sayan BhattacharyaUniversity of WarwickPreverjeni e-poštni naslov na warwick.ac.uk
Danupon NanongkaiDirector, Max Planck Institute for InformaticsPreverjeni e-poštni naslov na mpi-inf.mpg.de
Yingkai LiYale UniversityPreverjeni e-poštni naslov na yale.edu

Spremljaj

Xiaowei Wu

IOTSC, University of Macau

Preverjeni e-poštni naslov na um.edu.mo - Domača stran

Theoretical Computer Science


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
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	85	2018
Fair division of indivisible goods: A survey G Amanatidis, G Birmpas, A Filos-Ratsikas, AA Voudouris arXiv preprint arXiv:2202.07551, 2022	65	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	65	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	61	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	44	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	42	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	41	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	36	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	28	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	26	2020
Maximin-aware allocations of indivisible goods H Chan, J Chen, B Li, X Wu arXiv preprint arXiv:1905.09969, 2019	26	2019
Almost (Weighted) Proportional Allocations for Indivisible Chores✱✱ B Li, Y Li, X Wu Proceedings of the ACM Web Conference 2022, 122-131, 2022	23	2022
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	23	2014
Approximately EFX allocations for indivisible chores S Zhou, X Wu Artificial Intelligence, 104037, 2023	22	2023
Diffusion operator and spectral analysis for directed hypergraph Laplacian THH Chan, ZG Tang, X Wu, C Zhang Theoretical Computer Science 784, 46-64, 2019	22	2019
Strategyproof and approximately maxmin fair share allocation of chores H Aziz, B Li, X Wu arXiv preprint arXiv:1905.08925, 2019	21	2019
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	18	2023
Budget-feasible maximum nash social welfare is almost envy-free X Wu, B Li, J Gan International Joint Conferences on Artificial Intelligence Organization, 2021	15	2021
Approximate and strategyproof maximin share allocation of chores with ordinal preferences H Aziz, B Li, X Wu Mathematical Programming, 1-27, 2022	14	2022
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	14	2021

Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.

Članki 1–20

Št. navedb na leto

Podvojene navedbe

Združene navedbe

Dodajanje soavtorjevSoavtorji

Spremljaj

Navedeno

Soavtorji