Christine Chung

Orcid: 0000-0003-3580-9275

Affiliations:
  • Connecticut College, Department of Computer Science, New London, CT, USA
  • University of Pittsburgh, Department of Computer Science, PA, USA (PhD 2009)


According to our database1, Christine Chung authored at least 28 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
New Bounds on the Performance of SBP for the Dial-a-Ride Problem with Revenues (Short Paper).
Proceedings of the 24th Symposium on Algorithmic Approaches for Transportation Modelling, 2024

2023
Earliest Deadline First Is a 2-Approximation for DARP with Time Windows.
Proceedings of the Combinatorial Optimization and Applications, 2023

2022
Robustly assigning unstable items.
J. Comb. Optim., 2022

2021
Improved Bounds for Revenue Maximization in Time-Limited Online Dial-a-Ride.
Oper. Res. Forum, 2021

Serving Rides of Equal Importance for Time-Limited Dial-a-Ride.
Proceedings of the Mathematical Optimization Theory and Operations Research, 2021

2020
Equilibria in Doodle polls under three tie-breaking rules.
Theor. Comput. Sci., 2020

New Bounds for Maximizing Revenue in Online Dial-a-Ride.
Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

2019
The SBP Algorithm for Maximizing Revenue in Online Dial-a-Ride.
CoRR, 2019

Maximizing the Number of Rides Served for Dial-a-Ride.
Proceedings of the 19th Symposium on Algorithmic Approaches for Transportation Modelling, 2019

2018
Inefficiency of Equilibria in Doodle Polls.
Proceedings of the Combinatorial Optimization and Applications, 2018

How Bad is Selfish Doodle Voting?
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

2017
Revenue Maximization in Online Dial-A-Ride.
Proceedings of the 17th Workshop on Algorithmic Approaches for Transportation Modelling, 2017

2016
Serve or skip: the power of rejection in online bottleneck matching.
J. Comb. Optim., 2016

How Well Do Doodle Polls Do?
Proceedings of the Social Informatics - 8th International Conference, 2016

2014
Online bottleneck matching.
J. Comb. Optim., 2014

Competitive Cost-Savings in Data Stream Management Systems.
Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

The Power of Rejection in Online Bottleneck Matching.
Proceedings of the Combinatorial Optimization and Applications, 2014

2013
Trends in CS enrollment at small, liberal arts institutions (abstract only).
Proceedings of the 44th ACM Technical Symposium on Computer Science Education, 2013

Data plan throttling: A simple consumer choice mechanism.
Proceedings of the 2013 IEEE Global Communications Conference, 2013

2012
Auction-based Admission Control for Continuous Queries in a Multi-Tenant DSMS.
Int. J. Next Gener. Comput., 2012

The Power of Fair Pricing Mechanisms.
Algorithmica, 2012

Completion Time Scheduling and the WSRPT Algorithm.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2010
SRPT is 1.86-Competitive for Completion Time Scheduling.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Admission control mechanisms for continuous queries in the cloud.
Proceedings of the 26th International Conference on Data Engineering, 2010

2009
On the Price of Stability for Undirected Network Design.
Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009

Stochastic Stability in Internet Router Congestion Games.
Proceedings of the Algorithmic Game Theory, Second International Symposium, 2009

2008
The Price of Stochastic Anarchy.
Proceedings of the Algorithmic Game Theory, First International Symposium, 2008

The Online Transportation Problem: On the Exponential Boost of One Extra Server.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008


  Loading...