Xiaowei Wu

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 84

Top Topics

Top Venues

Publications

Haris Aziz, Bo Li, Xiaowei Wu
Approximate and strategyproof maximin share allocation of chores with ordinal preferences. Math. Program. 203 (1) (2024)
Haris Aziz, Bo Li, Hervé Moulin, Xiaowei Wu, Xinran Zhu
Almost proportional allocations of indivisible chores: Computation, approximation and efficiency. Artif. Intell. 331 (2024)
Xiaowei Wu, Shengwei Zhou
Tree Splitting Based Rounding Scheme for Weighted Proportional Allocations with Subsidy. CoRR (2024)
Shengwei Zhou, Xiaowei Wu
Approximately EFX allocations for indivisible chores. Artif. Intell. 326 (2024)
Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang
Toward a Better Understanding of Randomized Greedy Matching. J. ACM 70 (6) (2023)
Yilong Feng, Xiaowei Wu, Shengwei Zhou
Improved Competitive Ratios for Online Bipartite Matching on Degree Bounded Graphs. CoRR (2023)
Georgios Amanatidis, Haris Aziz, Georgios Birmpas, Aris Filos-Ratsikas, Bo Li, Hervé Moulin, Alexandros A. Voudouris, Xiaowei Wu
Fair division of indivisible goods: Recent progress and open questions. Artif. Intell. 322 (2023)
Xiaowei Wu, Cong Zhang, Shengwei Zhou
One Quarter Each (on Average) Ensures Proportionality. CoRR (2023)
Bo Li, Xiaowei Wu, Chenyang Xu, Ruilong Zhang
Multiagent MST Cover: Pleasing All Optimally via a Simple Voting Rule. AAAI (2023)
Xiaowei Wu, Cong Zhang, Shengwei Zhou
One Quarter Each (on Average) Ensures Proportionality. WINE (2023)
Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Xiaowei Wu
Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover. SIAM J. Comput. 52 (5) (2023)
Guoliang Qiu, Yilong Feng, Shengwei Zhou, Xiaowei Wu
Improved Competitive Ratio for Edge-Weighted Online Stochastic Matching. WINE (2023)
Biaoshuai Tao, Xiaowei Wu, Ziqi Yu, Shengwei Zhou
On the Existence of EFX (and Pareto-Optimal) Allocations for Binary Chores. CoRR (2023)
Hanlin Li, Xiaowei Wu, Leong Hou U, Kun Pang Kou
Near-Optimal Scheduling for Crowdsourced Transit System With Skip-Stop Tactic. IEEE Trans. Knowl. Data Eng. 35 (11) (2023)
Shengwei Zhou, Rufan Bai, Xiaowei Wu
Multi-agent Online Scheduling: MMS Allocations for Indivisible Items. CoRR (2023)
Rufan Bai, Haoxing Lin, Xinyu Yang, Xiaowei Wu, Minming Li, Weijia Jia
Stackelberg Security Games with Contagious Attacks on a Network: Reallocation to the Rescue. J. Artif. Intell. Res. 77 (2023)
Yilong Feng, Guoliang Qiu, Xiaowei Wu, Shengwei Zhou
Improved Competitive Ratio for Edge-Weighted Online Stochastic Matching. CoRR (2023)
Bo Li, Minming Li, Xiaowei Wu
Well-behaved online load balancing against strategic jobs. J. Sched. 26 (5) (2023)
Jiarui Gan, Bo Li, Xiaowei Wu
Approximation Algorithm for Computing Budget-Feasible EF1 Allocations. AAMAS (2023)
Xiaowei Wu, Cong Zhang, Shengwei Zhou
Weighted EF1 Allocations for Indivisible Chores. EC (2023)
Xiaowei Wu, Cong Zhang, Shengwei Zhou
Weighted EF1 Allocations for Indivisible Chores. CoRR (2023)
Shengwei Zhou, Rufan Bai, Xiaowei Wu
Multi-agent Online Scheduling: MMS Allocations for Indivisible Items. ICML (2023)
Haris Aziz, Bo Li, Hervé Moulin, Xiaowei Wu
Algorithmic Fair Allocation of Indivisible Items: A Survey and New Questions. CoRR (2022)
Bo Li, Xiaowei Wu, Yutong Wu
Query Efficient Prophet Inequality with Unknown I.I.D. Distributions. CoRR (2022)
Haris Aziz, Bo Li, Hervé Moulin, Xiaowei Wu
Algorithmic fair allocation of indivisible items: a survey and new questions. SIGecom Exch. 20 (1) (2022)
Rufan Bai, Haoxing Lin, Xinyu Yang, Xiaowei Wu, Minming Li, Weijia Jia
Mixed Strategies for Security Games with General Defending Requirements. IJCAI (2022)
Rufan Bai, Haoxing Lin, Xinyu Yang, Xiaowei Wu, Minming Li, Weijia Jia
Mixed Strategies for Security Games with General Defending Requirements. CoRR (2022)
Shengwei Zhou, Xiaowei Wu
Approximately EFX Allocations for Indivisible Chores. IJCAI (2022)
Siqiang Luo, Xiaowei Wu, Ben Kao
Distributed PageRank computation with improved round complexities. Inf. Sci. 607 (2022)
Bo Li, Xiaowei Wu, Chenyang Xu, Ruilong Zhang
Multiagent MST Cover: Pleasing All Optimally via A Simple Voting Rule. CoRR (2022)
Georgios Amanatidis, Haris Aziz, Georgios Birmpas, Aris Filos-Ratsikas, Bo Li, Hervé Moulin, Alexandros A. Voudouris, Xiaowei Wu
Fair Division of Indivisible Goods: A Survey. CoRR (2022)
Bo Li, Yingkai Li, Xiaowei Wu
Almost (Weighted) Proportional Allocations for Indivisible Chores✱✱. WWW (2022)
Hanlin Li, Xiaowei Wu, Leong Hou U, Kun Pang Kou
Near-Optimal Fixed-Route Scheduling for Crowdsourced Transit System. ICDE (2021)
Xiaowei Wu, Bo Li, Jiarui Gan
Budget-feasible Maximum Nash Social Welfare is Almost Envy-free. IJCAI (2021)
Shengwei Zhou, Xiaowei Wu
Approximately EFX Allocations for Indivisible Chores. CoRR (2021)
Bo Li, Yingkai Li, Xiaowei Wu
Almost Proportional Allocations for Indivisible Chores. CoRR (2021)
Jiarui Gan, Bo Li, Xiaowei Wu
Approximately Envy-Free Budget-Feasible Allocation. CoRR (2021)
Rufan Bai, Haoxing Lin, Xinyu Yang, Xiaowei Wu, Minming Li, Weijia Jia
Defending against Contagious Attacks on a Network with Resource Reallocation. AAAI (2021)
Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Xiaowei Wu
Dynamic Set Cover: Improved Amortized and Worst-Case Update Time. SODA (2021)
Monika Henzinger, Xiaowei Wu
Upper and Lower Bounds for Fully Retroactive Graph Problems. WADS (2021)
Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang
Towards a better understanding of randomized greedy matching. STOC (2020)
Minming Li, Long Tran-Thanh, Xiaowei Wu
Defending with Shared Resources on a Network. AAAI (2020)
Rufan Bai, Haoxing Lin, Xinyu Yang, Xiaowei Wu, Minming Li, Weijia Jia
Defending Against Contagious Attacks on a Network with Resource Reallocation. CoRR (2020)
Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang
A Simple 1-1/e Approximation for Oblivious Bipartite Matching. CoRR (2020)
Zhiyi Huang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang
Fully Online Matching II: Beating Ranking and Water-filling. CoRR (2020)
Zhiyi Huang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang
Fully Online Matching II: Beating Ranking and Water-filling. FOCS (2020)
Xiaowei Wu, Bo Li, Jiarui Gan
Budget-feasible Maximum Nash Social Welfare Allocation is Almost Envy-free. CoRR (2020)
Haris Aziz, Bo Li, Xiaowei Wu
Approximate and Strategyproof Maximin Share Allocation of Chores with Ordinal Preferences. CoRR (2020)
Zhiyi Huang, Ning Kang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang, Xue Zhu
Fully Online Matching. J. ACM 67 (3) (2020)
Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Xiaowei Wu
An Improved Algorithm for Dynamic Set Cover. CoRR (2020)
Haris Aziz, Bo Li, Xiaowei Wu
Strategyproof and Approximately Maxmin Fair Share Allocation of Chores. IJCAI (2019)
Hau Chan, Jing Chen, Bo Li, Xiaowei Wu
Maximin-Aware Allocations of Indivisible Goods. AAMAS (2019)
Hau Chan, Jing Chen, Bo Li, Xiaowei Wu
Maximin-Aware Allocations of Indivisible Goods. IJCAI (2019)
Zhiyi Huang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang
with Random Arrivals. ACM Trans. Algorithms 15 (3) (2019)
Monika Henzinger, Xiaowei Wu
Upper and Lower Bounds for Fully Retroactive Graph Problems. CoRR (2019)
Minming Li, Long Tran-Thanh, Xiaowei Wu
Defending with Shared Resources on a Network. CoRR (2019)
Zhiyi Huang, Binghui Peng, Zhihao Gavin Tang, Runzhou Tao, Xiaowei Wu, Yuhao Zhang
Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model. SODA (2019)
Bo Li, Minming Li, Xiaowei Wu
Well-behaved Online Load Balancing Against Strategic Jobs. AAMAS (2019)
Hau Chan, Jing Chen, Bo Li, Xiaowei Wu
Maximin-Aware Allocations of Indivisible Goods. CoRR (2019)
Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang
Perturbed Greedy on Oblivious Matching Problems. CoRR (2019)
Siqiang Luo, Ben Kao, Xiaowei Wu, Reynold Cheng
MPR - A Partitioning-Replication Framework for Multi-Processing kNN Search on Road Networks. ICDE (2019)
Bo Li, Minming Li, Xiaowei Wu
Well-behaved Online Load Balancing Against Strategic Jobs. CoRR (2019)
Haris Aziz, Bo Li, Xiaowei Wu
Strategyproof and Approximately Maxmin Fair Share Allocation of Chores. CoRR (2019)
T.-H. Hubert Chan, Zhihao Gavin Tang, Xiaowei Wu, Chenzi Zhang
Diffusion operator and spectral analysis for directed hypergraph Laplacian. Theor. Comput. Sci. 784 (2019)
Zhiyi Huang, Binghui Peng, Zhihao Gavin Tang, Runzhou Tao, Xiaowei Wu, Yuhao Zhang
Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model. CoRR (2018)
Zhiyi Huang, Ning Kang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang
Online Makespan Minimization: The Power of Restart. CoRR (2018)
Zhiyi Huang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang
Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals. CoRR (2018)
T.-H. Hubert Chan, Zhihao Gavin Tang, Xiaowei Wu
On (1,ϵ)-Restricted Max-Min Fair Allocation Problem. Algorithmica 80 (7) (2018)
Zhiyi Huang, Ning Kang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang
Online Makespan Minimization: The Power of Restart. APPROX-RANDOM (2018)
Zhiyi Huang, Ning Kang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang, Xue Zhu
How to match when all vertices arrive online. STOC (2018)
Zhiyi Huang, Ning Kang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang, Xue Zhu
How to Match when All Vertices Arrive Online. CoRR (2018)
T.-H. Hubert Chan, Fei Chen, Xiaowei Wu, Zhichao Zhao
Ranking on Arbitrary Graphs: Rematch via Continuous Linear Programming. SIAM J. Comput. 47 (4) (2018)
Zhiyi Huang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang
Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals. ICALP (2018)
T.-H. Hubert Chan, Fei Chen, Xiaowei Wu
Analyzing Node-Weighted Oblivious Matching Problem via Continuous LP with Jump Discontinuity. ACM Trans. Algorithms 14 (2) (2018)
T.-H. Hubert Chan, Shaofeng H.-C. Jiang, Zhihao Gavin Tang, Xiaowei Wu
Online Submodular Maximization Problem with Vector Packing Constraint. ESA (2017)
Jiafeng Hu, Xiaowei Wu, Reynold Cheng, Siqiang Luo, Yixiang Fang
On Minimal Steiner Maximum-Connected Subgraph Queries. IEEE Trans. Knowl. Data Eng. 29 (11) (2017)
T.-H. Hubert Chan, Zhihao Gavin Tang, Xiaowei Wu, Chenzi Zhang
Diffusion Operator and Spectral Analysis for Directed Hypergraph Laplacian. CoRR (2017)
Shuguang Hu, Xiaowei Wu, T.-H. Hubert Chan
Maintaining Densest Subsets Efficiently in Evolving Hypergraphs. CIKM (2017)
T.-H. Hubert Chan, Shaofeng H.-C. Jiang, Zhihao Gavin Tang, Xiaowei Wu
Online Submodular Maximization Problem with Vector Packing Constraint. CoRR (2017)
Petrie Wong, Cliz Sun, Eric Lo, Man Lung Yiu, Xiaowei Wu, Zhichao Zhao, T.-H. Hubert Chan, Ben Kao
Finding k most influential edges on flow graphs. Inf. Syst. 65 (2017)
T.-H. Hubert Chan, Zhihao Gavin Tang, Xiaowei Wu
On (1, epsilon)-Restricted Max-Min Fair Allocation Problem. ISAAC (2016)
Jiafeng Hu, Xiaowei Wu, Reynold Cheng, Siqiang Luo, Yixiang Fang
Querying Minimal Steiner Maximum-Connected Subgraphs in Large Graphs. CIKM (2016)
Melika Abolhassani, T.-H. Hubert Chan, Fei Chen, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Hamid Mahini, Xiaowei Wu
Beating Ratio 0.5 for Weighted Oblivious Matching Problems. ESA (2016)
T.-H. Hubert Chan, Zhihao Gavin Tang, Xiaowei Wu
On ($1$, $ε$)-Restricted Max-Min Fair Allocation Problem. CoRR (2016)
Xiaowei Wu, Chenzi Zhang
Efficient Algorithm for Computing All Low s-t Edge Connectivities in Directed Graphs. MFCS (2) (2015)
T.-H. Hubert Chan, Xiaowei Wu, Chenzi Zhang, Zhichao Zhao
Dynamic Tree Shortcut with Constant Degree. COCOON (2015)
Wenbin Tang, Xiaowei Wu
Decentralized P2P protocol for video-on-demand streaming: Simple and efficient. ICNSC (2015)
Wenbin Tang, Xiaowei Wu, T.-H. Hubert Chan
An incentive protocol for distributed dynamic P2P video-on-demand streaming. ICCCN (2014)
Fei Chen, Xiaowei Wu
Perfect Pipelining for Streaming Large File in Peer-to-Peer Networks. IFIP TCS (2014)
T.-H. Hubert Chan, Fei Chen, Xiaowei Wu, Zhichao Zhao
Ranking on Arbitrary Graphs: Rematch via Continuous LP with Monotone and Boundary Condition Constraints. SODA (2014)
T.-H. Hubert Chan, Fei Chen, Xiaowei Wu, Zhichao Zhao
Ranking on Arbitrary Graphs: Rematch via Continuous LP with Monotone and Boundary Condition Constraints. CoRR (2013)