Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPan Xu 0001
Person information
- affiliation: New Jersey Institute of Technology (NJIT), Department of Computer Science, Newark, NJ, USA
- affiliation (PhD 2019): University of Maryland, Department of Computer Science, College Park, MD, USA
- affiliation (PhD 2012): Iowa State University, Department of Industrial & Manufacturing Systems Engineering, Ames, IA, USA
Other persons with the same name
- Pan Xu — disambiguation page
- Pan Xu 0002
![[0000-0002-2559-8622]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-2559-8622")
— University of California, Los Angeles, Department of Computer Science, CA, USA (and 1 more) - Pan Xu 0003 — Tongji University, School of Electronics and Information Engineering, Shanghai, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Evan Yifan Xu, Pan Xu:
Exploring the Tradeoff Between System Profit and Income Equality Among Ride-hailing Drivers. J. Artif. Intell. Res. 79: 569-597 (2024)- [j13]John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu, Yifan Xu:
Matching Tasks and Workers under Known Arrival Distributions: Online Task Assignment with Two-sided Arrivals. ACM Trans. Economics and Comput. 12(2): 6 (2024) - [c32]Pan Xu:
Tight Competitive and Variance Analyses of Matching Policies in Gig Platforms. WWW 2024: 5-13 - 2023
- [c31]Anik Pramanik, Pan Xu, Yifan Xu:
Equity Promotion in Public Transportation. AAAI 2023: 11890-11898 - [c30]Osnat Ackerman Viden, Yohai Trabelsi, Pan Xu, Karthik Abinav Sankararaman, Oleg Maksimov, Sarit Kraus:
Allocation Problem in Remote Teleoperation: Online Matching with Offline Reusable Resources and Delayed Assignments. AAMAS 2023: 513-521 - [c29]Pan Xu:
Two-Sided Capacitated Submodular Maximization in Gig Platforms. WINE 2023: 600-617 - [i20]Pan Xu:
Two-Sided Capacitated Submodular Maximization in Gig Platforms. CoRR abs/2309.09098 (2023) - 2022
- [j12]Sharmila V. S. Duppala, Karthik Abinav Sankararaman, Pan Xu:
Online minimum matching with uniform metric and random arrivals. Oper. Res. Lett. 50(1): 45-49 (2022) - [j11]Will Ma, Pan Xu, Yifan Xu:
Fairness Maximization among Offline Agents in Online-Matching Markets. ACM Trans. Economics and Comput. 10(4): 16:1-16:27 (2022) - [c28]Pan Xu, Yifan Xu:
Equity Promotion in Online Resource Allocation. AAAI 2022: 9962-9970 - [c27]Aravind Srinivasan, Pan Xu:
The Generalized Magician Problem under Unknown Distributions and Related Applications. AAMAS 2022: 1219-1227 - [c26]Will Ma, Pan Xu, Yifan Xu:
Group-level Fairness Maximization in Online Bipartite Matching. AAMAS 2022: 1687-1689 - [c25]Pan Xu:
Exploring the Tradeoff Between Competitive Ratio and Variance in Online-Matching Markets. WINE 2022: 375 - [i19]Pan Xu:
Exploring the Tradeoff between Competitive Ratio and Variance in Online-Matching Markets. CoRR abs/2209.07580 (2022) - [i18]Anik Pramanik, Pan Xu, Yifan Xu:
Equity Promotion in Public Transportation. CoRR abs/2211.14531 (2022) - 2021
- [j10]John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Allocation Problems in Ride-sharing Platforms: Online Matching with Offline Reusable Resources. ACM Trans. Economics and Comput. 9(3): 13:1-13:17 (2021) - [c24]Will Ma, Pan Xu, Yifan Xu:
Fairness Maximization Among Offline Agents in Online-Matching Markets. WINE 2021: 547 - [i17]Will Ma, Pan Xu, Yifan Xu:
Fairness Maximization among Offline Agents in Online-Matching Markets. CoRR abs/2109.08934 (2021) - [i16]Pan Xu, Yifan Xu:
Equity Promotion in Online Resource Allocation. CoRR abs/2112.04169 (2021) - [i15]Sharmila Duppala, Karthik Abinav Sankararaman, Pan Xu:
Online minimum matching with uniform metric and random arrivals. CoRR abs/2112.05247 (2021) - 2020
- [j9]Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Attenuate Locally, Win Globally: Attenuation-Based Frameworks for Online Stochastic Matching with Timeouts. Algorithmica 82(1): 64-87 (2020) - [j8]Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Online Stochastic Matching: New Algorithms and Bounds. Algorithmica 82(10): 2737-2783 (2020) - [j7]Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Algorithms to Approximate Column-sparse Packing Problems. ACM Trans. Algorithms 16(1): 10:1-10:32 (2020) - [c23]Vedant Nanda, Pan Xu, Karthik Abinav Sankararaman, John P. Dickerson, Aravind Srinivasan:
Balancing the Tradeoff between Profit and Fairness in Rideshare Platforms during High-Demand Hours. AAAI 2020: 2210-2217 - [c22]Vedant Nanda, Pan Xu, Karthik Abinav Sankararaman, John P. Dickerson, Aravind Srinivasan:
Balancing the Tradeoff between Profit and Fairness in Rideshare Platforms during High-Demand Hours. AIES 2020: 131 - [c21]Yifan Xu, Pan Xu:
Trade the System Efficiency for the Income Equality of Drivers in Rideshare. IJCAI 2020: 4199-4205 - [c20]Yifan Xu, Pan Xu, Jianping Pan, Jun Tao:
A Unified Model for the Two-stage Offline-then-Online Resource Allocation. IJCAI 2020: 4206-4212 - [i14]Marek Adamczyk, Brian Brubach, Fabrizio Grandoni, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Improved Approximation Algorithms for Stochastic-Matching Problems. CoRR abs/2010.08142 (2020) - [i13]Will Ma, Pan Xu:
Group-level Fairness Maximization in Online Bipartite Matching. CoRR abs/2011.13908 (2020) - [i12]Yifan Xu, Pan Xu, Jianping Pan, Jun Tao:
A Unified Model for the Two-stage Offline-then-Online Resource Allocation. CoRR abs/2012.06845 (2020) - [i11]Yifan Xu, Pan Xu:
Trading the System Efficiency for the Income Equality of Drivers in Rideshare. CoRR abs/2012.06850 (2020)
2010 – 2019
- 2019
- [b1]Pan Xu:
Matching Algorithm Design in E-Commerce: Harnessing the Power of Machine Learning via Stochastic Optimization. University of Maryland, College Park, MD, USA, 2019 - [c19]John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Balancing Relevance and Diversity in Online Bipartite Matching via Submodularity. AAAI 2019: 1877-1884 - [c18]Pan Xu, Yexuan Shi, Hao Cheng, John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Yongxin Tong, Leonidas Tsepenekas:
A Unified Approach to Online Matching with Conflict-Aware Constraints. AAAI 2019: 2221-2228 - [c17]Boming Zhao, Pan Xu, Yexuan Shi, Yongxin Tong, Zimu Zhou, Yuxiang Zeng:
Preference-Aware Task Assignment in On-Demand Taxi Dispatching: An Online Stable Matching Approach. AAAI 2019: 2245-2252 - [c16]John P. Dickerson, Karthik Abinav Sankararaman, Kanthi Kiran Sarpatwar, Aravind Srinivasan, Kun-Lung Wu, Pan Xu:
Online Resource Allocation with Matching Constraints. AAMAS 2019: 1681-1689 - [c15]Yansheng Wang, Yongxin Tong, Cheng Long, Pan Xu, Ke Xu, Weifeng Lv:
Adaptive Dynamic Bipartite Graph Matching: A Reinforcement Learning Approach. ICDE 2019: 1478-1489 - [c14]Feifei Kou, Zimu Zhou, Hao Cheng, Junping Du, Yexuan Shi, Pan Xu:
Interaction-Aware Arrangement for Event-Based Social Networks. ICDE 2019: 1638-1641 - [c13]Michael J. Curry, John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Yuhao Wan, Pan Xu:
Mix and Match: Markov Chains and Mixing Times for Matching in Rideshare. WINE 2019: 129-141 - [i10]Michael J. Curry, John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Yuhao Wan, Pan Xu:
Mix and Match: Markov Chains & Mixing Times for Matching in Rideshare. CoRR abs/1912.00225 (2019) - [i9]Vedant Nanda, Pan Xu, Karthik Abinav Sankararaman, John P. Dickerson, Aravind Srinivasan:
Balancing the Tradeoff between Profit and Fairness in Rideshare Platforms During High-Demand Hours. CoRR abs/1912.08388 (2019) - 2018
- [j6]Alok Baveja, Amit Chavan, Andrei Nikiforov, Aravind Srinivasan, Pan Xu:
Improved Bounds in Stochastic Matching and Optimization. Algorithmica 80(11): 3225-3252 (2018) - [c12]John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Allocation Problems in Ride-Sharing Platforms: Online Matching With Offline Reusable Resources. AAAI 2018: 1007-1014 - [c11]John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Assigning Tasks to Workers based on Historical Data: Online Task Assignment with Two-sided Arrivals. AAMAS 2018: 318-326 - [c10]Hao Fu, Jian Li, Pan Xu:
A PTAS for a Class of Stochastic Dynamic Programs. ICALP 2018: 56:1-56:14 - [c9]Pan Xu, Cuong Nguyen, Srikanta Tirthapura:
Onion Curve: A Space Filling Curve with Near-Optimal Clustering. ICDE 2018: 1236-1239 - [c8]Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Algorithms to Approximate Column-Sparse Packing Problems. SODA 2018: 311-330 - [i8]Pan Xu, Cuong Nguyen, Srikanta Tirthapura:
Onion Curve: A Space Filling Curve with Near-Optimal Clustering. CoRR abs/1801.07399 (2018) - [i7]Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Attenuate Locally, Win Globally: An Attenuation-based Framework for Online Stochastic Matching with Timeouts. CoRR abs/1804.08062 (2018) - [i6]Hao Fu, Jian Li, Pan Xu:
A PTAS for a Class of Stochastic Dynamic Programs. CoRR abs/1805.07742 (2018) - [i5]John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Balancing Relevance and Diversity in Online Bipartite Matching via Submodularity. CoRR abs/1811.05100 (2018) - 2017
- [j5]Lizhi Wang, Pan Xu:
The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem. SIAM J. Optim. 27(3): 1403-1430 (2017) - [j4]Arko Provo Mukherjee, Pan Xu, Srikanta Tirthapura:
Enumeration of Maximal Cliques from an Uncertain Graph. IEEE Trans. Knowl. Data Eng. 29(3): 543-555 (2017) - [c7]Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Attenuate Locally, Win Globally: An Attenuation-based Framework for Online Stochastic Matching with Timeouts. AAMAS 2017: 1223-1231 - [c6]Pan Xu, Aravind Srinivasan, Kanthi K. Sarpatwar, Kun-Lung Wu:
Budgeted Online Assignment in Crowdsourcing Markets: Theory and Practice. AAMAS 2017: 1763-1765 - [i4]Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Algorithms to Approximate Column-Sparse Packing Problems. CoRR abs/1711.02724 (2017) - [i3]John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Allocation Problems in Ride-Sharing Platforms: Online Matching with Offline Reusable Resources. CoRR abs/1711.08345 (2017) - 2016
- [c5]Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
New Algorithms, Better Bounds, and a Novel Model for Online Stochastic Matching. ESA 2016: 24:1-24:16 - [i2]Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
New Algorithms, Better Bounds, and a Novel Model for Online Stochastic Matching. CoRR abs/1606.06395 (2016) - 2015
- [c4]Alok Baveja, Amit Chavan, Andrei Nikiforov, Aravind Srinivasan, Pan Xu:
Improved Bounds in Stochastic Matching and Optimization. APPROX-RANDOM 2015: 124-134 - [c3]Arko Provo Mukherjee, Pan Xu, Srikanta Tirthapura:
Mining maximal cliques from an uncertain graph. ICDE 2015: 243-254 - 2014
- [j3]Pan Xu, Lizhi Wang:
An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions. Comput. Oper. Res. 41: 309-318 (2014) - [j2]Pan Xu, Srikanta Tirthapura:
Optimality of Clustering Properties of Space-Filling Curves. ACM Trans. Database Syst. 39(2): 10:1-10:27 (2014) - 2013
- [i1]Arko Provo Mukherjee, Pan Xu, Srikanta Tirthapura:
Mining Maximal Cliques from an Uncertain Graph. CoRR abs/1310.6780 (2013) - 2012
- [c2]Pan Xu, Srikanta Tirthapura:
A Lower Bound on Proximity Preservation by Space Filling Curves. IPDPS 2012: 1295-1305 - [c1]Pan Xu, Srikanta Tirthapura:
On the optimality of clustering properties of space filling curves. PODS 2012: 215-224 - 2011
- [j1]Pan Xu, Lizhi Wang, William D. Beavis:
An optimization approach to gene stacking. Eur. J. Oper. Res. 214(1): 168-178 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-24 00:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
