An optimization approach to gene stacking. - Pan Xu 001; Lizhi Wang 002; William D. Beavis (Eur. J. Oper. Res., 2011)

A Lower Bound on Proximity Preservation by Space Filling Curves. - Pan Xu 001; Srikanta Tirthapura (IPDPS, 2012)

An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions. - Pan Xu 001; Lizhi Wang 002 (Comput. Oper. Res., 2014)

Optimality of Clustering Properties of Space-Filling Curves. - Pan Xu 001; Srikanta Tirthapura (ACM Trans. Database Syst., 2014)

Mining maximal cliques from an uncertain graph. - Arko Provo Mukherjee; Pan Xu 001; Srikanta Tirthapura (ICDE, 2015)

New Algorithms, Better Bounds, and a Novel Model for Online Stochastic Matching. - Brian Brubach; Karthik Abinav Sankararaman; Aravind Srinivasan; Pan Xu 001 (ESA, 2016)

Attenuate Locally, Win Globally: An Attenuation-based Framework for Online Stochastic Matching with Timeouts. - Brian Brubach; Karthik Abinav Sankararaman; Aravind Srinivasan; Pan Xu 001 (AAMAS, 2017)

Budgeted Online Assignment in Crowdsourcing Markets: Theory and Practice. - Pan Xu 001; Aravind Srinivasan; Kanthi K. Sarpatwar; Kun-Lung Wu (AAMAS, 2017)

The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem. - Lizhi Wang 002; Pan Xu 001 (SIAM J. Optim., 2017)

Enumeration of Maximal Cliques from an Uncertain Graph. - Arko Provo Mukherjee; Pan Xu 001; Srikanta Tirthapura (IEEE Trans. Knowl. Data Eng., 2017)

Assigning Tasks to Workers based on Historical Data: Online Task Assignment with Two-sided Arrivals. - John P. Dickerson; Karthik Abinav Sankararaman; Aravind Srinivasan; Pan Xu 001 (AAMAS, 2018)

A PTAS for a Class of Stochastic Dynamic Programs. - Hao Fu; Jian Li; Pan Xu 001 (ICALP, 2018)

Onion Curve: A Space Filling Curve with Near-Optimal Clustering. - Pan Xu 001; Cuong Nguyen; Srikanta Tirthapura (ICDE, 2018)

Improved Bounds in Stochastic Matching and Optimization. - Alok Baveja; Amit Chavan; Andrei Nikiforov; Aravind Srinivasan; Pan Xu 001 (Algorithmica, 2018)

Balancing Relevance and Diversity in Online Bipartite Matching via Submodularity. - John P. Dickerson; Karthik Abinav Sankararaman; Aravind Srinivasan; Pan Xu 001 (AAAI, 2019)

A Unified Approach to Online Matching with Conflict-Aware Constraints. - Pan Xu 001; Yexuan Shi; Hao Cheng; John P. Dickerson; Karthik Abinav Sankararaman; Aravind Srinivasan; Yongxin Tong; Leonidas Tsepenekas (AAAI, 2019)

Preference-Aware Task Assignment in On-Demand Taxi Dispatching: An Online Stable Matching Approach. - Boming Zhao; Pan Xu 001; Yexuan Shi; Yongxin Tong; Zimu Zhou; Yuxiang Zeng (AAAI, 2019)

Online Resource Allocation with Matching Constraints. - John P. Dickerson; Karthik Abinav Sankararaman; Kanthi Kiran Sarpatwar; Aravind Srinivasan; Kun-Lung Wu; Pan Xu 001 (AAMAS, 2019)

Interaction-Aware Arrangement for Event-Based Social Networks. - Feifei Kou; Zimu Zhou; Hao Cheng; Junping Du 001; Yexuan Shi; Pan Xu 001 (ICDE, 2019)

Adaptive Dynamic Bipartite Graph Matching: A Reinforcement Learning Approach. - Yansheng Wang; Yongxin Tong; Cheng Long 001; Pan Xu 001; Ke Xu 001; Weifeng Lv (ICDE, 2019)

Mix and Match: Markov Chains and Mixing Times for Matching in Rideshare. - Michael J. Curry; John P. Dickerson; Karthik Abinav Sankararaman; Aravind Srinivasan; Yuhao Wan; Pan Xu 001 (WINE, 2019)

Mix and Match: Markov Chains & Mixing Times for Matching in Rideshare. - Michael J. Curry; John P. Dickerson; Karthik Abinav Sankararaman; Aravind Srinivasan; Yuhao Wan; Pan Xu 001 (CoRR, 2019)

Matching Algorithm Design in E-Commerce: Harnessing the Power of Machine Learning via Stochastic Optimization. - Pan Xu 001 (2019)

Balancing the Tradeoff between Profit and Fairness in Rideshare Platforms during High-Demand Hours. - Vedant Nanda; Pan Xu 001; Karthik Abinav Sankararaman; John P. Dickerson; Aravind Srinivasan (AAAI, 2020)

A Unified Model for the Two-stage Offline-then-Online Resource Allocation. - Yifan Xu 002; Pan Xu 001; Jianping Pan 001; Jun Tao 003 (IJCAI, 2020)

