Maximizing the Probability of Arriving on Time. - Ananya Christman; Joao Cassamano (ASMTA, 2013)

Maximizing Revenues for Online-Dial-a-Ride. - Ananya Christman; William Forcier (CoRR, 2013)

Maximizing Revenues for On-Line Dial-a-Ride. - Ananya Christman; William Forcier (COCOA, 2014)

Colored Bin Packing. - Hamza Alsarhan; Davin Chia; Ananya Christman; Shannia Fu; Tony Jin (CoRR, 2015)

Bin Packing with Multiple Colors. - Hamza Alsarhan; Davin Chia; Ananya Christman; Shannia Fu; Yanfeng Jin (CoRR, 2015)

A Two-Pass Algorithm for Unordered Colored Bin Packing. - Ananya Christman; Hamza Alsarhan; Davin Chia; Shannia Fu; Yanfeng Jin (DOOR (Supplement), 2016)

Revenue Maximization in Online Dial-A-Ride. - Ananya Christman; Christine Chung 001; Nicholas Jaczko; Marina Milan; Anna Vasilchenko; Scott Westvold (ATMOS, 2017)

From theory to practice: maximizing revenues for on-line dial-a-ride. - Ananya Christman; William Forcier; Aayam Poudel (J. Comb. Optim., 2018)

Maximizing the Number of Rides Served for Dial-a-Ride. - Barbara M. Anthony; Ricky Birnbaum; Sara Boyd; Ananya Christman; Christine Chung 001; Patrick Davis; Jigar Dhimar; David S. Yuen (ATMOS, 2019)

The SBP Algorithm for Maximizing Revenue in Online Dial-a-Ride. - Ananya Christman; Christine Chung 001; Nicholas Jaczko; Tianzhi Li; Scott Westvold; Xinyue Xu (CoRR, 2019)

New Bounds for Maximizing Revenue in Online Dial-a-Ride. - Ananya Christman; Christine Chung 001; Nicholas Jaczko; Tianzhi Li; Scott Westvold; Xinyue Xu; David S. Yuen (IWOCA, 2020)

Serving Rides of Equal Importance for Time-Limited Dial-a-Ride. - Barbara M. Anthony; Ananya D. Christman; Christine Chung 001; David S. Yuen (MOTOR, 2021)

Improved Bounds for Revenue Maximization in Time-Limited Online Dial-a-Ride. - Ananya D. Christman; Christine Chung 001; Nicholas Jaczko; Tianzhi Li; Scott Westvold; Xinyue Xu; David S. Yuen (Oper. Res. Forum, 2021)

Robustly assigning unstable items. - Ananya Christman; Christine Chung 001; Nicholas Jaczko; Scott Westvold; David S. Yuen (J. Comb. Optim., 2022)

Earliest Deadline First Is a 2-Approximation for DARP with Time Windows. - Barbara M. Anthony; Christine Chung 001; Ananya Das 003; David S. Yuen (COCOA (2), 2023)

New Bounds on the Performance of SBP for the Dial-a-Ride Problem with Revenues (Short Paper). - Barbara M. Anthony; Christine Chung 001; Ananya Das 003; David S. Yuen (ATMOS, 2024)

Maximizing the number of rides served for time-limited Dial-a-Ride. - Barbara M. Anthony; Christine Chung 001; Ananya Das 003; David S. Yuen (Optim. Methods Softw., 2024)

Maximizing Rides Served for Dial-a-Ride on the Uniform Metric. - Barbara M. Anthony; Ricky Birnbaum; Sara Boyd; Christine Chung 001; Ananya Das 003; Patrick Davis; Jigar Dhimar; Duc Tran; David S. Yuen (Theory Comput. Syst., 2025)