1. Anand, S., Garg, N., & Megow, N. (2011). Meeting deadlines: How much speed suffices? International Colloquium on Automata, Languages and Programming (ICALP) (pp. 232–243).
2. Andrew, L. L. H., Barman, S., Ligett, K., Lin, M., Meyerson, A., Roytman, A., & Wierman, A. (2013). A tale of two metrics: Simultaneous bounds on competitiveness and regret. In Conference on Learning Theory (COLT), 741–763.
3. Andrew, L. L. H., Barman, S., Ligett, K., Lin, M., Meyerson, A., Roytman, A., & Wierman, A. (2015). A tale of two metrics: Simultaneous bounds on competitiveness and regret. CoRR. arXiv:1508.03769 .
4. Antoniadis, A., Barcelo, N., Nugent, M., Pruhs, K., Schewior, K., & Scquizzato, M. (2016). Chasing convex bodies and functions. Latin American Theoretical Informatics Symposium (LATIN) (pp. 68–81).
5. Bansal, N., Gupta, A., Krishnaswamy, R., Pruhs, K., Schewior, K., & Stein, C. (2015). A 2-competitive algorithm for online convex optimization with switching costs. Workshop on approximation algorithms for combinatorial optimization problems (APPROX) (pp. 96–109).