I am a Postdoctoral Fellow working with Dr. Minming Li at the Department of Computer Science, City University of Hong Kong. Before that, I was a Postdoctoral Fellow working with Dr. Yixin Cao in the Hong Kong Polytechnic University, and a Postdoctoral Fellow working with Dr. Hubert Chan in the University of Hong Kong. I received my PhD degree from the University of Hong Kong under the supervision of Dr. Hubert Chan. I received my BEng degree from University of Science and Technology of China.

Research Interests

I am broadly interested in theoretical computer science, and its applications in data mining problems. More specifically, my research interests span various topics in online algorithms, approximation algorithms, data structure and truthful mechanism design.

Journal Publications

• Ranking on Arbitrary Graphs: Rematch via Continuous Linear Programming

T-H. Hubert Chan, Fei Chen, Xiaowei Wu, and Zhichao Zhao

SIAM Journal on Computing (SICOMP), 47(4), 1529–1546. 2018

• Analyzing Node-Weighted Oblivious Matching Problem via Continuous LP with Jump Discontinuity

T-H. Hubert Chan, Fei Chen, Xiaowei Wu, and Zhichao Zhao

ACM Transactions on Algorithms (TALG), 14(2), 12:1–12:25. 2018

• On (1,\epsilon)-Restricted Max-Min Fair Allocation Problem

T-H. Hubert Chan, Zhihao Gavin Tang, and Xiaowei Wu

Algorithmica, 80(7), 2181–2200. 2018

• On Minimal Steiner Maximum-Connected Subgraph Queries

Jiafeng Hu, Xiaowei Wu, Reynold Cheng, Siqiang Luo, and Yixiang Fang

IEEE Transactions on Knowledge and Data Engineering (TKDE), 29(11): 2455-2469. 2017

• Finding k most influential edges on flow graphs

Petrie Wong, Cliz Sun, Eric Lo, Man Lung Yiu, Xiaowei Wu, Zhichao Zhao, T.-H. Hubert Chan, and Ben Kao

Information Systems, 65: 93-105. 2017

Selected Conference Publications

Online Algorithms

• Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model

Zhiyi Huang, Binghui Peng, Zhihao Gavin Tang, Runzhou Tao, Xiaowei Wu and Yuhao Zhang. In SODA 2019.

• Online Makespan Minimization: The Power of Restart

Zhiyi Huang, Ning Kang, Zhihao Gavin Tang, Xiaowei Wu and Yuhao Zhang. In APPROX 2018. (pdf)

• Online Vertex Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals

Zhiyi Huang, Zhihao Gavin Tang, Xiaowei Wu and Yuhao Zhang. In ICALP 2018. (pdf)

• How to Match when All Vertices Arrive Online

Zhiyi Huang, Ning Kang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang and Xue Zhu. In STOC 2018. (pdf)

• Online Submodular Maximization Problem with Vector Packing Constraint

T-H. Hubert Chan, Shaofeng H.-C. Jiang, Zhihao Gavin Tang and Xiaowei Wu. In ESA 2017. (pdf)

Approximation Algorithms

• On (1,\epsilon)-Restricted Max-Min Fair Allocation Problem

T-H. Hubert Chan, Zhihao Gavin Tang and Xiaowei Wu. In ISAAC 2016. (pdf)

• Beating Ratio 0.5 for Weighted Oblivious Matching Problems

Melika Abolhassani, T-H. Hubert Chan, Fei Chen, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Hamid Mahini and Xiaowei Wu. In ESA 2016. (pdf)

• Ranking on Arbitrary Graphs: Rematch via Continuous LP with Monotone and Boundary Condition Constraints

T-H. Hubert Chan, Fei Chen, Xiaowei Wu and Zhichao Zhao. In SODA 2014. (pdf)

Data Mining

• Maintaining Densest Subsets Efficiently in Evolving Hypergraphs

Shuguang Hu, Xiaowei Wu and T-H. Hubert Chan. In CIKM 2017. (pdf)

• Querying Minimal Steiner Maximum-Connected Subgraphs in Large Graphs

Jiafeng Hu, Xiaowei Wu, Reynold Cheng, Siqiang Luo and Yixiang Fang. In CIKM 2016. (pdf)

Last Modified: Oct 04, 2018