Pan Xu
Pan Xu
Assistant Professor, Computer Science
4310 Guttenberg Information Technologies Center (GITC)
Education
Ph.D.; University of Maryland-College Park; Computer Science; 2019
Ph.D.; Iowa State University; Operations Research; 2012
M.S.; ; ; 2009
B.S.; Xidian University; Mathematics; 2007
Ph.D.; Iowa State University; Operations Research; 2012
M.S.; ; ; 2009
B.S.; Xidian University; Mathematics; 2007
Awards & Honors
2019 Larry S. Davis Doctoral Dissertation Award , University of Maryland, College Park
2024 Fall Courses
CS 725 - INDEPENDENT STUDY I
CS 792 - PRE-DOCTORAL RESEARCH
CS 667 - DESIGN TECH - ALGORITHMS
CS 701B - MASTER'S THESIS
CS 790A - DOCT DISSERTATION & RES
CS 488 - INDEPENDENT STUDY IN CS
CS 726 - INDEPENDENT STUDY II
CS 700B - MASTER'S PROJECT
CS 792 - PRE-DOCTORAL RESEARCH
CS 667 - DESIGN TECH - ALGORITHMS
CS 701B - MASTER'S THESIS
CS 790A - DOCT DISSERTATION & RES
CS 488 - INDEPENDENT STUDY IN CS
CS 726 - INDEPENDENT STUDY II
CS 700B - MASTER'S PROJECT
Teaching Interests
Introduction to Data Science;
Algorithm Design and Analysis
Algorithm Design and Analysis
Past Courses
CS 301: INTRODUCTION TO DATA SCIENCE
CS 610: DATA STRUCTURES AND ALGORITHMS
CS 667: DESIGN TECHNIQUES FOR ALGORITHMS
CS 786: SEL TOP IN COM INF SCI II
CS 610: DATA STRUCTURES AND ALGORITHMS
CS 667: DESIGN TECHNIQUES FOR ALGORITHMS
CS 786: SEL TOP IN COM INF SCI II
Research Interests
Algorithms, Operations Research, and Artificial Intelligence.
Conference Proceeding
Equity promotion in public transportation
Proceedings of the AAAI Conference on Artificial Intelligence, 2023,
Group-level Fairness Maximization in Online Bipartite Matching
Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems,
The Generalized Magician Problem under Unknown Distributions and Related Applications
Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems,
Equity Promotion in Online Resource Allocation
Proceedings of the AAAI Conference on Artificial Intelligence, 2022,
Fairness Maximization among Offline Agents in Online-Matching Markets
Proceedings of the AAAI Conference on Artificial Intelligence, 2023,
Group-level Fairness Maximization in Online Bipartite Matching
Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems,
The Generalized Magician Problem under Unknown Distributions and Related Applications
Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems,
Equity Promotion in Online Resource Allocation
Proceedings of the AAAI Conference on Artificial Intelligence, 2022,
Fairness Maximization among Offline Agents in Online-Matching Markets
SHOW MORE
Journal Article
DiStefano, T.J., & Vaso, K., & Panebianco, C.J., & Danias, G., & Chionuma, H.N., & Kunnath, K., & Karoulias, S.Z., & Wang, M., & Xu, Pan, & Davé, R.N., & Sahoo, S., & Weiser, J.R., & Iatridis, J.C. (2022). Hydrogel-Embedded Poly(Lactic-co-Glycolic Acid) Microspheres for the Delivery of hMSC-Derived Exosomes to Promote Bioactive Annulus Fibrosus Repair. Cartilage, 13(3),
Duppala, Sharmila , & Sankararaman, Karthik, & Xu, Pan Online minimum matching with uniform metric and random arrivals. Operations Research Letters,
Brubach, Brian, & Sankararaman, Karthik Abinav, & Srinivasan, Aravind, & Xu, Pan (2020). Algorithms to Approximate Column-sparse Packing Problems. ACM Trans. Algorithms, 16(1), 10:1--10:32.
Dickerson, John P., & Sankararaman, Karthik Abinav, & Srinivasan, Aravind, & Xu, Pan (2020). Allocation Problems in Ride-Sharing Platforms: Online Matching with Offline Reusable Resources. ACM,
Brubach, Brian, & Sankararaman, Karthik Abinav, & Srinivasan, Aravind, & Xu, Pan (2020). Attenuate Locally, Win Globally: Attenuation-Based Frameworks for Online Stochastic Matching with Timeouts. Algorithmica, 82(1), 64--87.
Brubach, Brian, & Sankararaman, Karthik Abinav, & Srinivasan, Aravind, & Xu, Pan (2020). Online Stochastic Matching: New Algorithms and Bounds. Algorithmica,
Duppala, Sharmila , & Sankararaman, Karthik, & Xu, Pan Online minimum matching with uniform metric and random arrivals. Operations Research Letters,
Brubach, Brian, & Sankararaman, Karthik Abinav, & Srinivasan, Aravind, & Xu, Pan (2020). Algorithms to Approximate Column-sparse Packing Problems. ACM Trans. Algorithms, 16(1), 10:1--10:32.
Dickerson, John P., & Sankararaman, Karthik Abinav, & Srinivasan, Aravind, & Xu, Pan (2020). Allocation Problems in Ride-Sharing Platforms: Online Matching with Offline Reusable Resources. ACM,
Brubach, Brian, & Sankararaman, Karthik Abinav, & Srinivasan, Aravind, & Xu, Pan (2020). Attenuate Locally, Win Globally: Attenuation-Based Frameworks for Online Stochastic Matching with Timeouts. Algorithmica, 82(1), 64--87.
Brubach, Brian, & Sankararaman, Karthik Abinav, & Srinivasan, Aravind, & Xu, Pan (2020). Online Stochastic Matching: New Algorithms and Bounds. Algorithmica,