Trade the System Efficiency for the Income Equality of Drivers in Rideshare. - Yifan Xu 002; Pan Xu 001 (IJCAI, 2020)

Attenuate Locally, Win Globally: Attenuation-Based Frameworks for Online Stochastic Matching with Timeouts. - Brian Brubach; Karthik Abinav Sankararaman; Aravind Srinivasan; Pan Xu 001 (Algorithmica, 2020)

Online Stochastic Matching: New Algorithms and Bounds. - Brian Brubach; Karthik Abinav Sankararaman; Aravind Srinivasan; Pan Xu 001 (Algorithmica, 2020)

Improved Approximation Algorithms for Stochastic-Matching Problems. - Marek Adamczyk; Brian Brubach; Fabrizio Grandoni 001; Karthik Abinav Sankararaman; Aravind Srinivasan; Pan Xu 001 (CoRR, 2020)

Group-level Fairness Maximization in Online Bipartite Matching. - Will Ma; Pan Xu 001 (CoRR, 2020)

Trading the System Efficiency for the Income Equality of Drivers in Rideshare. - Yifan Xu 002; Pan Xu 001 (CoRR, 2020)

Algorithms to Approximate Column-sparse Packing Problems. - Brian Brubach; Karthik Abinav Sankararaman; Aravind Srinivasan; Pan Xu 001 (ACM Trans. Algorithms, 2020)

Allocation Problems in Ride-sharing Platforms: Online Matching with Offline Reusable Resources. - John P. Dickerson; Karthik Abinav Sankararaman; Aravind Srinivasan; Pan Xu 001 (ACM Trans. Economics and Comput., 2021)

Equity Promotion in Online Resource Allocation. - Pan Xu 001; Yifan Xu 002 (AAAI, 2022)

Group-level Fairness Maximization in Online Bipartite Matching. - Will Ma; Pan Xu 001; Yifan Xu 002 (AAMAS, 2022)

The Generalized Magician Problem under Unknown Distributions and Related Applications. - Aravind Srinivasan; Pan Xu 001 (AAMAS, 2022)

Exploring the Tradeoff Between Competitive Ratio and Variance in Online-Matching Markets. - Pan Xu 001 (WINE, 2022)

Online minimum matching with uniform metric and random arrivals. - Sharmila V. S. Duppala; Karthik Abinav Sankararaman; Pan Xu 001 (Oper. Res. Lett., 2022)

Fairness Maximization among Offline Agents in Online-Matching Markets. - Will Ma; Pan Xu 001; Yifan Xu 002 (ACM Trans. Economics and Comput., 2022)

Equity Promotion in Public Transportation. - Anik Pramanik; Pan Xu 001; Yifan Xu 002 (AAAI, 2023)

Allocation Problem in Remote Teleoperation: Online Matching with Offline Reusable Resources and Delayed Assignments. - Osnat Ackerman Viden; Yohai Trabelsi; Pan Xu 001; Karthik Abinav Sankararaman; Oleg Maksimov; Sarit Kraus (AAMAS, 2023)

Two-Sided Capacitated Submodular Maximization in Gig Platforms. - Pan Xu 001 (WINE, 2023)

Parameter-Dependent Competitive Analysis for Online Capacitated Coverage Maximization through Boostings and Attenuations. - Pan Xu 001 (ICML, 2024)

Promoting External and Internal Equities Under Ex-Ante/Ex-Post Metrics in Online Resource Allocation. - Karthik Abinav Sankararaman; Aravind Srinivasan; Pan Xu 001 (ICML, 2024)

Design a Win-Win Strategy That Is Fair to Both Service Providers and Tasks When Rejection Is Not an Option. - Yohai Trabelsi; Pan Xu 001; Sarit Kraus (IJCAI, 2024)

Promoting Fairness Among Dynamic Agents in Online-Matching Markets under Known Stationary Arrival Distributions. - Will Ma; Pan Xu 001 (NeurIPS, 2024)

Tight Competitive and Variance Analyses of Matching Policies in Gig Platforms. - Pan Xu 001 (WWW, 2024)

Exploring the Tradeoff Between System Profit and Income Equality Among Ride-hailing Drivers. - Evan Yifan Xu; Pan Xu 001 (J. Artif. Intell. Res., 2024)

Matching Tasks and Workers under Known Arrival Distributions: Online Task Assignment with Two-sided Arrivals. - John P. Dickerson; Karthik Abinav Sankararaman; Aravind Srinivasan; Pan Xu 001; Yifan Xu 002 (ACM Trans. Economics and Comput., 2024)

Technical Note - Improved Sample-Complexity Bounds in Stochastic Optimization. - Alok Baveja; Amit Chavan; Andrei Nikiforov; Aravind Srinivasan; Pan Xu 001 (Oper. Res., 2025)

A New Regret-analysis Framework for Budgeted Multi-Armed Bandits. - Evan Yifan Xu; Pan Xu 001 (J. Artif. Intell. Res., 2025)

Optimizing Relevance and Diversity in Online Matching Markets: A Time-Adaptive Attenuation Approach. - Evan Yifan Xu; Pan Xu 001 (J. Artif. Intell. Res., 2025)