The Online Transportation Problem: On the Exponential Boost of One Extra Server. - Christine Chung 001; Kirk Pruhs; Patchrawat Uthaisombut (LATIN, 2008)

The Price of Stochastic Anarchy. - Christine Chung 001; Katrina Ligett; Kirk Pruhs; Aaron Roth 001 (SAGT, 2008)

Stochastic Stability in Internet Router Congestion Games. - Christine Chung 001; Evangelia Pyrga (SAGT, 2009)

On the Price of Stability for Undirected Network Design. - George Christodoulou 001; Christine Chung 001; Katrina Ligett; Evangelia Pyrga; Rob van Stee (WAOA, 2009)

Admission control mechanisms for continuous queries in the cloud. - Lory Al Moakar; Panos K. Chrysanthis; Christine Chung 001; Shenoda Guirguis; Alexandros Labrinidis; Panayiotis Neophytou; Kirk Pruhs (ICDE, 2010)

SRPT is 1.86-Competitive for Completion Time Scheduling. - Christine Chung 001; Tim Nonner; Alexander Souza (SODA, 2010)

Expanding CS1: applications across the liberal arts. - Bridget Baird; Christine Chung 001 (J. Comput. Sci. Coll., 2010)

Expanding student enthusiasm for, and understanding of, introductory CS: panel discussion. - Bridget Baird; Martin Allen; Christine Chung 001; Norman Danner; Madalene Spezialetti (J. Comput. Sci. Coll., 2010)

Completion Time Scheduling and the WSRPT Algorithm. - Bo Xiong; Christine Chung 001 (ISCO, 2012)

The Power of Fair Pricing Mechanisms. - Christine Chung 001; Katrina Ligett; Kirk Pruhs; Aaron Roth 001 (Algorithmica, 2012)

Auction-based Admission Control for Continuous Queries in a Multi-Tenant DSMS. - Lory Al Moakar; Panos K. Chrysanthis; Christine Chung 001; Shenoda Guirguis; Alexandros Labrinidis; Panayiotis Neophytou; Kirk Pruhs (Int. J. Next Gener. Comput., 2012)

Data plan throttling: A simple consumer choice mechanism. - Barbara M. Anthony; Christine Chung 001 (GLOBECOM, 2013)

Trends in CS enrollment at small, liberal arts institutions (abstract only). - Barbara M. Anthony; Lisa Bender; Christine Chung 001; Mark Lewis (SIGCSE, 2013)

The Power of Rejection in Online Bottleneck Matching. - Barbara M. Anthony; Christine Chung 001 (COCOA, 2014)

Competitive Cost-Savings in Data Stream Management Systems. - Christine Chung 001; Shenoda Guirguis; Anastasia Kurdia (COCOON, 2014)

Online bottleneck matching. - Barbara M. Anthony; Christine Chung 001 (J. Comb. Optim., 2014)

How Well Do Doodle Polls Do? - Danya Alrawi; Barbara M. Anthony; Christine Chung 001 (SocInfo (1), 2016)

Serve or skip: the power of rejection in online bottleneck matching. - Barbara M. Anthony; Christine Chung 001 (J. Comb. Optim., 2016)

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

How Bad is Selfish Doodle Voting? - Barbara M. Anthony; Christine Chung 001 (AAMAS, 2018)

Inefficiency of Equilibria in Doodle Polls. - Barbara M. Anthony; Christine Chung 001 (COCOA, 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)

Equilibria in Doodle polls under three tie-breaking rules. - Barbara M. Anthony; Christine Chung 001 (Theor. Comput. Sci., 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)

A Case for Copeland: from Theory to Practice. - Michelle Le; Chloe Nguyen; Leo Claney; Krishh Tipnis; Brian MacSweeney; Eric Huber; Christine Chung 001 (IJTCS-FAW, 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)